./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:45:28,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:45:28,677 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 19:45:28,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:45:28,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:45:28,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:45:28,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:45:28,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:45:28,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:45:28,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:45:28,713 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:45:28,713 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:45:28,714 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:45:28,714 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:45:28,715 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:45:28,715 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:45:28,716 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:45:28,716 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:45:28,717 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:45:28,717 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:45:28,718 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:45:28,719 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:45:28,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:45:28,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:45:28,720 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:45:28,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:45:28,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:45:28,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:45:28,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:45:28,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:45:28,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:45:28,723 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 19:45:28,723 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:45:28,723 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:45:28,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:45:28,724 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:45:28,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:45:28,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:45:28,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:45:28,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:45:28,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:45:28,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:45:28,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:45:28,726 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:45:28,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:45:28,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:45:28,726 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:45:28,726 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:45:28,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:45:28,727 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_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 [2023-12-02 19:45:28,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:45:29,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:45:29,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:45:29,008 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:45:29,008 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:45:29,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2023-12-02 19:45:31,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:45:31,918 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:45:31,918 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2023-12-02 19:45:31,926 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/data/3d360f4c4/dbe1c17c60e04fe48df3a532bc34b084/FLAG492e35f40 [2023-12-02 19:45:31,939 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/data/3d360f4c4/dbe1c17c60e04fe48df3a532bc34b084 [2023-12-02 19:45:31,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:45:31,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:45:31,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:45:31,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:45:31,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:45:31,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:45:31" (1/1) ... [2023-12-02 19:45:31,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cdf92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:31, skipping insertion in model container [2023-12-02 19:45:31,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:45:31" (1/1) ... [2023-12-02 19:45:31,975 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:45:32,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:45:32,161 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:45:32,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:45:32,202 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 19:45:32,202 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 19:45:32,208 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:45:32,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32 WrapperNode [2023-12-02 19:45:32,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:45:32,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:45:32,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:45:32,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:45:32,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,253 INFO L138 Inliner]: procedures = 27, calls = 74, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 314 [2023-12-02 19:45:32,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:45:32,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:45:32,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:45:32,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:45:32,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:45:32,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:45:32,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:45:32,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:45:32,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (1/1) ... [2023-12-02 19:45:32,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:45:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:45:32,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:45:32,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:45:32,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:45:32,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:45:32,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:45:32,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:45:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 19:45:32,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 19:45:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 19:45:32,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 19:45:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 19:45:32,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 19:45:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-02 19:45:32,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-02 19:45:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:45:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 19:45:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 19:45:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:45:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:45:32,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:45:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:45:32,371 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 19:45:32,488 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:45:32,491 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:45:32,957 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:45:33,499 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:45:33,499 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 19:45:33,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:45:33 BoogieIcfgContainer [2023-12-02 19:45:33,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:45:33,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:45:33,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:45:33,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:45:33,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:45:31" (1/3) ... [2023-12-02 19:45:33,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe57d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:45:33, skipping insertion in model container [2023-12-02 19:45:33,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:45:32" (2/3) ... [2023-12-02 19:45:33,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe57d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:45:33, skipping insertion in model container [2023-12-02 19:45:33,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:45:33" (3/3) ... [2023-12-02 19:45:33,509 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2023-12-02 19:45:33,520 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 19:45:33,531 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:45:33,531 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-12-02 19:45:33,531 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 19:45:33,691 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2023-12-02 19:45:33,725 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 92 transitions, 224 flow [2023-12-02 19:45:34,700 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 20835 states, 20103 states have (on average 4.242849325971248) internal successors, (85294), 20834 states have internal predecessors, (85294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:34,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:45:34,723 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;@29ddf86d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:45:34,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2023-12-02 19:45:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 20835 states, 20103 states have (on average 4.242849325971248) internal successors, (85294), 20834 states have internal predecessors, (85294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 19:45:34,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:34,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 19:45:34,760 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:34,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:34,765 INFO L85 PathProgramCache]: Analyzing trace with hash 34064, now seen corresponding path program 1 times [2023-12-02 19:45:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:34,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336140180] [2023-12-02 19:45:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:34,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:35,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:35,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336140180] [2023-12-02 19:45:35,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336140180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:45:35,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:45:35,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 19:45:35,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295695783] [2023-12-02 19:45:35,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:45:35,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:45:35,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:35,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:45:35,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:35,095 INFO L87 Difference]: Start difference. First operand has 20835 states, 20103 states have (on average 4.242849325971248) internal successors, (85294), 20834 states have internal predecessors, (85294), 0 states have call successors, (0), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:35,620 INFO L93 Difference]: Finished difference Result 14406 states and 56401 transitions. [2023-12-02 19:45:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:45:35,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 19:45:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:35,867 INFO L225 Difference]: With dead ends: 14406 [2023-12-02 19:45:35,867 INFO L226 Difference]: Without dead ends: 14406 [2023-12-02 19:45:35,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:35,872 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:35,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 9 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:45:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14406 states. [2023-12-02 19:45:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14406 to 14406. [2023-12-02 19:45:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14406 states, 14061 states have (on average 4.0111656354455585) internal successors, (56401), 14405 states have internal predecessors, (56401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14406 states to 14406 states and 56401 transitions. [2023-12-02 19:45:36,766 INFO L78 Accepts]: Start accepts. Automaton has 14406 states and 56401 transitions. Word has length 2 [2023-12-02 19:45:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:36,767 INFO L495 AbstractCegarLoop]: Abstraction has 14406 states and 56401 transitions. [2023-12-02 19:45:36,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14406 states and 56401 transitions. [2023-12-02 19:45:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 19:45:36,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:36,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 19:45:36,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:45:36,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:36,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1057029, now seen corresponding path program 1 times [2023-12-02 19:45:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:36,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458461304] [2023-12-02 19:45:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:36,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:36,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458461304] [2023-12-02 19:45:36,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458461304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:45:36,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:45:36,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 19:45:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794099910] [2023-12-02 19:45:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:45:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:45:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:45:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:36,826 INFO L87 Difference]: Start difference. First operand 14406 states and 56401 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:37,307 INFO L93 Difference]: Finished difference Result 11755 states and 45936 transitions. [2023-12-02 19:45:37,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:45:37,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-12-02 19:45:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:37,401 INFO L225 Difference]: With dead ends: 11755 [2023-12-02 19:45:37,402 INFO L226 Difference]: Without dead ends: 11755 [2023-12-02 19:45:37,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:37,404 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:37,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 9 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:45:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11755 states. [2023-12-02 19:45:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11755 to 11755. [2023-12-02 19:45:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11755 states, 11538 states have (on average 3.9812792511700468) internal successors, (45936), 11754 states have internal predecessors, (45936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11755 states to 11755 states and 45936 transitions. [2023-12-02 19:45:37,957 INFO L78 Accepts]: Start accepts. Automaton has 11755 states and 45936 transitions. Word has length 3 [2023-12-02 19:45:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:37,958 INFO L495 AbstractCegarLoop]: Abstraction has 11755 states and 45936 transitions. [2023-12-02 19:45:37,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 11755 states and 45936 transitions. [2023-12-02 19:45:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 19:45:37,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:37,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 19:45:37,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:45:37,959 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:37,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1015838821, now seen corresponding path program 1 times [2023-12-02 19:45:37,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:37,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11050061] [2023-12-02 19:45:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:37,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:38,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11050061] [2023-12-02 19:45:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11050061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:45:38,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:45:38,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:45:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365689653] [2023-12-02 19:45:38,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:45:38,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:45:38,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:38,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:45:38,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:45:38,065 INFO L87 Difference]: Start difference. First operand 11755 states and 45936 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:38,398 INFO L93 Difference]: Finished difference Result 11758 states and 45940 transitions. [2023-12-02 19:45:38,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:45:38,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 19:45:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:38,536 INFO L225 Difference]: With dead ends: 11758 [2023-12-02 19:45:38,536 INFO L226 Difference]: Without dead ends: 11758 [2023-12-02 19:45:38,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:45:38,538 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:38,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:45:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11758 states. [2023-12-02 19:45:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11758 to 11758. [2023-12-02 19:45:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11758 states, 11541 states have (on average 3.9805909366606014) internal successors, (45940), 11757 states have internal predecessors, (45940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11758 states to 11758 states and 45940 transitions. [2023-12-02 19:45:39,062 INFO L78 Accepts]: Start accepts. Automaton has 11758 states and 45940 transitions. Word has length 5 [2023-12-02 19:45:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:39,062 INFO L495 AbstractCegarLoop]: Abstraction has 11758 states and 45940 transitions. [2023-12-02 19:45:39,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 11758 states and 45940 transitions. [2023-12-02 19:45:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 19:45:39,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:39,063 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:39,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 19:45:39,064 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:39,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash 515832159, now seen corresponding path program 1 times [2023-12-02 19:45:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:39,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879030191] [2023-12-02 19:45:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:39,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:39,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879030191] [2023-12-02 19:45:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879030191] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944749072] [2023-12-02 19:45:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:39,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:39,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:45:39,184 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:45:39,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:45:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:39,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 19:45:39,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:39,463 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:45:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944749072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:45:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:45:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 19:45:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738280483] [2023-12-02 19:45:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:45:39,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:45:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:45:39,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:45:39,466 INFO L87 Difference]: Start difference. First operand 11758 states and 45940 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:39,767 INFO L93 Difference]: Finished difference Result 11757 states and 45939 transitions. [2023-12-02 19:45:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:45:39,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 19:45:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:39,819 INFO L225 Difference]: With dead ends: 11757 [2023-12-02 19:45:39,819 INFO L226 Difference]: Without dead ends: 11757 [2023-12-02 19:45:39,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 19:45:39,820 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:39,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:45:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11757 states. [2023-12-02 19:45:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11757 to 11757. [2023-12-02 19:45:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11757 states, 11541 states have (on average 3.9805042890564075) internal successors, (45939), 11756 states have internal predecessors, (45939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 45939 transitions. [2023-12-02 19:45:40,272 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 45939 transitions. Word has length 8 [2023-12-02 19:45:40,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:40,272 INFO L495 AbstractCegarLoop]: Abstraction has 11757 states and 45939 transitions. [2023-12-02 19:45:40,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 45939 transitions. [2023-12-02 19:45:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 19:45:40,273 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:40,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-12-02 19:45:40,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:45:40,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:40,474 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:40,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:40,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1189071163, now seen corresponding path program 1 times [2023-12-02 19:45:40,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:40,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402431313] [2023-12-02 19:45:40,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:40,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:40,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:40,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402431313] [2023-12-02 19:45:40,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402431313] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:40,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204239264] [2023-12-02 19:45:40,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:40,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:40,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:45:40,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:45:40,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:45:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:40,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 19:45:40,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:40,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:45:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:40,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204239264] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:45:40,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1554063350] [2023-12-02 19:45:40,752 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:45:40,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:45:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-02 19:45:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453616713] [2023-12-02 19:45:40,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:45:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 19:45:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:40,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 19:45:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 19:45:40,756 INFO L87 Difference]: Start difference. First operand 11757 states and 45939 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:41,172 INFO L93 Difference]: Finished difference Result 11766 states and 45951 transitions. [2023-12-02 19:45:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 19:45:41,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 19:45:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:41,224 INFO L225 Difference]: With dead ends: 11766 [2023-12-02 19:45:41,224 INFO L226 Difference]: Without dead ends: 11766 [2023-12-02 19:45:41,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2023-12-02 19:45:41,225 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:41,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:45:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11766 states. [2023-12-02 19:45:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11766 to 11766. [2023-12-02 19:45:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11766 states, 11550 states have (on average 3.9784415584415584) internal successors, (45951), 11765 states have internal predecessors, (45951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11766 states to 11766 states and 45951 transitions. [2023-12-02 19:45:41,603 INFO L78 Accepts]: Start accepts. Automaton has 11766 states and 45951 transitions. Word has length 9 [2023-12-02 19:45:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:41,603 INFO L495 AbstractCegarLoop]: Abstraction has 11766 states and 45951 transitions. [2023-12-02 19:45:41,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 11766 states and 45951 transitions. [2023-12-02 19:45:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 19:45:41,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:41,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:41,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:45:41,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:41,885 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:41,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash -378211551, now seen corresponding path program 1 times [2023-12-02 19:45:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:41,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703505516] [2023-12-02 19:45:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:41,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:41,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:41,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703505516] [2023-12-02 19:45:41,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703505516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:45:41,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:45:41,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:45:41,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359415345] [2023-12-02 19:45:41,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:45:41,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:45:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:41,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:45:41,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:41,947 INFO L87 Difference]: Start difference. First operand 11766 states and 45951 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:42,269 INFO L93 Difference]: Finished difference Result 16368 states and 64107 transitions. [2023-12-02 19:45:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:45:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 19:45:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:42,353 INFO L225 Difference]: With dead ends: 16368 [2023-12-02 19:45:42,353 INFO L226 Difference]: Without dead ends: 16368 [2023-12-02 19:45:42,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:42,354 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:42,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 22 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:45:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16368 states. [2023-12-02 19:45:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16368 to 14148. [2023-12-02 19:45:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14148 states, 13932 states have (on average 4.025337352856733) internal successors, (56081), 14147 states have internal predecessors, (56081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 56081 transitions. [2023-12-02 19:45:42,924 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 56081 transitions. Word has length 12 [2023-12-02 19:45:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:42,925 INFO L495 AbstractCegarLoop]: Abstraction has 14148 states and 56081 transitions. [2023-12-02 19:45:42,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 56081 transitions. [2023-12-02 19:45:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 19:45:42,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:42,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:42,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 19:45:42,928 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:42,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1496423326, now seen corresponding path program 1 times [2023-12-02 19:45:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632456851] [2023-12-02 19:45:42,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:42,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:42,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632456851] [2023-12-02 19:45:42,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632456851] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:45:42,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:45:42,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:45:42,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380793845] [2023-12-02 19:45:42,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:45:42,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:45:42,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:42,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:45:42,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:42,996 INFO L87 Difference]: Start difference. First operand 14148 states and 56081 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:43,489 INFO L93 Difference]: Finished difference Result 18484 states and 73165 transitions. [2023-12-02 19:45:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:45:43,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 19:45:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:43,585 INFO L225 Difference]: With dead ends: 18484 [2023-12-02 19:45:43,585 INFO L226 Difference]: Without dead ends: 18484 [2023-12-02 19:45:43,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:43,586 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:43,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 20 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:45:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18484 states. [2023-12-02 19:45:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18484 to 17676. [2023-12-02 19:45:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17676 states, 17460 states have (on average 4.037514318442153) internal successors, (70495), 17675 states have internal predecessors, (70495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17676 states to 17676 states and 70495 transitions. [2023-12-02 19:45:44,100 INFO L78 Accepts]: Start accepts. Automaton has 17676 states and 70495 transitions. Word has length 13 [2023-12-02 19:45:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:44,100 INFO L495 AbstractCegarLoop]: Abstraction has 17676 states and 70495 transitions. [2023-12-02 19:45:44,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 17676 states and 70495 transitions. [2023-12-02 19:45:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 19:45:44,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:44,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:44,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 19:45:44,102 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:44,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1160345005, now seen corresponding path program 1 times [2023-12-02 19:45:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688675408] [2023-12-02 19:45:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:44,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688675408] [2023-12-02 19:45:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688675408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:45:44,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:45:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:45:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284818370] [2023-12-02 19:45:44,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:45:44,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:45:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:44,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:45:44,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:45:44,200 INFO L87 Difference]: Start difference. First operand 17676 states and 70495 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:44,837 INFO L93 Difference]: Finished difference Result 26423 states and 103670 transitions. [2023-12-02 19:45:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:45:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 19:45:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:45,003 INFO L225 Difference]: With dead ends: 26423 [2023-12-02 19:45:45,004 INFO L226 Difference]: Without dead ends: 26101 [2023-12-02 19:45:45,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:45:45,005 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 89 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:45,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 41 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:45:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26101 states. [2023-12-02 19:45:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26101 to 23293. [2023-12-02 19:45:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23293 states, 23042 states have (on average 4.001041576252061) internal successors, (92192), 23292 states have internal predecessors, (92192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23293 states to 23293 states and 92192 transitions. [2023-12-02 19:45:45,968 INFO L78 Accepts]: Start accepts. Automaton has 23293 states and 92192 transitions. Word has length 13 [2023-12-02 19:45:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:45,969 INFO L495 AbstractCegarLoop]: Abstraction has 23293 states and 92192 transitions. [2023-12-02 19:45:45,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 23293 states and 92192 transitions. [2023-12-02 19:45:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 19:45:45,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:45,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:45,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 19:45:45,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:45,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash 855518316, now seen corresponding path program 1 times [2023-12-02 19:45:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:45,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231768939] [2023-12-02 19:45:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:45,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:46,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:46,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231768939] [2023-12-02 19:45:46,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231768939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:45:46,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:45:46,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:45:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861665849] [2023-12-02 19:45:46,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:45:46,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:45:46,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:46,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:45:46,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:46,086 INFO L87 Difference]: Start difference. First operand 23293 states and 92192 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:46,399 INFO L93 Difference]: Finished difference Result 30149 states and 118910 transitions. [2023-12-02 19:45:46,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:45:46,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-12-02 19:45:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:46,722 INFO L225 Difference]: With dead ends: 30149 [2023-12-02 19:45:46,723 INFO L226 Difference]: Without dead ends: 30149 [2023-12-02 19:45:46,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:45:46,723 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:46,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 20 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:45:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30149 states. [2023-12-02 19:45:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30149 to 27229. [2023-12-02 19:45:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27229 states, 26978 states have (on average 4.116539402476092) internal successors, (111056), 27228 states have internal predecessors, (111056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27229 states to 27229 states and 111056 transitions. [2023-12-02 19:45:47,480 INFO L78 Accepts]: Start accepts. Automaton has 27229 states and 111056 transitions. Word has length 14 [2023-12-02 19:45:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:47,480 INFO L495 AbstractCegarLoop]: Abstraction has 27229 states and 111056 transitions. [2023-12-02 19:45:47,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 27229 states and 111056 transitions. [2023-12-02 19:45:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 19:45:47,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:47,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:47,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 19:45:47,482 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:47,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash 855518313, now seen corresponding path program 1 times [2023-12-02 19:45:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:47,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819522937] [2023-12-02 19:45:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:47,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819522937] [2023-12-02 19:45:47,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819522937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:45:47,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:45:47,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:45:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235291860] [2023-12-02 19:45:47,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:45:47,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:45:47,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:47,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:45:47,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:45:47,580 INFO L87 Difference]: Start difference. First operand 27229 states and 111056 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:48,131 INFO L93 Difference]: Finished difference Result 22537 states and 91230 transitions. [2023-12-02 19:45:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:45:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-12-02 19:45:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:48,226 INFO L225 Difference]: With dead ends: 22537 [2023-12-02 19:45:48,226 INFO L226 Difference]: Without dead ends: 20628 [2023-12-02 19:45:48,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:45:48,227 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:48,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 19:45:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20628 states. [2023-12-02 19:45:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20628 to 20628. [2023-12-02 19:45:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20628 states, 20412 states have (on average 4.150695669214188) internal successors, (84724), 20627 states have internal predecessors, (84724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20628 states to 20628 states and 84724 transitions. [2023-12-02 19:45:49,015 INFO L78 Accepts]: Start accepts. Automaton has 20628 states and 84724 transitions. Word has length 14 [2023-12-02 19:45:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:49,016 INFO L495 AbstractCegarLoop]: Abstraction has 20628 states and 84724 transitions. [2023-12-02 19:45:49,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 20628 states and 84724 transitions. [2023-12-02 19:45:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 19:45:49,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:49,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:49,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 19:45:49,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:49,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash -676307801, now seen corresponding path program 1 times [2023-12-02 19:45:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727840785] [2023-12-02 19:45:49,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:49,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:49,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:49,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727840785] [2023-12-02 19:45:49,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727840785] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:49,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112937519] [2023-12-02 19:45:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:49,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:49,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:45:49,150 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:45:49,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:45:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:49,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 19:45:49,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:49,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:45:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:49,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112937519] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:45:49,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1842680056] [2023-12-02 19:45:49,460 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:45:49,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:45:49,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-12-02 19:45:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927409857] [2023-12-02 19:45:49,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:45:49,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 19:45:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 19:45:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:45:49,462 INFO L87 Difference]: Start difference. First operand 20628 states and 84724 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:50,205 INFO L93 Difference]: Finished difference Result 30851 states and 124727 transitions. [2023-12-02 19:45:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 19:45:50,206 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 19:45:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:50,316 INFO L225 Difference]: With dead ends: 30851 [2023-12-02 19:45:50,316 INFO L226 Difference]: Without dead ends: 30529 [2023-12-02 19:45:50,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-02 19:45:50,317 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 269 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:50,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 98 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 19:45:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30529 states. [2023-12-02 19:45:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30529 to 27229. [2023-12-02 19:45:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27229 states, 26978 states have (on average 4.1165023352361185) internal successors, (111055), 27228 states have internal predecessors, (111055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27229 states to 27229 states and 111055 transitions. [2023-12-02 19:45:51,093 INFO L78 Accepts]: Start accepts. Automaton has 27229 states and 111055 transitions. Word has length 16 [2023-12-02 19:45:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:51,093 INFO L495 AbstractCegarLoop]: Abstraction has 27229 states and 111055 transitions. [2023-12-02 19:45:51,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 27229 states and 111055 transitions. [2023-12-02 19:45:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:45:51,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:51,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:51,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 19:45:51,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 19:45:51,296 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:51,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash -246143825, now seen corresponding path program 1 times [2023-12-02 19:45:51,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:51,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921024975] [2023-12-02 19:45:51,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:51,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:51,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921024975] [2023-12-02 19:45:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921024975] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122343424] [2023-12-02 19:45:51,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:51,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:51,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:45:51,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:45:51,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:45:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:51,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 19:45:51,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:51,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:45:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122343424] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:45:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [588790985] [2023-12-02 19:45:51,838 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:45:51,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:45:51,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-12-02 19:45:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807122745] [2023-12-02 19:45:51,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:45:51,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 19:45:51,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:51,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 19:45:51,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:45:51,842 INFO L87 Difference]: Start difference. First operand 27229 states and 111055 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:52,427 INFO L93 Difference]: Finished difference Result 22537 states and 90149 transitions. [2023-12-02 19:45:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 19:45:52,427 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 19:45:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:52,495 INFO L225 Difference]: With dead ends: 22537 [2023-12-02 19:45:52,495 INFO L226 Difference]: Without dead ends: 20100 [2023-12-02 19:45:52,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-02 19:45:52,496 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 100 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:52,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 19:45:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20100 states. [2023-12-02 19:45:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20100 to 18780. [2023-12-02 19:45:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18780 states, 18554 states have (on average 4.136197046458984) internal successors, (76743), 18779 states have internal predecessors, (76743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18780 states to 18780 states and 76743 transitions. [2023-12-02 19:45:53,090 INFO L78 Accepts]: Start accepts. Automaton has 18780 states and 76743 transitions. Word has length 17 [2023-12-02 19:45:53,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:53,090 INFO L495 AbstractCegarLoop]: Abstraction has 18780 states and 76743 transitions. [2023-12-02 19:45:53,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 18780 states and 76743 transitions. [2023-12-02 19:45:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:45:53,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:53,091 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2023-12-02 19:45:53,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 19:45:53,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 19:45:53,291 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:53,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash 35785983, now seen corresponding path program 2 times [2023-12-02 19:45:53,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:53,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234432283] [2023-12-02 19:45:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:53,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:53,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234432283] [2023-12-02 19:45:53,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234432283] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:53,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611332827] [2023-12-02 19:45:53,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:45:53,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:53,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:45:53,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:45:53,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:45:53,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 19:45:53,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:45:53,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:45:53,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 19:45:53,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:45:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 19:45:53,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611332827] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:45:53,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2104549412] [2023-12-02 19:45:53,677 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:45:53,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:45:53,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 13 [2023-12-02 19:45:53,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21263496] [2023-12-02 19:45:53,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:45:53,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 19:45:53,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:53,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 19:45:53,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:45:53,681 INFO L87 Difference]: Start difference. First operand 18780 states and 76743 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:54,082 INFO L93 Difference]: Finished difference Result 18782 states and 76746 transitions. [2023-12-02 19:45:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:45:54,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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 18 [2023-12-02 19:45:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:54,163 INFO L225 Difference]: With dead ends: 18782 [2023-12-02 19:45:54,163 INFO L226 Difference]: Without dead ends: 18782 [2023-12-02 19:45:54,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2023-12-02 19:45:54,164 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:54,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 35 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:45:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18782 states. [2023-12-02 19:45:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18782 to 18771. [2023-12-02 19:45:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18771 states, 18546 states have (on average 4.137388116035803) internal successors, (76732), 18770 states have internal predecessors, (76732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18771 states to 18771 states and 76732 transitions. [2023-12-02 19:45:54,750 INFO L78 Accepts]: Start accepts. Automaton has 18771 states and 76732 transitions. Word has length 18 [2023-12-02 19:45:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:54,751 INFO L495 AbstractCegarLoop]: Abstraction has 18771 states and 76732 transitions. [2023-12-02 19:45:54,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18771 states and 76732 transitions. [2023-12-02 19:45:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 19:45:54,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:54,751 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:54,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 19:45:54,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 19:45:54,952 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:54,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1483299693, now seen corresponding path program 2 times [2023-12-02 19:45:54,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:54,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747645645] [2023-12-02 19:45:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:54,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:55,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:55,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747645645] [2023-12-02 19:45:55,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747645645] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:55,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88101010] [2023-12-02 19:45:55,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:45:55,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:55,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:45:55,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:45:55,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:45:55,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 19:45:55,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:45:55,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 19:45:55,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:55,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:45:55,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:45:55,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:45:55,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:45:55,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:45:55,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 19:45:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:55,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:45:55,921 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_238) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2023-12-02 19:45:55,936 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2023-12-02 19:45:55,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:45:55,964 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 29 treesize of output 30 [2023-12-02 19:45:55,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:45:55,976 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 159 treesize of output 147 [2023-12-02 19:45:55,986 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 29 treesize of output 25 [2023-12-02 19:45:55,992 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 28 treesize of output 20 [2023-12-02 19:45:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 19:45:56,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88101010] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:45:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [949719799] [2023-12-02 19:45:56,168 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:45:56,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:45:56,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2023-12-02 19:45:56,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658933475] [2023-12-02 19:45:56,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:45:56,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 19:45:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:56,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 19:45:56,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=531, Unknown=2, NotChecked=94, Total=702 [2023-12-02 19:45:56,172 INFO L87 Difference]: Start difference. First operand 18771 states and 76732 transitions. Second operand has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:57,692 INFO L93 Difference]: Finished difference Result 27959 states and 116141 transitions. [2023-12-02 19:45:57,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:45:57,693 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 19:45:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:57,810 INFO L225 Difference]: With dead ends: 27959 [2023-12-02 19:45:57,810 INFO L226 Difference]: Without dead ends: 27959 [2023-12-02 19:45:57,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=1062, Unknown=2, NotChecked=138, Total=1406 [2023-12-02 19:45:57,811 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 360 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:57,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 147 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1246 Invalid, 0 Unknown, 407 Unchecked, 0.9s Time] [2023-12-02 19:45:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27959 states. [2023-12-02 19:45:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27959 to 19837. [2023-12-02 19:45:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19837 states, 19612 states have (on average 4.2970630226392) internal successors, (84274), 19836 states have internal predecessors, (84274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19837 states to 19837 states and 84274 transitions. [2023-12-02 19:45:58,461 INFO L78 Accepts]: Start accepts. Automaton has 19837 states and 84274 transitions. Word has length 19 [2023-12-02 19:45:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:58,461 INFO L495 AbstractCegarLoop]: Abstraction has 19837 states and 84274 transitions. [2023-12-02 19:45:58,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:45:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 19837 states and 84274 transitions. [2023-12-02 19:45:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 19:45:58,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:58,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:58,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:45:58,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 19:45:58,663 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:45:58,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1483299694, now seen corresponding path program 1 times [2023-12-02 19:45:58,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:45:58,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155378476] [2023-12-02 19:45:58,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:45:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:59,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:45:59,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155378476] [2023-12-02 19:45:59,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155378476] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:45:59,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235567529] [2023-12-02 19:45:59,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:59,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:45:59,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:45:59,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:45:59,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 19:45:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:45:59,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 19:45:59,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:45:59,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-02 19:45:59,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:45:59,361 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:45:59,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:45:59,443 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 19 treesize of output 1 [2023-12-02 19:45:59,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:45:59,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:45:59,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:45:59,593 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 19 treesize of output 7 [2023-12-02 19:45:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:59,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:45:59,670 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_272) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2023-12-02 19:45:59,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:45:59,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-12-02 19:45:59,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:45:59,747 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 71 treesize of output 65 [2023-12-02 19:45:59,752 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 28 treesize of output 24 [2023-12-02 19:45:59,756 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 50 treesize of output 42 [2023-12-02 19:45:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:45:59,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235567529] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:45:59,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [632319035] [2023-12-02 19:45:59,946 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:45:59,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:45:59,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-12-02 19:45:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743037042] [2023-12-02 19:45:59,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:45:59,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 19:45:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:45:59,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 19:45:59,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=4, NotChecked=50, Total=756 [2023-12-02 19:45:59,948 INFO L87 Difference]: Start difference. First operand 19837 states and 84274 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:01,309 INFO L93 Difference]: Finished difference Result 27959 states and 115075 transitions. [2023-12-02 19:46:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:46:01,310 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 19:46:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:01,430 INFO L225 Difference]: With dead ends: 27959 [2023-12-02 19:46:01,430 INFO L226 Difference]: Without dead ends: 27959 [2023-12-02 19:46:01,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=4, NotChecked=78, Total=1722 [2023-12-02 19:46:01,431 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 735 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:01,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 108 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 907 Invalid, 0 Unknown, 226 Unchecked, 0.6s Time] [2023-12-02 19:46:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27959 states. [2023-12-02 19:46:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27959 to 19837. [2023-12-02 19:46:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19837 states, 19612 states have (on average 4.242708545788293) internal successors, (83208), 19836 states have internal predecessors, (83208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19837 states to 19837 states and 83208 transitions. [2023-12-02 19:46:02,139 INFO L78 Accepts]: Start accepts. Automaton has 19837 states and 83208 transitions. Word has length 19 [2023-12-02 19:46:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:02,139 INFO L495 AbstractCegarLoop]: Abstraction has 19837 states and 83208 transitions. [2023-12-02 19:46:02,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 19837 states and 83208 transitions. [2023-12-02 19:46:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 19:46:02,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:02,141 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:02,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 19:46:02,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:02,342 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread4Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:02,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:02,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1483299696, now seen corresponding path program 1 times [2023-12-02 19:46:02,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:02,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005479883] [2023-12-02 19:46:02,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:46:02,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005479883] [2023-12-02 19:46:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005479883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:46:02,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:46:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:46:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482757498] [2023-12-02 19:46:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:46:02,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:46:02,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:46:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:46:02,566 INFO L87 Difference]: Start difference. First operand 19837 states and 83208 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:02,864 INFO L93 Difference]: Finished difference Result 25789 states and 104311 transitions. [2023-12-02 19:46:02,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:46:02,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 19:46:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:02,962 INFO L225 Difference]: With dead ends: 25789 [2023-12-02 19:46:02,962 INFO L226 Difference]: Without dead ends: 25789 [2023-12-02 19:46:02,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:46:02,962 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:02,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 20 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:46:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25789 states. [2023-12-02 19:46:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25789 to 20897. [2023-12-02 19:46:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20897 states, 20672 states have (on average 4.233988003095975) internal successors, (87525), 20896 states have internal predecessors, (87525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 87525 transitions. [2023-12-02 19:46:03,659 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 87525 transitions. Word has length 19 [2023-12-02 19:46:03,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:03,660 INFO L495 AbstractCegarLoop]: Abstraction has 20897 states and 87525 transitions. [2023-12-02 19:46:03,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 87525 transitions. [2023-12-02 19:46:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:46:03,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:03,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:03,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 19:46:03,661 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:03,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2017788247, now seen corresponding path program 2 times [2023-12-02 19:46:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833713382] [2023-12-02 19:46:03,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:04,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833713382] [2023-12-02 19:46:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833713382] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383852089] [2023-12-02 19:46:04,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:46:04,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:04,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:04,119 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:04,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 19:46:04,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 19:46:04,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:46:04,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 19:46:04,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:04,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:46:04,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:04,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:46:04,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:04,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:46:04,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 19:46:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:04,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:04,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_326) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2023-12-02 19:46:05,199 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_16| Int)) (or (< |v_thread1Thread1of1ForFork2_~#t2~0.base_16| (+ |c_#StackHeapBarrier| 1)) (forall ((v_ArrVal_326 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_16| v_ArrVal_326) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) is different from false [2023-12-02 19:46:05,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:05,317 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 29 treesize of output 30 [2023-12-02 19:46:05,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:05,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 81 treesize of output 75 [2023-12-02 19:46:05,331 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 62 treesize of output 54 [2023-12-02 19:46:05,337 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 28 treesize of output 24 [2023-12-02 19:46:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383852089] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:05,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926032534] [2023-12-02 19:46:05,498 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:05,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:05,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-12-02 19:46:05,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648459282] [2023-12-02 19:46:05,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 19:46:05,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 19:46:05,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=667, Unknown=14, NotChecked=106, Total=870 [2023-12-02 19:46:05,501 INFO L87 Difference]: Start difference. First operand 20897 states and 87525 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:07,013 INFO L93 Difference]: Finished difference Result 32191 states and 135521 transitions. [2023-12-02 19:46:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 19:46:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 19:46:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:07,135 INFO L225 Difference]: With dead ends: 32191 [2023-12-02 19:46:07,136 INFO L226 Difference]: Without dead ends: 32191 [2023-12-02 19:46:07,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=225, Invalid=1329, Unknown=14, NotChecked=154, Total=1722 [2023-12-02 19:46:07,137 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 622 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:07,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 135 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1152 Invalid, 0 Unknown, 393 Unchecked, 0.8s Time] [2023-12-02 19:46:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32191 states. [2023-12-02 19:46:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32191 to 22719. [2023-12-02 19:46:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22719 states, 22494 states have (on average 4.38410242731395) internal successors, (98616), 22718 states have internal predecessors, (98616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22719 states to 22719 states and 98616 transitions. [2023-12-02 19:46:07,924 INFO L78 Accepts]: Start accepts. Automaton has 22719 states and 98616 transitions. Word has length 20 [2023-12-02 19:46:07,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:07,925 INFO L495 AbstractCegarLoop]: Abstraction has 22719 states and 98616 transitions. [2023-12-02 19:46:07,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 22719 states and 98616 transitions. [2023-12-02 19:46:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:46:07,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:07,926 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:07,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 19:46:08,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:08,127 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:08,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:08,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2017788246, now seen corresponding path program 1 times [2023-12-02 19:46:08,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:08,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517332139] [2023-12-02 19:46:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:08,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:08,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517332139] [2023-12-02 19:46:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517332139] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579785200] [2023-12-02 19:46:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:08,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:08,606 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:08,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 19:46:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:08,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:46:08,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:08,736 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:46:08,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:46:08,784 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:46:08,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:46:08,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:46:09,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:09,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:46:09,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:46:09,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:09,075 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 15 treesize of output 7 [2023-12-02 19:46:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:09,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:09,157 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_369) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2023-12-02 19:46:09,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:09,245 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 27 treesize of output 28 [2023-12-02 19:46:09,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:09,252 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 71 treesize of output 65 [2023-12-02 19:46:09,258 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 54 treesize of output 46 [2023-12-02 19:46:09,264 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 24 treesize of output 20 [2023-12-02 19:46:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:09,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579785200] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:09,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1112347086] [2023-12-02 19:46:09,492 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:09,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:09,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-12-02 19:46:09,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857202450] [2023-12-02 19:46:09,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:09,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 19:46:09,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:09,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 19:46:09,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=569, Unknown=12, NotChecked=48, Total=702 [2023-12-02 19:46:09,495 INFO L87 Difference]: Start difference. First operand 22719 states and 98616 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:10,709 INFO L93 Difference]: Finished difference Result 32190 states and 133695 transitions. [2023-12-02 19:46:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 19:46:10,709 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 19:46:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:10,823 INFO L225 Difference]: With dead ends: 32190 [2023-12-02 19:46:10,823 INFO L226 Difference]: Without dead ends: 32166 [2023-12-02 19:46:10,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=1175, Unknown=14, NotChecked=72, Total=1482 [2023-12-02 19:46:10,824 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 341 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:10,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 118 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 999 Invalid, 0 Unknown, 195 Unchecked, 0.6s Time] [2023-12-02 19:46:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32166 states. [2023-12-02 19:46:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32166 to 22694. [2023-12-02 19:46:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22694 states, 22469 states have (on average 4.304152387734211) internal successors, (96710), 22693 states have internal predecessors, (96710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22694 states to 22694 states and 96710 transitions. [2023-12-02 19:46:11,627 INFO L78 Accepts]: Start accepts. Automaton has 22694 states and 96710 transitions. Word has length 20 [2023-12-02 19:46:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:11,627 INFO L495 AbstractCegarLoop]: Abstraction has 22694 states and 96710 transitions. [2023-12-02 19:46:11,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 22694 states and 96710 transitions. [2023-12-02 19:46:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:46:11,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:11,628 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:11,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 19:46:11,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:11,832 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:11,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash 307563730, now seen corresponding path program 1 times [2023-12-02 19:46:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085645183] [2023-12-02 19:46:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:12,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085645183] [2023-12-02 19:46:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085645183] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331216326] [2023-12-02 19:46:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:12,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:12,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:12,508 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:12,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 19:46:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:12,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:46:12,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:12,662 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:46:12,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:46:12,712 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:46:12,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:46:12,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:46:13,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:13,069 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:46:13,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:46:13,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:13,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:13,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:13,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 17 treesize of output 9 [2023-12-02 19:46:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:13,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:13,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:13,584 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 32 treesize of output 33 [2023-12-02 19:46:13,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:13,594 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 619 treesize of output 595 [2023-12-02 19:46:13,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2023-12-02 19:46:13,616 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 59 treesize of output 55 [2023-12-02 19:46:13,626 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 70 treesize of output 54 [2023-12-02 19:46:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331216326] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1238313336] [2023-12-02 19:46:14,024 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:14,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:14,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-12-02 19:46:14,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595876986] [2023-12-02 19:46:14,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:14,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 19:46:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:14,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 19:46:14,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=934, Unknown=23, NotChecked=0, Total=1056 [2023-12-02 19:46:14,027 INFO L87 Difference]: Start difference. First operand 22694 states and 96710 transitions. Second operand has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:16,288 INFO L93 Difference]: Finished difference Result 34114 states and 145208 transitions. [2023-12-02 19:46:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:46:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 19:46:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:16,448 INFO L225 Difference]: With dead ends: 34114 [2023-12-02 19:46:16,448 INFO L226 Difference]: Without dead ends: 34114 [2023-12-02 19:46:16,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=313, Invalid=1920, Unknown=23, NotChecked=0, Total=2256 [2023-12-02 19:46:16,449 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 927 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:16,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 238 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 19:46:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34114 states. [2023-12-02 19:46:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34114 to 24488. [2023-12-02 19:46:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24488 states, 24263 states have (on average 4.4428141614804435) internal successors, (107796), 24487 states have internal predecessors, (107796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24488 states to 24488 states and 107796 transitions. [2023-12-02 19:46:17,258 INFO L78 Accepts]: Start accepts. Automaton has 24488 states and 107796 transitions. Word has length 21 [2023-12-02 19:46:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:17,258 INFO L495 AbstractCegarLoop]: Abstraction has 24488 states and 107796 transitions. [2023-12-02 19:46:17,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 24488 states and 107796 transitions. [2023-12-02 19:46:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:46:17,260 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:17,260 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:17,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 19:46:17,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:17,460 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:17,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:17,461 INFO L85 PathProgramCache]: Analyzing trace with hash 307563731, now seen corresponding path program 1 times [2023-12-02 19:46:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:17,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360273526] [2023-12-02 19:46:17,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:17,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:18,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360273526] [2023-12-02 19:46:18,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360273526] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652827554] [2023-12-02 19:46:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:18,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:18,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:18,034 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:18,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 19:46:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:18,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:46:18,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:18,182 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:46:18,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:46:18,228 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:46:18,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:46:18,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:46:18,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:18,503 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:46:18,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:46:18,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:18,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:18,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:18,620 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 15 treesize of output 7 [2023-12-02 19:46:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:18,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:18,753 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_463) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2023-12-02 19:46:18,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:18,873 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 30 treesize of output 31 [2023-12-02 19:46:18,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:18,883 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 277 treesize of output 265 [2023-12-02 19:46:18,892 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 122 treesize of output 106 [2023-12-02 19:46:18,899 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 51 treesize of output 47 [2023-12-02 19:46:19,028 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 54 treesize of output 46 [2023-12-02 19:46:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652827554] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:19,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [70100005] [2023-12-02 19:46:19,367 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:19,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:19,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-12-02 19:46:19,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554037935] [2023-12-02 19:46:19,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:19,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 19:46:19,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:19,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 19:46:19,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=878, Unknown=13, NotChecked=60, Total=1056 [2023-12-02 19:46:19,370 INFO L87 Difference]: Start difference. First operand 24488 states and 107796 transitions. Second operand has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:21,094 INFO L93 Difference]: Finished difference Result 34075 states and 143233 transitions. [2023-12-02 19:46:21,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:46:21,095 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 19:46:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:21,237 INFO L225 Difference]: With dead ends: 34075 [2023-12-02 19:46:21,237 INFO L226 Difference]: Without dead ends: 34051 [2023-12-02 19:46:21,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=1837, Unknown=14, NotChecked=90, Total=2256 [2023-12-02 19:46:21,238 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 818 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:21,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 207 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1578 Invalid, 0 Unknown, 296 Unchecked, 1.1s Time] [2023-12-02 19:46:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34051 states. [2023-12-02 19:46:21,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34051 to 22673. [2023-12-02 19:46:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22673 states, 22448 states have (on average 4.310495367070563) internal successors, (96762), 22672 states have internal predecessors, (96762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22673 states to 22673 states and 96762 transitions. [2023-12-02 19:46:22,052 INFO L78 Accepts]: Start accepts. Automaton has 22673 states and 96762 transitions. Word has length 21 [2023-12-02 19:46:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:22,052 INFO L495 AbstractCegarLoop]: Abstraction has 22673 states and 96762 transitions. [2023-12-02 19:46:22,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 22673 states and 96762 transitions. [2023-12-02 19:46:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:46:22,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:22,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:22,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 19:46:22,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:22,254 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:22,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1873060376, now seen corresponding path program 1 times [2023-12-02 19:46:22,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051000633] [2023-12-02 19:46:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:22,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051000633] [2023-12-02 19:46:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051000633] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129496972] [2023-12-02 19:46:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:22,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:22,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:22,894 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:22,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 19:46:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:23,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 19:46:23,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:23,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:46:23,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:23,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:46:23,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:23,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:46:23,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:23,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:46:23,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 19:46:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:23,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:23,432 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_507) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_508) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2023-12-02 19:46:24,218 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_24| Int) (|v_thread1Thread1of1ForFork2_~#t3~0.base_24| Int)) (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (or (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_24| v_ArrVal_507) |v_thread1Thread1of1ForFork2_~#t3~0.base_24| v_ArrVal_508) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (< |v_thread1Thread1of1ForFork2_~#t2~0.base_24| .cse0) (< |v_thread1Thread1of1ForFork2_~#t3~0.base_24| .cse0)))) is different from false [2023-12-02 19:46:24,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:24,356 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 32 treesize of output 33 [2023-12-02 19:46:24,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:24,368 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 311 treesize of output 299 [2023-12-02 19:46:24,380 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 138 treesize of output 130 [2023-12-02 19:46:24,388 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 130 treesize of output 114 [2023-12-02 19:46:24,397 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 58 treesize of output 54 [2023-12-02 19:46:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129496972] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:24,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1562018492] [2023-12-02 19:46:24,637 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:24,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:24,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-12-02 19:46:24,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498172291] [2023-12-02 19:46:24,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:24,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 19:46:24,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:24,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 19:46:24,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=812, Unknown=18, NotChecked=118, Total=1056 [2023-12-02 19:46:24,640 INFO L87 Difference]: Start difference. First operand 22673 states and 96762 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:26,144 INFO L93 Difference]: Finished difference Result 35725 states and 153653 transitions. [2023-12-02 19:46:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:46:26,144 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 19:46:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:26,423 INFO L225 Difference]: With dead ends: 35725 [2023-12-02 19:46:26,423 INFO L226 Difference]: Without dead ends: 35725 [2023-12-02 19:46:26,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=281, Invalid=1689, Unknown=18, NotChecked=174, Total=2162 [2023-12-02 19:46:26,424 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 884 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:26,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 162 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1319 Invalid, 0 Unknown, 541 Unchecked, 0.8s Time] [2023-12-02 19:46:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35725 states. [2023-12-02 19:46:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35725 to 24433. [2023-12-02 19:46:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24433 states, 24208 states have (on average 4.443365829477859) internal successors, (107565), 24432 states have internal predecessors, (107565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24433 states to 24433 states and 107565 transitions. [2023-12-02 19:46:27,068 INFO L78 Accepts]: Start accepts. Automaton has 24433 states and 107565 transitions. Word has length 21 [2023-12-02 19:46:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:27,068 INFO L495 AbstractCegarLoop]: Abstraction has 24433 states and 107565 transitions. [2023-12-02 19:46:27,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24433 states and 107565 transitions. [2023-12-02 19:46:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:46:27,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:27,069 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:27,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 19:46:27,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 19:46:27,270 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:27,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1873060377, now seen corresponding path program 1 times [2023-12-02 19:46:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:27,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835043212] [2023-12-02 19:46:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:27,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835043212] [2023-12-02 19:46:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835043212] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379172352] [2023-12-02 19:46:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:27,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:27,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:27,843 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:27,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 19:46:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:28,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 19:46:28,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:28,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:46:28,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:28,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:28,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:28,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:28,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:28,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:28,310 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 19 treesize of output 7 [2023-12-02 19:46:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:28,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:28,361 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_552) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:46:29,231 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_26| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int)) (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (or (< |v_thread1Thread1of1ForFork2_~#t2~0.base_26| .cse0) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_551) |v_thread1Thread1of1ForFork2_~#t3~0.base_26| v_ArrVal_552) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) (< |v_thread1Thread1of1ForFork2_~#t3~0.base_26| .cse0)))) is different from false [2023-12-02 19:46:29,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:29,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-12-02 19:46:29,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:29,377 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 277 treesize of output 265 [2023-12-02 19:46:29,385 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 122 treesize of output 106 [2023-12-02 19:46:29,393 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 51 treesize of output 47 [2023-12-02 19:46:29,401 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 54 treesize of output 46 [2023-12-02 19:46:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:29,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379172352] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:29,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1766388223] [2023-12-02 19:46:29,612 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:29,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-12-02 19:46:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445138988] [2023-12-02 19:46:29,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:29,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 19:46:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 19:46:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=820, Unknown=13, NotChecked=118, Total=1056 [2023-12-02 19:46:29,614 INFO L87 Difference]: Start difference. First operand 24433 states and 107565 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:31,011 INFO L93 Difference]: Finished difference Result 35716 states and 151841 transitions. [2023-12-02 19:46:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:46:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 19:46:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:31,262 INFO L225 Difference]: With dead ends: 35716 [2023-12-02 19:46:31,262 INFO L226 Difference]: Without dead ends: 35692 [2023-12-02 19:46:31,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=281, Invalid=1694, Unknown=13, NotChecked=174, Total=2162 [2023-12-02 19:46:31,263 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 762 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:31,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 155 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1250 Invalid, 0 Unknown, 533 Unchecked, 0.7s Time] [2023-12-02 19:46:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35692 states. [2023-12-02 19:46:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35692 to 22638. [2023-12-02 19:46:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22638 states, 22413 states have (on average 4.31075714986838) internal successors, (96617), 22637 states have internal predecessors, (96617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22638 states to 22638 states and 96617 transitions. [2023-12-02 19:46:31,878 INFO L78 Accepts]: Start accepts. Automaton has 22638 states and 96617 transitions. Word has length 21 [2023-12-02 19:46:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:31,878 INFO L495 AbstractCegarLoop]: Abstraction has 22638 states and 96617 transitions. [2023-12-02 19:46:31,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 22638 states and 96617 transitions. [2023-12-02 19:46:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:46:31,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:31,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:31,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 19:46:32,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 19:46:32,080 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:32,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash -854745035, now seen corresponding path program 1 times [2023-12-02 19:46:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440145159] [2023-12-02 19:46:32,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:32,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:32,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440145159] [2023-12-02 19:46:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440145159] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:32,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101260127] [2023-12-02 19:46:32,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:32,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:32,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:32,668 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:32,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 19:46:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:32,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:46:32,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:32,804 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:46:32,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:46:32,850 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:46:32,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:46:33,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:46:33,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:33,143 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:46:33,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:46:33,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:33,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:33,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:33,244 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 17 treesize of output 9 [2023-12-02 19:46:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:33,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:33,316 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_599 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_599) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2023-12-02 19:46:33,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:33,490 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 32 treesize of output 33 [2023-12-02 19:46:33,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:33,505 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 157 treesize of output 151 [2023-12-02 19:46:33,517 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 70 treesize of output 66 [2023-12-02 19:46:33,525 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 134 treesize of output 118 [2023-12-02 19:46:33,532 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 118 treesize of output 110 [2023-12-02 19:46:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:33,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101260127] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:33,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [968383567] [2023-12-02 19:46:33,962 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:33,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:33,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2023-12-02 19:46:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565567906] [2023-12-02 19:46:33,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:33,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 19:46:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 19:46:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=828, Unknown=11, NotChecked=58, Total=992 [2023-12-02 19:46:33,964 INFO L87 Difference]: Start difference. First operand 22638 states and 96617 transitions. Second operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:36,171 INFO L93 Difference]: Finished difference Result 31514 states and 134329 transitions. [2023-12-02 19:46:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:46:36,171 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 19:46:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:36,356 INFO L225 Difference]: With dead ends: 31514 [2023-12-02 19:46:36,356 INFO L226 Difference]: Without dead ends: 31514 [2023-12-02 19:46:36,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=387, Invalid=1956, Unknown=13, NotChecked=94, Total=2450 [2023-12-02 19:46:36,358 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1042 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:36,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 190 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1531 Invalid, 0 Unknown, 309 Unchecked, 1.1s Time] [2023-12-02 19:46:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31514 states. [2023-12-02 19:46:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31514 to 23750. [2023-12-02 19:46:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23750 states, 23525 states have (on average 4.350435706695006) internal successors, (102344), 23749 states have internal predecessors, (102344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23750 states to 23750 states and 102344 transitions. [2023-12-02 19:46:37,174 INFO L78 Accepts]: Start accepts. Automaton has 23750 states and 102344 transitions. Word has length 22 [2023-12-02 19:46:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:37,174 INFO L495 AbstractCegarLoop]: Abstraction has 23750 states and 102344 transitions. [2023-12-02 19:46:37,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 23750 states and 102344 transitions. [2023-12-02 19:46:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:46:37,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:37,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:37,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 19:46:37,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 19:46:37,376 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:37,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash -854745034, now seen corresponding path program 1 times [2023-12-02 19:46:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:37,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238559470] [2023-12-02 19:46:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:37,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:37,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:37,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238559470] [2023-12-02 19:46:37,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238559470] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:37,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105929319] [2023-12-02 19:46:37,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:37,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:37,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:37,944 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:37,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 19:46:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:38,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:46:38,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:38,078 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:46:38,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:46:38,126 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:46:38,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:46:38,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:46:38,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:38,379 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:46:38,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:46:38,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:38,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:38,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:38,464 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 15 treesize of output 7 [2023-12-02 19:46:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:38,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:38,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:38,721 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 30 treesize of output 31 [2023-12-02 19:46:38,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:38,729 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 277 treesize of output 265 [2023-12-02 19:46:38,735 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 122 treesize of output 106 [2023-12-02 19:46:38,741 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 51 treesize of output 47 [2023-12-02 19:46:38,747 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 54 treesize of output 46 [2023-12-02 19:46:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105929319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [134123087] [2023-12-02 19:46:39,087 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:39,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:39,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2023-12-02 19:46:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79838064] [2023-12-02 19:46:39,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:39,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 19:46:39,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:39,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 19:46:39,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=863, Unknown=18, NotChecked=0, Total=992 [2023-12-02 19:46:39,089 INFO L87 Difference]: Start difference. First operand 23750 states and 102344 transitions. Second operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:40,863 INFO L93 Difference]: Finished difference Result 31514 states and 133179 transitions. [2023-12-02 19:46:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:46:40,863 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 19:46:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:40,994 INFO L225 Difference]: With dead ends: 31514 [2023-12-02 19:46:40,994 INFO L226 Difference]: Without dead ends: 31514 [2023-12-02 19:46:40,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=411, Invalid=2021, Unknown=18, NotChecked=0, Total=2450 [2023-12-02 19:46:40,996 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 798 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:40,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 185 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 19:46:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31514 states. [2023-12-02 19:46:41,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31514 to 22600. [2023-12-02 19:46:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22600 states, 22375 states have (on average 4.308737430167597) internal successors, (96408), 22599 states have internal predecessors, (96408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22600 states to 22600 states and 96408 transitions. [2023-12-02 19:46:41,662 INFO L78 Accepts]: Start accepts. Automaton has 22600 states and 96408 transitions. Word has length 22 [2023-12-02 19:46:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:41,662 INFO L495 AbstractCegarLoop]: Abstraction has 22600 states and 96408 transitions. [2023-12-02 19:46:41,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 22600 states and 96408 transitions. [2023-12-02 19:46:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:46:41,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:41,663 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:41,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 19:46:41,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 19:46:41,864 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:41,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash 944527631, now seen corresponding path program 1 times [2023-12-02 19:46:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753593859] [2023-12-02 19:46:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:42,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:42,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753593859] [2023-12-02 19:46:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753593859] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:42,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390347282] [2023-12-02 19:46:42,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:42,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:42,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:42,612 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:42,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 19:46:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:42,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:46:42,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:42,737 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:46:42,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:46:42,783 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:46:42,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:46:42,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:46:43,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:43,091 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:46:43,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:46:43,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:43,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:43,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:43,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:43,285 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 17 treesize of output 9 [2023-12-02 19:46:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:43,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:43,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:43,788 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 35 treesize of output 36 [2023-12-02 19:46:43,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:43,801 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 2451 treesize of output 2403 [2023-12-02 19:46:43,820 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 143 treesize of output 127 [2023-12-02 19:46:43,830 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 127 treesize of output 119 [2023-12-02 19:46:43,842 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 119 treesize of output 115 [2023-12-02 19:46:43,855 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 146 treesize of output 114 [2023-12-02 19:46:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390347282] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1311873171] [2023-12-02 19:46:44,497 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:44,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:44,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-12-02 19:46:44,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62738307] [2023-12-02 19:46:44,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:44,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 19:46:44,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:44,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 19:46:44,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1050, Unknown=25, NotChecked=0, Total=1190 [2023-12-02 19:46:44,499 INFO L87 Difference]: Start difference. First operand 22600 states and 96408 transitions. Second operand has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:46,893 INFO L93 Difference]: Finished difference Result 35371 states and 148048 transitions. [2023-12-02 19:46:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 19:46:46,894 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 19:46:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:47,037 INFO L225 Difference]: With dead ends: 35371 [2023-12-02 19:46:47,037 INFO L226 Difference]: Without dead ends: 35371 [2023-12-02 19:46:47,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=302, Invalid=2025, Unknown=25, NotChecked=0, Total=2352 [2023-12-02 19:46:47,039 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1507 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:47,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 215 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 19:46:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35371 states. [2023-12-02 19:46:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35371 to 23419. [2023-12-02 19:46:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23419 states, 23194 states have (on average 4.413598344399413) internal successors, (102369), 23418 states have internal predecessors, (102369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23419 states to 23419 states and 102369 transitions. [2023-12-02 19:46:47,900 INFO L78 Accepts]: Start accepts. Automaton has 23419 states and 102369 transitions. Word has length 22 [2023-12-02 19:46:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:47,900 INFO L495 AbstractCegarLoop]: Abstraction has 23419 states and 102369 transitions. [2023-12-02 19:46:47,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 23419 states and 102369 transitions. [2023-12-02 19:46:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:46:47,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:47,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:47,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 19:46:48,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:48,103 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:48,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:48,103 INFO L85 PathProgramCache]: Analyzing trace with hash 944527632, now seen corresponding path program 1 times [2023-12-02 19:46:48,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:48,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430255543] [2023-12-02 19:46:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:48,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430255543] [2023-12-02 19:46:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430255543] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947984600] [2023-12-02 19:46:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:48,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:48,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:48,690 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:48,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 19:46:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:48,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:46:48,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:48,841 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:46:48,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:46:48,894 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:46:48,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:46:49,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:46:49,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:49,214 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:46:49,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:46:49,312 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 16 treesize of output 11 [2023-12-02 19:46:49,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:49,359 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 16 treesize of output 11 [2023-12-02 19:46:49,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:46:49,394 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 15 treesize of output 7 [2023-12-02 19:46:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:49,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:49,441 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_754) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:46:49,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:49,791 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 33 treesize of output 34 [2023-12-02 19:46:49,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:49,802 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 1097 treesize of output 1073 [2023-12-02 19:46:49,817 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 127 treesize of output 111 [2023-12-02 19:46:49,826 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 111 treesize of output 107 [2023-12-02 19:46:49,835 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 107 treesize of output 99 [2023-12-02 19:46:49,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 98 [2023-12-02 19:46:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:50,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947984600] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:50,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [424651714] [2023-12-02 19:46:50,707 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:50,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:50,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-12-02 19:46:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297371397] [2023-12-02 19:46:50,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:50,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 19:46:50,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:50,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 19:46:50,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=992, Unknown=20, NotChecked=64, Total=1190 [2023-12-02 19:46:50,709 INFO L87 Difference]: Start difference. First operand 23419 states and 102369 transitions. Second operand has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:52,757 INFO L93 Difference]: Finished difference Result 35020 states and 144976 transitions. [2023-12-02 19:46:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 19:46:52,757 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 19:46:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:52,987 INFO L225 Difference]: With dead ends: 35020 [2023-12-02 19:46:52,988 INFO L226 Difference]: Without dead ends: 34996 [2023-12-02 19:46:52,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=303, Invalid=1937, Unknown=20, NotChecked=92, Total=2352 [2023-12-02 19:46:52,989 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1397 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:52,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 209 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1558 Invalid, 0 Unknown, 252 Unchecked, 1.2s Time] [2023-12-02 19:46:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34996 states. [2023-12-02 19:46:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34996 to 21235. [2023-12-02 19:46:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21235 states, 21010 states have (on average 4.2790099952403615) internal successors, (89902), 21234 states have internal predecessors, (89902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21235 states to 21235 states and 89902 transitions. [2023-12-02 19:46:53,572 INFO L78 Accepts]: Start accepts. Automaton has 21235 states and 89902 transitions. Word has length 22 [2023-12-02 19:46:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:53,572 INFO L495 AbstractCegarLoop]: Abstraction has 21235 states and 89902 transitions. [2023-12-02 19:46:53,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21235 states and 89902 transitions. [2023-12-02 19:46:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:46:53,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:53,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:53,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 19:46:53,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:53,774 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:53,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2100510292, now seen corresponding path program 1 times [2023-12-02 19:46:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580549397] [2023-12-02 19:46:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:54,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580549397] [2023-12-02 19:46:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580549397] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419439098] [2023-12-02 19:46:54,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:54,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:54,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:54,281 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:54,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 19:46:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:54,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 19:46:54,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:54,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:46:54,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:54,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:46:54,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:54,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:46:54,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:54,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:46:54,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 19:46:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:54,679 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:54,732 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_799) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:46:54,788 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_798) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_799) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2023-12-02 19:46:55,556 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_36| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_36| Int)) (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (or (< |v_thread1Thread1of1ForFork2_~#t3~0.base_36| .cse0) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_36| v_ArrVal_798) |v_thread1Thread1of1ForFork2_~#t3~0.base_36| v_ArrVal_799) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (< |v_thread1Thread1of1ForFork2_~#t2~0.base_36| .cse0)))) is different from false [2023-12-02 19:46:55,582 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_36| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_36| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (or (< |v_thread1Thread1of1ForFork2_~#t3~0.base_36| .cse0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_797) |v_thread1Thread1of1ForFork2_~#t2~0.base_36| v_ArrVal_798) |v_thread1Thread1of1ForFork2_~#t3~0.base_36| v_ArrVal_799) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< |v_thread1Thread1of1ForFork2_~#t2~0.base_36| .cse0)))) is different from false [2023-12-02 19:46:55,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:55,615 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 32 treesize of output 33 [2023-12-02 19:46:55,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:46:55,625 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 157 treesize of output 151 [2023-12-02 19:46:55,634 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 138 treesize of output 122 [2023-12-02 19:46:55,641 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 122 treesize of output 114 [2023-12-02 19:46:55,650 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 58 treesize of output 54 [2023-12-02 19:46:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 19:46:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419439098] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845288700] [2023-12-02 19:46:55,882 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:46:55,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:46:55,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-12-02 19:46:55,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152491695] [2023-12-02 19:46:55,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:55,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 19:46:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:46:55,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 19:46:55,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=718, Unknown=11, NotChecked=228, Total=1056 [2023-12-02 19:46:55,884 INFO L87 Difference]: Start difference. First operand 21235 states and 89902 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:46:57,373 INFO L93 Difference]: Finished difference Result 31733 states and 134958 transitions. [2023-12-02 19:46:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:46:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 19:46:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:46:57,630 INFO L225 Difference]: With dead ends: 31733 [2023-12-02 19:46:57,630 INFO L226 Difference]: Without dead ends: 31733 [2023-12-02 19:46:57,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=269, Invalid=1541, Unknown=12, NotChecked=340, Total=2162 [2023-12-02 19:46:57,631 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 597 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1070 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:46:57,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 161 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1277 Invalid, 0 Unknown, 1070 Unchecked, 0.8s Time] [2023-12-02 19:46:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31733 states. [2023-12-02 19:46:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31733 to 23101. [2023-12-02 19:46:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23101 states, 22876 states have (on average 4.43219968525966) internal successors, (101391), 23100 states have internal predecessors, (101391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23101 states to 23101 states and 101391 transitions. [2023-12-02 19:46:58,202 INFO L78 Accepts]: Start accepts. Automaton has 23101 states and 101391 transitions. Word has length 22 [2023-12-02 19:46:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:46:58,202 INFO L495 AbstractCegarLoop]: Abstraction has 23101 states and 101391 transitions. [2023-12-02 19:46:58,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 23101 states and 101391 transitions. [2023-12-02 19:46:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:46:58,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:46:58,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:58,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-02 19:46:58,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 19:46:58,404 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:46:58,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:46:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2100510293, now seen corresponding path program 1 times [2023-12-02 19:46:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:46:58,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874900736] [2023-12-02 19:46:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:46:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:58,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:46:58,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874900736] [2023-12-02 19:46:58,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874900736] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:46:58,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146350306] [2023-12-02 19:46:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:58,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:58,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:58,895 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:58,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 19:46:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:46:59,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 19:46:59,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:46:59,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:46:59,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:59,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:59,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:59,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:59,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:46:59,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:46:59,264 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 19 treesize of output 7 [2023-12-02 19:46:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:46:59,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:46:59,310 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_844 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_844) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:47:00,163 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_38| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_38| Int)) (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (or (< |v_thread1Thread1of1ForFork2_~#t2~0.base_38| .cse0) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_38| v_ArrVal_843) |v_thread1Thread1of1ForFork2_~#t3~0.base_38| v_ArrVal_844) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) (< |v_thread1Thread1of1ForFork2_~#t3~0.base_38| .cse0)))) is different from false [2023-12-02 19:47:00,181 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_38| Int) (v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_38| Int)) (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_842) |v_thread1Thread1of1ForFork2_~#t2~0.base_38| v_ArrVal_843) |v_thread1Thread1of1ForFork2_~#t3~0.base_38| v_ArrVal_844) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< |v_thread1Thread1of1ForFork2_~#t2~0.base_38| .cse0) (< |v_thread1Thread1of1ForFork2_~#t3~0.base_38| .cse0)))) is different from false [2023-12-02 19:47:00,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:00,207 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 30 treesize of output 31 [2023-12-02 19:47:00,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:00,215 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 277 treesize of output 265 [2023-12-02 19:47:00,223 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 122 treesize of output 106 [2023-12-02 19:47:00,230 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 51 treesize of output 47 [2023-12-02 19:47:00,237 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 54 treesize of output 46 [2023-12-02 19:47:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 19:47:00,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146350306] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:00,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [576722760] [2023-12-02 19:47:00,397 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:00,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:00,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-12-02 19:47:00,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303274990] [2023-12-02 19:47:00,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:00,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 19:47:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 19:47:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=769, Unknown=10, NotChecked=174, Total=1056 [2023-12-02 19:47:00,399 INFO L87 Difference]: Start difference. First operand 23101 states and 101391 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:01,912 INFO L93 Difference]: Finished difference Result 31723 states and 133025 transitions. [2023-12-02 19:47:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:47:01,913 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 19:47:01,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:02,033 INFO L225 Difference]: With dead ends: 31723 [2023-12-02 19:47:02,033 INFO L226 Difference]: Without dead ends: 31687 [2023-12-02 19:47:02,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=277, Invalid=1617, Unknown=10, NotChecked=258, Total=2162 [2023-12-02 19:47:02,034 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 859 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 795 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:02,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 191 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1551 Invalid, 0 Unknown, 795 Unchecked, 0.8s Time] [2023-12-02 19:47:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31687 states. [2023-12-02 19:47:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31687 to 23055. [2023-12-02 19:47:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23055 states, 22830 states have (on average 4.351204555409549) internal successors, (99338), 23054 states have internal predecessors, (99338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23055 states to 23055 states and 99338 transitions. [2023-12-02 19:47:02,747 INFO L78 Accepts]: Start accepts. Automaton has 23055 states and 99338 transitions. Word has length 22 [2023-12-02 19:47:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:02,747 INFO L495 AbstractCegarLoop]: Abstraction has 23055 states and 99338 transitions. [2023-12-02 19:47:02,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 23055 states and 99338 transitions. [2023-12-02 19:47:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:47:02,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:02,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:02,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 19:47:02,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 19:47:02,949 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:02,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1936087210, now seen corresponding path program 1 times [2023-12-02 19:47:02,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:02,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236326569] [2023-12-02 19:47:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:47:02,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236326569] [2023-12-02 19:47:02,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236326569] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091774568] [2023-12-02 19:47:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:02,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:02,989 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:02,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 19:47:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:03,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 19:47:03,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:03,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091774568] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806981095] [2023-12-02 19:47:03,325 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:03,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 18 [2023-12-02 19:47:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936415254] [2023-12-02 19:47:03,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:03,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 19:47:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:03,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 19:47:03,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-12-02 19:47:03,326 INFO L87 Difference]: Start difference. First operand 23055 states and 99338 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:04,881 INFO L93 Difference]: Finished difference Result 44183 states and 186053 transitions. [2023-12-02 19:47:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 19:47:04,882 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 19:47:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:05,054 INFO L225 Difference]: With dead ends: 44183 [2023-12-02 19:47:05,054 INFO L226 Difference]: Without dead ends: 43547 [2023-12-02 19:47:05,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2023-12-02 19:47:05,055 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 624 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:05,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 250 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 19:47:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43547 states. [2023-12-02 19:47:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43547 to 34093. [2023-12-02 19:47:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34093 states, 33871 states have (on average 4.371143456053852) internal successors, (148055), 34092 states have internal predecessors, (148055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34093 states to 34093 states and 148055 transitions. [2023-12-02 19:47:06,112 INFO L78 Accepts]: Start accepts. Automaton has 34093 states and 148055 transitions. Word has length 22 [2023-12-02 19:47:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:06,112 INFO L495 AbstractCegarLoop]: Abstraction has 34093 states and 148055 transitions. [2023-12-02 19:47:06,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 34093 states and 148055 transitions. [2023-12-02 19:47:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 19:47:06,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:06,116 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:06,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 19:47:06,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 19:47:06,317 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:06,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash -914201027, now seen corresponding path program 1 times [2023-12-02 19:47:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688838114] [2023-12-02 19:47:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:06,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:06,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688838114] [2023-12-02 19:47:06,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688838114] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:06,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862476737] [2023-12-02 19:47:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:06,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:06,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:06,811 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:06,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 19:47:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:07,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:47:07,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:07,194 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:47:07,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:47:07,235 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:47:07,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:47:07,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:07,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:07,549 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:47:07,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:47:07,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:07,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:07,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:07,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:07,707 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 17 treesize of output 9 [2023-12-02 19:47:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:07,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:07,763 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_926) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:47:07,772 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_925) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_926) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:47:07,779 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_924) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_925) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_926) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:47:08,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:08,016 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 35 treesize of output 36 [2023-12-02 19:47:08,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:08,044 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 39171 treesize of output 38403 [2023-12-02 19:47:08,091 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 143 treesize of output 139 [2023-12-02 19:47:08,099 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 139 treesize of output 131 [2023-12-02 19:47:08,110 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 131 treesize of output 115 [2023-12-02 19:47:08,122 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 146 treesize of output 114 [2023-12-02 19:47:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862476737] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1362047900] [2023-12-02 19:47:08,664 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:08,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:08,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-12-02 19:47:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491009883] [2023-12-02 19:47:08,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:08,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 19:47:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 19:47:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=894, Unknown=7, NotChecked=186, Total=1190 [2023-12-02 19:47:08,665 INFO L87 Difference]: Start difference. First operand 34093 states and 148055 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:10,927 INFO L93 Difference]: Finished difference Result 50917 states and 216263 transitions. [2023-12-02 19:47:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 19:47:10,928 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 19:47:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:11,141 INFO L225 Difference]: With dead ends: 50917 [2023-12-02 19:47:11,141 INFO L226 Difference]: Without dead ends: 50917 [2023-12-02 19:47:11,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=290, Invalid=1785, Unknown=7, NotChecked=270, Total=2352 [2023-12-02 19:47:11,143 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1574 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 743 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:11,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 203 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1477 Invalid, 0 Unknown, 743 Unchecked, 1.2s Time] [2023-12-02 19:47:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50917 states. [2023-12-02 19:47:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50917 to 35021. [2023-12-02 19:47:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35021 states, 34799 states have (on average 4.457225782350068) internal successors, (155107), 35020 states have internal predecessors, (155107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35021 states to 35021 states and 155107 transitions. [2023-12-02 19:47:12,217 INFO L78 Accepts]: Start accepts. Automaton has 35021 states and 155107 transitions. Word has length 23 [2023-12-02 19:47:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:12,217 INFO L495 AbstractCegarLoop]: Abstraction has 35021 states and 155107 transitions. [2023-12-02 19:47:12,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 35021 states and 155107 transitions. [2023-12-02 19:47:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 19:47:12,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:12,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:12,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-02 19:47:12,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:12,420 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:12,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash -914201026, now seen corresponding path program 1 times [2023-12-02 19:47:12,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:12,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960605228] [2023-12-02 19:47:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:12,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:13,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960605228] [2023-12-02 19:47:13,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960605228] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088885083] [2023-12-02 19:47:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:13,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:13,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:13,086 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:13,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 19:47:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:13,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 19:47:13,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:13,224 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:47:13,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:47:13,262 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:47:13,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:47:13,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:13,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:47:13,547 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:47:13,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:47:13,622 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 16 treesize of output 11 [2023-12-02 19:47:13,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:13,661 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 16 treesize of output 11 [2023-12-02 19:47:13,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:47:13,697 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 15 treesize of output 7 [2023-12-02 19:47:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:13,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:14,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:14,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-12-02 19:47:14,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:14,152 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 35073 treesize of output 34305 [2023-12-02 19:47:14,197 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 127 treesize of output 123 [2023-12-02 19:47:14,204 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 254 treesize of output 238 [2023-12-02 19:47:14,212 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 238 treesize of output 206 [2023-12-02 19:47:14,221 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 106 treesize of output 98 [2023-12-02 19:47:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:14,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088885083] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [751892691] [2023-12-02 19:47:14,984 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:14,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:14,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-12-02 19:47:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487530130] [2023-12-02 19:47:14,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:14,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 19:47:14,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:14,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 19:47:14,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1034, Unknown=36, NotChecked=0, Total=1190 [2023-12-02 19:47:14,986 INFO L87 Difference]: Start difference. First operand 35021 states and 155107 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:17,038 INFO L93 Difference]: Finished difference Result 50337 states and 211049 transitions. [2023-12-02 19:47:17,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 19:47:17,039 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 19:47:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:17,352 INFO L225 Difference]: With dead ends: 50337 [2023-12-02 19:47:17,352 INFO L226 Difference]: Without dead ends: 50253 [2023-12-02 19:47:17,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=310, Invalid=2005, Unknown=37, NotChecked=0, Total=2352 [2023-12-02 19:47:17,353 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1316 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:17,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 190 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 19:47:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50253 states. [2023-12-02 19:47:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50253 to 31729. [2023-12-02 19:47:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31729 states, 31507 states have (on average 4.311518075348335) internal successors, (135843), 31728 states have internal predecessors, (135843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31729 states to 31729 states and 135843 transitions. [2023-12-02 19:47:18,395 INFO L78 Accepts]: Start accepts. Automaton has 31729 states and 135843 transitions. Word has length 23 [2023-12-02 19:47:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:18,396 INFO L495 AbstractCegarLoop]: Abstraction has 31729 states and 135843 transitions. [2023-12-02 19:47:18,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 31729 states and 135843 transitions. [2023-12-02 19:47:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 19:47:18,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:18,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:18,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 19:47:18,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:18,598 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:18,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:18,599 INFO L85 PathProgramCache]: Analyzing trace with hash 433840855, now seen corresponding path program 1 times [2023-12-02 19:47:18,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:18,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003642190] [2023-12-02 19:47:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:47:18,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:18,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003642190] [2023-12-02 19:47:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003642190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:47:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:47:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:47:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343334899] [2023-12-02 19:47:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:47:18,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:47:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:18,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:47:18,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:18,631 INFO L87 Difference]: Start difference. First operand 31729 states and 135843 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:18,856 INFO L93 Difference]: Finished difference Result 28013 states and 120545 transitions. [2023-12-02 19:47:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:47:18,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 19:47:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:18,965 INFO L225 Difference]: With dead ends: 28013 [2023-12-02 19:47:18,965 INFO L226 Difference]: Without dead ends: 28013 [2023-12-02 19:47:18,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:18,966 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:18,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 8 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:47:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28013 states. [2023-12-02 19:47:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28013 to 28013. [2023-12-02 19:47:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28013 states, 27857 states have (on average 4.327278601428725) internal successors, (120545), 28012 states have internal predecessors, (120545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28013 states to 28013 states and 120545 transitions. [2023-12-02 19:47:19,794 INFO L78 Accepts]: Start accepts. Automaton has 28013 states and 120545 transitions. Word has length 23 [2023-12-02 19:47:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:19,794 INFO L495 AbstractCegarLoop]: Abstraction has 28013 states and 120545 transitions. [2023-12-02 19:47:19,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 28013 states and 120545 transitions. [2023-12-02 19:47:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 19:47:19,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:19,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:19,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-02 19:47:19,796 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:19,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1070703535, now seen corresponding path program 1 times [2023-12-02 19:47:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:19,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17502198] [2023-12-02 19:47:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:20,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17502198] [2023-12-02 19:47:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17502198] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125428737] [2023-12-02 19:47:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:20,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:20,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:20,268 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:20,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 19:47:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:20,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 19:47:20,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:20,409 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:47:20,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:47:20,450 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:47:20,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:47:20,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:20,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:20,730 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:47:20,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:47:20,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:20,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:20,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:21,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:21,031 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 17 treesize of output 9 [2023-12-02 19:47:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:21,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:21,145 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1050) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2023-12-02 19:47:21,155 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1049) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1050) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2023-12-02 19:47:21,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:21,403 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 35 treesize of output 36 [2023-12-02 19:47:21,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:21,418 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 2451 treesize of output 2403 [2023-12-02 19:47:21,444 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 143 treesize of output 135 [2023-12-02 19:47:21,456 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 135 treesize of output 131 [2023-12-02 19:47:21,466 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 278 treesize of output 246 [2023-12-02 19:47:21,478 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 130 treesize of output 114 [2023-12-02 19:47:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:22,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125428737] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:22,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [19855837] [2023-12-02 19:47:22,208 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:22,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:22,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2023-12-02 19:47:22,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359293006] [2023-12-02 19:47:22,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:22,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 19:47:22,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:22,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 19:47:22,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=898, Unknown=12, NotChecked=122, Total=1122 [2023-12-02 19:47:22,210 INFO L87 Difference]: Start difference. First operand 28013 states and 120545 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:24,915 INFO L93 Difference]: Finished difference Result 35807 states and 150119 transitions. [2023-12-02 19:47:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 19:47:24,915 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 19:47:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:25,050 INFO L225 Difference]: With dead ends: 35807 [2023-12-02 19:47:25,050 INFO L226 Difference]: Without dead ends: 35807 [2023-12-02 19:47:25,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=348, Invalid=2098, Unknown=12, NotChecked=194, Total=2652 [2023-12-02 19:47:25,051 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1185 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 514 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:25,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 194 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1524 Invalid, 0 Unknown, 514 Unchecked, 1.4s Time] [2023-12-02 19:47:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35807 states. [2023-12-02 19:47:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35807 to 28013. [2023-12-02 19:47:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28013 states, 27857 states have (on average 4.260365437771476) internal successors, (118681), 28012 states have internal predecessors, (118681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28013 states to 28013 states and 118681 transitions. [2023-12-02 19:47:25,892 INFO L78 Accepts]: Start accepts. Automaton has 28013 states and 118681 transitions. Word has length 24 [2023-12-02 19:47:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:25,892 INFO L495 AbstractCegarLoop]: Abstraction has 28013 states and 118681 transitions. [2023-12-02 19:47:25,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 28013 states and 118681 transitions. [2023-12-02 19:47:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 19:47:25,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:25,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:25,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 19:47:26,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:26,096 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:26,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:26,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1070703534, now seen corresponding path program 1 times [2023-12-02 19:47:26,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:26,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094004014] [2023-12-02 19:47:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:26,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:26,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094004014] [2023-12-02 19:47:26,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094004014] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653057305] [2023-12-02 19:47:26,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:26,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:26,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:26,546 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:26,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 19:47:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:26,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:47:26,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:26,700 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:47:26,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:47:26,743 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:47:26,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:47:26,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:26,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:47:27,010 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:47:27,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:47:27,058 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 16 treesize of output 11 [2023-12-02 19:47:27,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:27,097 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 16 treesize of output 11 [2023-12-02 19:47:27,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:47:27,138 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 15 treesize of output 7 [2023-12-02 19:47:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:27,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:27,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1103) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1104) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2023-12-02 19:47:27,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:27,502 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 33 treesize of output 34 [2023-12-02 19:47:27,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:27,517 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 4385 treesize of output 4289 [2023-12-02 19:47:27,670 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 127 treesize of output 123 [2023-12-02 19:47:27,677 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 254 treesize of output 222 [2023-12-02 19:47:27,684 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 222 treesize of output 206 [2023-12-02 19:47:27,696 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 106 treesize of output 98 [2023-12-02 19:47:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653057305] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335119379] [2023-12-02 19:47:28,396 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:28,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2023-12-02 19:47:28,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483641300] [2023-12-02 19:47:28,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:28,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 19:47:28,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:28,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 19:47:28,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=939, Unknown=20, NotChecked=62, Total=1122 [2023-12-02 19:47:28,398 INFO L87 Difference]: Start difference. First operand 28013 states and 118681 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:30,559 INFO L93 Difference]: Finished difference Result 35807 states and 148255 transitions. [2023-12-02 19:47:30,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 19:47:30,560 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 19:47:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:30,677 INFO L225 Difference]: With dead ends: 35807 [2023-12-02 19:47:30,677 INFO L226 Difference]: Without dead ends: 34679 [2023-12-02 19:47:30,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=367, Invalid=2167, Unknown=20, NotChecked=98, Total=2652 [2023-12-02 19:47:30,678 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1001 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:30,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 151 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1190 Invalid, 0 Unknown, 253 Unchecked, 1.0s Time] [2023-12-02 19:47:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34679 states. [2023-12-02 19:47:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34679 to 25179. [2023-12-02 19:47:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25179 states, 25023 states have (on average 4.197937897134636) internal successors, (105045), 25178 states have internal predecessors, (105045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25179 states to 25179 states and 105045 transitions. [2023-12-02 19:47:31,340 INFO L78 Accepts]: Start accepts. Automaton has 25179 states and 105045 transitions. Word has length 24 [2023-12-02 19:47:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:31,341 INFO L495 AbstractCegarLoop]: Abstraction has 25179 states and 105045 transitions. [2023-12-02 19:47:31,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 25179 states and 105045 transitions. [2023-12-02 19:47:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 19:47:31,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:31,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:31,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-12-02 19:47:31,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:31,543 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:31,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 564165783, now seen corresponding path program 1 times [2023-12-02 19:47:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:31,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476744329] [2023-12-02 19:47:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:31,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:31,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:31,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476744329] [2023-12-02 19:47:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476744329] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:31,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854471479] [2023-12-02 19:47:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:31,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:31,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:31,764 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:31,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 19:47:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:31,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 19:47:31,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:32,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:32,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854471479] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:32,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1514926236] [2023-12-02 19:47:32,116 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:32,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:32,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2023-12-02 19:47:32,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686608529] [2023-12-02 19:47:32,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:32,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 19:47:32,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:32,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 19:47:32,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-12-02 19:47:32,117 INFO L87 Difference]: Start difference. First operand 25179 states and 105045 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:32,610 INFO L93 Difference]: Finished difference Result 20649 states and 84263 transitions. [2023-12-02 19:47:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 19:47:32,610 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 19:47:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:32,675 INFO L225 Difference]: With dead ends: 20649 [2023-12-02 19:47:32,675 INFO L226 Difference]: Without dead ends: 17060 [2023-12-02 19:47:32,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2023-12-02 19:47:32,676 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 306 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:32,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 133 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 19:47:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17060 states. [2023-12-02 19:47:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17060 to 17058. [2023-12-02 19:47:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17058 states, 16926 states have (on average 4.202824057662768) internal successors, (71137), 17057 states have internal predecessors, (71137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17058 states to 17058 states and 71137 transitions. [2023-12-02 19:47:33,065 INFO L78 Accepts]: Start accepts. Automaton has 17058 states and 71137 transitions. Word has length 24 [2023-12-02 19:47:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:33,065 INFO L495 AbstractCegarLoop]: Abstraction has 17058 states and 71137 transitions. [2023-12-02 19:47:33,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 17058 states and 71137 transitions. [2023-12-02 19:47:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:47:33,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:33,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:33,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 19:47:33,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:33,267 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:33,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1986969966, now seen corresponding path program 1 times [2023-12-02 19:47:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:33,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773144083] [2023-12-02 19:47:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:33,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:33,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773144083] [2023-12-02 19:47:33,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773144083] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:33,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076671984] [2023-12-02 19:47:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:33,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:33,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:33,824 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:33,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 19:47:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:33,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 19:47:33,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:33,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:47:33,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-02 19:47:34,010 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:47:34,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:47:34,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:34,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:34,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:34,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:34,286 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 17 treesize of output 9 [2023-12-02 19:47:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:34,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:34,375 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1178) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2023-12-02 19:47:34,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1178) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-12-02 19:47:34,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:34,393 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 29 treesize of output 30 [2023-12-02 19:47:34,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:34,401 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 159 treesize of output 147 [2023-12-02 19:47:34,406 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 29 treesize of output 25 [2023-12-02 19:47:34,427 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 28 treesize of output 20 [2023-12-02 19:47:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-12-02 19:47:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076671984] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1789834637] [2023-12-02 19:47:34,642 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:34,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:34,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2023-12-02 19:47:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129560672] [2023-12-02 19:47:34,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:34,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 19:47:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 19:47:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=903, Unknown=2, NotChecked=122, Total=1122 [2023-12-02 19:47:34,644 INFO L87 Difference]: Start difference. First operand 17058 states and 71137 transitions. Second operand has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 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-12-02 19:47:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:36,005 INFO L93 Difference]: Finished difference Result 24420 states and 103516 transitions. [2023-12-02 19:47:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:47:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 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 26 [2023-12-02 19:47:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:36,092 INFO L225 Difference]: With dead ends: 24420 [2023-12-02 19:47:36,092 INFO L226 Difference]: Without dead ends: 24420 [2023-12-02 19:47:36,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=337, Invalid=2119, Unknown=2, NotChecked=194, Total=2652 [2023-12-02 19:47:36,093 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 648 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 467 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:36,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 147 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1333 Invalid, 0 Unknown, 467 Unchecked, 0.7s Time] [2023-12-02 19:47:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24420 states. [2023-12-02 19:47:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24420 to 18050. [2023-12-02 19:47:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18050 states, 17918 states have (on average 4.362093983703538) internal successors, (78160), 18049 states have internal predecessors, (78160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 78160 transitions. [2023-12-02 19:47:36,690 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 78160 transitions. Word has length 26 [2023-12-02 19:47:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:36,690 INFO L495 AbstractCegarLoop]: Abstraction has 18050 states and 78160 transitions. [2023-12-02 19:47:36,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 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-12-02 19:47:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 78160 transitions. [2023-12-02 19:47:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:47:36,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:36,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:36,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 19:47:36,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-02 19:47:36,893 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:36,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1986969965, now seen corresponding path program 1 times [2023-12-02 19:47:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981603464] [2023-12-02 19:47:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:37,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981603464] [2023-12-02 19:47:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981603464] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334634948] [2023-12-02 19:47:37,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:37,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:37,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:37,282 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:37,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-02 19:47:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:37,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 19:47:37,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:37,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-02 19:47:37,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:47:37,459 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:47:37,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:47:37,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:37,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:37,656 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 16 treesize of output 11 [2023-12-02 19:47:37,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:47:37,730 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 15 treesize of output 7 [2023-12-02 19:47:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:37,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:37,817 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1216 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2023-12-02 19:47:37,825 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2023-12-02 19:47:37,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:37,838 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 27 treesize of output 28 [2023-12-02 19:47:37,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:37,846 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 141 treesize of output 129 [2023-12-02 19:47:37,851 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 25 treesize of output 21 [2023-12-02 19:47:37,870 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 24 treesize of output 16 [2023-12-02 19:47:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-12-02 19:47:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334634948] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629389186] [2023-12-02 19:47:38,061 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:38,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:38,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2023-12-02 19:47:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568595478] [2023-12-02 19:47:38,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:38,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 19:47:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:38,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 19:47:38,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=903, Unknown=2, NotChecked=122, Total=1122 [2023-12-02 19:47:38,063 INFO L87 Difference]: Start difference. First operand 18050 states and 78160 transitions. Second operand has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 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-12-02 19:47:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:39,403 INFO L93 Difference]: Finished difference Result 24420 states and 102542 transitions. [2023-12-02 19:47:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:47:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 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 26 [2023-12-02 19:47:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:39,500 INFO L225 Difference]: With dead ends: 24420 [2023-12-02 19:47:39,500 INFO L226 Difference]: Without dead ends: 24420 [2023-12-02 19:47:39,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=337, Invalid=2119, Unknown=2, NotChecked=194, Total=2652 [2023-12-02 19:47:39,501 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 737 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:39,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 135 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1219 Invalid, 0 Unknown, 461 Unchecked, 0.7s Time] [2023-12-02 19:47:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24420 states. [2023-12-02 19:47:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24420 to 18050. [2023-12-02 19:47:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18050 states, 17918 states have (on average 4.307735238307846) internal successors, (77186), 18049 states have internal predecessors, (77186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 77186 transitions. [2023-12-02 19:47:40,112 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 77186 transitions. Word has length 26 [2023-12-02 19:47:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:40,112 INFO L495 AbstractCegarLoop]: Abstraction has 18050 states and 77186 transitions. [2023-12-02 19:47:40,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 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-12-02 19:47:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 77186 transitions. [2023-12-02 19:47:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:47:40,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:40,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:40,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-12-02 19:47:40,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-12-02 19:47:40,315 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread4Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:40,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:40,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1986969963, now seen corresponding path program 1 times [2023-12-02 19:47:40,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:40,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160449274] [2023-12-02 19:47:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 19:47:40,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:40,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160449274] [2023-12-02 19:47:40,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160449274] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:47:40,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:47:40,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:47:40,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334784188] [2023-12-02 19:47:40,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:47:40,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:47:40,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:40,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:47:40,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:40,379 INFO L87 Difference]: Start difference. First operand 18050 states and 77186 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:40,553 INFO L93 Difference]: Finished difference Result 17076 states and 72162 transitions. [2023-12-02 19:47:40,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:47:40,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 19:47:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:40,619 INFO L225 Difference]: With dead ends: 17076 [2023-12-02 19:47:40,619 INFO L226 Difference]: Without dead ends: 17076 [2023-12-02 19:47:40,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:40,620 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:40,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:47:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17076 states. [2023-12-02 19:47:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17076 to 17076. [2023-12-02 19:47:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17076 states, 16971 states have (on average 4.25207707265335) internal successors, (72162), 17075 states have internal predecessors, (72162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17076 states to 17076 states and 72162 transitions. [2023-12-02 19:47:41,067 INFO L78 Accepts]: Start accepts. Automaton has 17076 states and 72162 transitions. Word has length 26 [2023-12-02 19:47:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:41,067 INFO L495 AbstractCegarLoop]: Abstraction has 17076 states and 72162 transitions. [2023-12-02 19:47:41,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 17076 states and 72162 transitions. [2023-12-02 19:47:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:47:41,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:41,069 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:41,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-02 19:47:41,069 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:41,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:41,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1986969962, now seen corresponding path program 1 times [2023-12-02 19:47:41,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:41,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368313876] [2023-12-02 19:47:41,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:41,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 19:47:41,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368313876] [2023-12-02 19:47:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368313876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:47:41,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:47:41,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:47:41,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898052116] [2023-12-02 19:47:41,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:47:41,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:47:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:41,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:47:41,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:41,242 INFO L87 Difference]: Start difference. First operand 17076 states and 72162 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:41,403 INFO L93 Difference]: Finished difference Result 16102 states and 67138 transitions. [2023-12-02 19:47:41,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:47:41,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 19:47:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:41,466 INFO L225 Difference]: With dead ends: 16102 [2023-12-02 19:47:41,466 INFO L226 Difference]: Without dead ends: 16102 [2023-12-02 19:47:41,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:41,467 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:41,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 8 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:47:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16102 states. [2023-12-02 19:47:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16102 to 15134. [2023-12-02 19:47:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15134 states, 15056 states have (on average 4.191219447396387) internal successors, (63103), 15133 states have internal predecessors, (63103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 63103 transitions. [2023-12-02 19:47:41,861 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 63103 transitions. Word has length 26 [2023-12-02 19:47:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:41,861 INFO L495 AbstractCegarLoop]: Abstraction has 15134 states and 63103 transitions. [2023-12-02 19:47:41,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 63103 transitions. [2023-12-02 19:47:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 19:47:41,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:41,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:41,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-02 19:47:41,864 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:41,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -43428515, now seen corresponding path program 2 times [2023-12-02 19:47:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277010558] [2023-12-02 19:47:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 19:47:41,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277010558] [2023-12-02 19:47:41,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277010558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:47:41,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:47:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:47:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071481805] [2023-12-02 19:47:41,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:47:41,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:47:41,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:47:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:41,939 INFO L87 Difference]: Start difference. First operand 15134 states and 63103 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-12-02 19:47:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:42,074 INFO L93 Difference]: Finished difference Result 13406 states and 54569 transitions. [2023-12-02 19:47:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:47:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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 27 [2023-12-02 19:47:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:42,120 INFO L225 Difference]: With dead ends: 13406 [2023-12-02 19:47:42,120 INFO L226 Difference]: Without dead ends: 13406 [2023-12-02 19:47:42,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:42,120 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:42,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 8 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:47:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13406 states. [2023-12-02 19:47:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13406 to 13406. [2023-12-02 19:47:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13406 states, 13355 states have (on average 4.086035192811681) internal successors, (54569), 13405 states have internal predecessors, (54569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13406 states to 13406 states and 54569 transitions. [2023-12-02 19:47:42,446 INFO L78 Accepts]: Start accepts. Automaton has 13406 states and 54569 transitions. Word has length 27 [2023-12-02 19:47:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:42,446 INFO L495 AbstractCegarLoop]: Abstraction has 13406 states and 54569 transitions. [2023-12-02 19:47:42,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-12-02 19:47:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 13406 states and 54569 transitions. [2023-12-02 19:47:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 19:47:42,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:42,448 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:42,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-02 19:47:42,449 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:42,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash -43428514, now seen corresponding path program 1 times [2023-12-02 19:47:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427766448] [2023-12-02 19:47:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:42,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 19:47:42,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:42,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427766448] [2023-12-02 19:47:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427766448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:47:42,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:47:42,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:47:42,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256697806] [2023-12-02 19:47:42,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:47:42,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:47:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:42,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:47:42,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:42,522 INFO L87 Difference]: Start difference. First operand 13406 states and 54569 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-12-02 19:47:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:42,639 INFO L93 Difference]: Finished difference Result 11806 states and 46807 transitions. [2023-12-02 19:47:42,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:47:42,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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 27 [2023-12-02 19:47:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:42,734 INFO L225 Difference]: With dead ends: 11806 [2023-12-02 19:47:42,734 INFO L226 Difference]: Without dead ends: 11746 [2023-12-02 19:47:42,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:47:42,735 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:42,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 8 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:47:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11746 states. [2023-12-02 19:47:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11746 to 10590. [2023-12-02 19:47:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10590 states, 10560 states have (on average 3.9739583333333335) internal successors, (41965), 10589 states have internal predecessors, (41965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10590 states to 10590 states and 41965 transitions. [2023-12-02 19:47:42,977 INFO L78 Accepts]: Start accepts. Automaton has 10590 states and 41965 transitions. Word has length 27 [2023-12-02 19:47:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:42,978 INFO L495 AbstractCegarLoop]: Abstraction has 10590 states and 41965 transitions. [2023-12-02 19:47:42,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-12-02 19:47:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 10590 states and 41965 transitions. [2023-12-02 19:47:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 19:47:42,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:42,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:42,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-02 19:47:42,980 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:42,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash -43428518, now seen corresponding path program 1 times [2023-12-02 19:47:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634496091] [2023-12-02 19:47:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:43,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634496091] [2023-12-02 19:47:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634496091] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051029535] [2023-12-02 19:47:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:43,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:43,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:43,463 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:43,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 19:47:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:43,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:47:43,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:43,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:47:43,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:43,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:43,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:43,892 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:47:43,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:47:43,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:43,977 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 17 treesize of output 9 [2023-12-02 19:47:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:43,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:44,062 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1332 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1332) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0)))))) is different from false [2023-12-02 19:47:44,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:44,225 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 29 treesize of output 30 [2023-12-02 19:47:44,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:44,232 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 159 treesize of output 147 [2023-12-02 19:47:44,238 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 29 treesize of output 25 [2023-12-02 19:47:44,242 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 32 treesize of output 24 [2023-12-02 19:47:44,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:47:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:44,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051029535] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:44,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [867070364] [2023-12-02 19:47:44,574 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:44,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:44,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2023-12-02 19:47:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781911488] [2023-12-02 19:47:44,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:44,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 19:47:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:44,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 19:47:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1098, Unknown=9, NotChecked=66, Total=1260 [2023-12-02 19:47:44,575 INFO L87 Difference]: Start difference. First operand 10590 states and 41965 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:46,060 INFO L93 Difference]: Finished difference Result 16272 states and 64796 transitions. [2023-12-02 19:47:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 19:47:46,061 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 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 27 [2023-12-02 19:47:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:46,106 INFO L225 Difference]: With dead ends: 16272 [2023-12-02 19:47:46,106 INFO L226 Difference]: Without dead ends: 16272 [2023-12-02 19:47:46,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=287, Invalid=2258, Unknown=9, NotChecked=98, Total=2652 [2023-12-02 19:47:46,107 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 486 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:46,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 204 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1643 Invalid, 0 Unknown, 183 Unchecked, 0.9s Time] [2023-12-02 19:47:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16272 states. [2023-12-02 19:47:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16272 to 11297. [2023-12-02 19:47:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11297 states, 11267 states have (on average 4.034880624833585) internal successors, (45461), 11296 states have internal predecessors, (45461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11297 states to 11297 states and 45461 transitions. [2023-12-02 19:47:46,369 INFO L78 Accepts]: Start accepts. Automaton has 11297 states and 45461 transitions. Word has length 27 [2023-12-02 19:47:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:46,369 INFO L495 AbstractCegarLoop]: Abstraction has 11297 states and 45461 transitions. [2023-12-02 19:47:46,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11297 states and 45461 transitions. [2023-12-02 19:47:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 19:47:46,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:46,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:46,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 19:47:46,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:46,571 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:46,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash -43428517, now seen corresponding path program 1 times [2023-12-02 19:47:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:46,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486832435] [2023-12-02 19:47:46,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:46,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:47,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486832435] [2023-12-02 19:47:47,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486832435] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110450784] [2023-12-02 19:47:47,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:47,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:47,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:47,010 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:47,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 19:47:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:47,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:47:47,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:47,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:47:47,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:47,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:47,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:47:47,447 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:47:47,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:47:47,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:47:47,519 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 15 treesize of output 7 [2023-12-02 19:47:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:47,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:47,629 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1376) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2023-12-02 19:47:47,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:47,734 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 27 treesize of output 28 [2023-12-02 19:47:47,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:47,742 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 71 treesize of output 65 [2023-12-02 19:47:47,748 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 54 treesize of output 46 [2023-12-02 19:47:47,755 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 24 treesize of output 20 [2023-12-02 19:47:48,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:47:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110450784] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [833536933] [2023-12-02 19:47:48,105 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:48,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-12-02 19:47:48,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790331670] [2023-12-02 19:47:48,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:48,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 19:47:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:48,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 19:47:48,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1023, Unknown=6, NotChecked=64, Total=1190 [2023-12-02 19:47:48,107 INFO L87 Difference]: Start difference. First operand 11297 states and 45461 transitions. Second operand has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 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-12-02 19:47:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:49,262 INFO L93 Difference]: Finished difference Result 16272 states and 64092 transitions. [2023-12-02 19:47:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 19:47:49,262 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 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 27 [2023-12-02 19:47:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:49,308 INFO L225 Difference]: With dead ends: 16272 [2023-12-02 19:47:49,308 INFO L226 Difference]: Without dead ends: 16248 [2023-12-02 19:47:49,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=285, Invalid=2163, Unknown=6, NotChecked=96, Total=2550 [2023-12-02 19:47:49,309 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 490 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:49,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 170 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1361 Invalid, 0 Unknown, 181 Unchecked, 0.7s Time] [2023-12-02 19:47:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16248 states. [2023-12-02 19:47:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16248 to 10594. [2023-12-02 19:47:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10594 states, 10564 states have (on average 3.973684210526316) internal successors, (41978), 10593 states have internal predecessors, (41978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10594 states to 10594 states and 41978 transitions. [2023-12-02 19:47:49,601 INFO L78 Accepts]: Start accepts. Automaton has 10594 states and 41978 transitions. Word has length 27 [2023-12-02 19:47:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:49,601 INFO L495 AbstractCegarLoop]: Abstraction has 10594 states and 41978 transitions. [2023-12-02 19:47:49,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 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-12-02 19:47:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 10594 states and 41978 transitions. [2023-12-02 19:47:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 19:47:49,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:49,604 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:49,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 19:47:49,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-12-02 19:47:49,805 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:49,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:49,805 INFO L85 PathProgramCache]: Analyzing trace with hash 873958967, now seen corresponding path program 1 times [2023-12-02 19:47:49,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:49,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127755753] [2023-12-02 19:47:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:49,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:50,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:50,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127755753] [2023-12-02 19:47:50,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127755753] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:50,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415615087] [2023-12-02 19:47:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:50,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:50,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:50,423 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:50,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-02 19:47:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:50,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 19:47:50,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:50,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:47:50,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:50,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:50,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:50,897 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:47:50,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:47:50,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:51,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:51,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:47:51,073 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 17 treesize of output 9 [2023-12-02 19:47:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:51,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:51,167 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1426 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1426) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:47:51,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:51,427 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 32 treesize of output 33 [2023-12-02 19:47:51,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:51,436 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 311 treesize of output 299 [2023-12-02 19:47:51,448 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 138 treesize of output 130 [2023-12-02 19:47:51,454 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 130 treesize of output 114 [2023-12-02 19:47:51,463 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 58 treesize of output 54 [2023-12-02 19:47:51,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:51,965 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 29 treesize of output 34 [2023-12-02 19:47:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:52,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415615087] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:52,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1574412236] [2023-12-02 19:47:52,018 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:52,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:52,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2023-12-02 19:47:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033659740] [2023-12-02 19:47:52,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:52,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 19:47:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:52,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 19:47:52,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1433, Unknown=16, NotChecked=76, Total=1640 [2023-12-02 19:47:52,021 INFO L87 Difference]: Start difference. First operand 10594 states and 41978 transitions. Second operand has 41 states, 40 states have (on average 1.925) internal successors, (77), 40 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-12-02 19:47:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:54,494 INFO L93 Difference]: Finished difference Result 17154 states and 68163 transitions. [2023-12-02 19:47:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 19:47:54,495 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 40 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-12-02 19:47:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:54,555 INFO L225 Difference]: With dead ends: 17154 [2023-12-02 19:47:54,555 INFO L226 Difference]: Without dead ends: 17154 [2023-12-02 19:47:54,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=325, Invalid=2743, Unknown=16, NotChecked=108, Total=3192 [2023-12-02 19:47:54,556 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 701 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 3028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:54,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 410 Invalid, 3028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2735 Invalid, 0 Unknown, 267 Unchecked, 1.6s Time] [2023-12-02 19:47:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2023-12-02 19:47:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 11400. [2023-12-02 19:47:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11400 states, 11370 states have (on average 4.031398416886543) internal successors, (45837), 11399 states have internal predecessors, (45837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11400 states to 11400 states and 45837 transitions. [2023-12-02 19:47:54,942 INFO L78 Accepts]: Start accepts. Automaton has 11400 states and 45837 transitions. Word has length 28 [2023-12-02 19:47:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:54,942 INFO L495 AbstractCegarLoop]: Abstraction has 11400 states and 45837 transitions. [2023-12-02 19:47:54,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 40 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-12-02 19:47:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 11400 states and 45837 transitions. [2023-12-02 19:47:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 19:47:54,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:54,946 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:54,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-12-02 19:47:55,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-12-02 19:47:55,146 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:47:55,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:47:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash 873958968, now seen corresponding path program 1 times [2023-12-02 19:47:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:47:55,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100175061] [2023-12-02 19:47:55,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:55,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:47:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:55,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:47:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100175061] [2023-12-02 19:47:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100175061] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:47:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586145793] [2023-12-02 19:47:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:47:55,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:47:55,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:47:55,735 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:47:55,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 19:47:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:47:55,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 19:47:55,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:47:55,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:47:56,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:47:56,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:56,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 16 treesize of output 11 [2023-12-02 19:47:56,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:47:56,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:47:56,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:47:56,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:47:56,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:47:56,443 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 15 treesize of output 7 [2023-12-02 19:47:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:56,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:47:56,542 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1476) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:47:56,608 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1475) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1476) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2023-12-02 19:47:56,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:56,753 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 30 treesize of output 31 [2023-12-02 19:47:56,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:56,764 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 1105 treesize of output 1057 [2023-12-02 19:47:56,779 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 59 treesize of output 55 [2023-12-02 19:47:56,786 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 55 treesize of output 47 [2023-12-02 19:47:56,793 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 62 treesize of output 46 [2023-12-02 19:47:57,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:47:57,206 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 29 treesize of output 34 [2023-12-02 19:47:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:47:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586145793] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:47:57,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [192600322] [2023-12-02 19:47:57,270 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:47:57,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:47:57,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2023-12-02 19:47:57,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65325125] [2023-12-02 19:47:57,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:47:57,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 19:47:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:47:57,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 19:47:57,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1366, Unknown=13, NotChecked=150, Total=1640 [2023-12-02 19:47:57,272 INFO L87 Difference]: Start difference. First operand 11400 states and 45837 transitions. Second operand has 41 states, 40 states have (on average 1.925) internal successors, (77), 40 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-12-02 19:47:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:47:59,500 INFO L93 Difference]: Finished difference Result 17154 states and 67481 transitions. [2023-12-02 19:47:59,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 19:47:59,500 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 40 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-12-02 19:47:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:47:59,550 INFO L225 Difference]: With dead ends: 17154 [2023-12-02 19:47:59,550 INFO L226 Difference]: Without dead ends: 17130 [2023-12-02 19:47:59,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=315, Invalid=2650, Unknown=13, NotChecked=214, Total=3192 [2023-12-02 19:47:59,551 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 819 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:47:59,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 377 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2530 Invalid, 0 Unknown, 530 Unchecked, 1.4s Time] [2023-12-02 19:47:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2023-12-02 19:47:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 10718. [2023-12-02 19:47:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10718 states, 10688 states have (on average 3.9716504491017965) internal successors, (42449), 10717 states have internal predecessors, (42449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:47:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10718 states to 10718 states and 42449 transitions. [2023-12-02 19:47:59,819 INFO L78 Accepts]: Start accepts. Automaton has 10718 states and 42449 transitions. Word has length 28 [2023-12-02 19:47:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:47:59,820 INFO L495 AbstractCegarLoop]: Abstraction has 10718 states and 42449 transitions. [2023-12-02 19:47:59,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 40 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-12-02 19:47:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 10718 states and 42449 transitions. [2023-12-02 19:47:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 19:47:59,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:47:59,822 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:47:59,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 19:48:00,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2023-12-02 19:48:00,022 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:00,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1346297465, now seen corresponding path program 1 times [2023-12-02 19:48:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:00,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217204311] [2023-12-02 19:48:00,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:00,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:00,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:00,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217204311] [2023-12-02 19:48:00,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217204311] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:00,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330108243] [2023-12-02 19:48:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:00,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:00,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:00,577 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:00,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 19:48:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:00,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 19:48:00,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:00,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:00,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:01,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:01,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:01,117 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:01,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:01,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:01,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:01,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:01,357 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 17 treesize of output 9 [2023-12-02 19:48:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:01,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:01,461 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1525 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1525) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:48:01,524 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1524) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1525) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2023-12-02 19:48:01,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:01,715 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 32 treesize of output 33 [2023-12-02 19:48:01,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:01,724 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 311 treesize of output 299 [2023-12-02 19:48:01,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 67 treesize of output 63 [2023-12-02 19:48:01,744 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 134 treesize of output 118 [2023-12-02 19:48:01,753 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 62 treesize of output 54 [2023-12-02 19:48:02,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:48:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 19:48:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330108243] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [442027591] [2023-12-02 19:48:02,225 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:02,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:02,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2023-12-02 19:48:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055145140] [2023-12-02 19:48:02,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:02,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 19:48:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:02,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 19:48:02,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1425, Unknown=12, NotChecked=154, Total=1722 [2023-12-02 19:48:02,227 INFO L87 Difference]: Start difference. First operand 10718 states and 42449 transitions. Second operand has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 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-12-02 19:48:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:04,433 INFO L93 Difference]: Finished difference Result 17405 states and 69127 transitions. [2023-12-02 19:48:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 19:48:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 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-12-02 19:48:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:04,495 INFO L225 Difference]: With dead ends: 17405 [2023-12-02 19:48:04,495 INFO L226 Difference]: Without dead ends: 17405 [2023-12-02 19:48:04,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=412, Invalid=3124, Unknown=12, NotChecked=234, Total=3782 [2023-12-02 19:48:04,496 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1114 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:04,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 315 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2164 Invalid, 0 Unknown, 582 Unchecked, 1.4s Time] [2023-12-02 19:48:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17405 states. [2023-12-02 19:48:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17405 to 11512. [2023-12-02 19:48:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11512 states, 11482 states have (on average 4.035533879115137) internal successors, (46336), 11511 states have internal predecessors, (46336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11512 states to 11512 states and 46336 transitions. [2023-12-02 19:48:04,879 INFO L78 Accepts]: Start accepts. Automaton has 11512 states and 46336 transitions. Word has length 28 [2023-12-02 19:48:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:04,879 INFO L495 AbstractCegarLoop]: Abstraction has 11512 states and 46336 transitions. [2023-12-02 19:48:04,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 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-12-02 19:48:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 11512 states and 46336 transitions. [2023-12-02 19:48:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 19:48:04,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:04,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:04,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 19:48:05,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:05,083 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:05,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1346297464, now seen corresponding path program 1 times [2023-12-02 19:48:05,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:05,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774994974] [2023-12-02 19:48:05,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:05,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774994974] [2023-12-02 19:48:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774994974] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638626363] [2023-12-02 19:48:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:05,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:05,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:05,721 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:05,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-12-02 19:48:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:05,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 19:48:05,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:05,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:06,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:06,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:06,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:06,238 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:06,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:06,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:06,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:06,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:06,478 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 15 treesize of output 7 [2023-12-02 19:48:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:06,480 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:06,581 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1574) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:48:06,597 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1573) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1574) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:48:06,602 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1573) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1574) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2023-12-02 19:48:06,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:06,750 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 30 treesize of output 31 [2023-12-02 19:48:06,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:06,760 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 277 treesize of output 265 [2023-12-02 19:48:06,772 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 122 treesize of output 106 [2023-12-02 19:48:06,780 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 51 treesize of output 47 [2023-12-02 19:48:06,787 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 54 treesize of output 46 [2023-12-02 19:48:07,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:48:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 19:48:07,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638626363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:07,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [980974039] [2023-12-02 19:48:07,269 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:07,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:07,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2023-12-02 19:48:07,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694572841] [2023-12-02 19:48:07,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:07,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 19:48:07,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:07,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 19:48:07,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1357, Unknown=7, NotChecked=228, Total=1722 [2023-12-02 19:48:07,271 INFO L87 Difference]: Start difference. First operand 11512 states and 46336 transitions. Second operand has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 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-12-02 19:48:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:09,258 INFO L93 Difference]: Finished difference Result 17405 states and 68391 transitions. [2023-12-02 19:48:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 19:48:09,259 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 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-12-02 19:48:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:09,323 INFO L225 Difference]: With dead ends: 17405 [2023-12-02 19:48:09,323 INFO L226 Difference]: Without dead ends: 17381 [2023-12-02 19:48:09,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=410, Invalid=3017, Unknown=7, NotChecked=348, Total=3782 [2023-12-02 19:48:09,324 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 813 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 869 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:09,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 305 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2094 Invalid, 0 Unknown, 869 Unchecked, 1.3s Time] [2023-12-02 19:48:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17381 states. [2023-12-02 19:48:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17381 to 10840. [2023-12-02 19:48:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10840 states, 10810 states have (on average 3.9714153561517116) internal successors, (42931), 10839 states have internal predecessors, (42931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10840 states to 10840 states and 42931 transitions. [2023-12-02 19:48:09,664 INFO L78 Accepts]: Start accepts. Automaton has 10840 states and 42931 transitions. Word has length 28 [2023-12-02 19:48:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:09,664 INFO L495 AbstractCegarLoop]: Abstraction has 10840 states and 42931 transitions. [2023-12-02 19:48:09,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 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-12-02 19:48:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 10840 states and 42931 transitions. [2023-12-02 19:48:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:48:09,667 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:09,667 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:09,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-12-02 19:48:09,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:09,868 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:09,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:09,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1601546278, now seen corresponding path program 1 times [2023-12-02 19:48:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952065346] [2023-12-02 19:48:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:10,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:10,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952065346] [2023-12-02 19:48:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952065346] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:10,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179847033] [2023-12-02 19:48:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:10,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:10,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:10,371 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:10,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 19:48:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:10,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 19:48:10,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:10,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:10,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:10,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:10,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:10,909 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:10,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:10,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:10,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:10,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:11,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 17 treesize of output 9 [2023-12-02 19:48:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:11,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:11,190 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1624) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2023-12-02 19:48:11,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:11,383 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 32 treesize of output 33 [2023-12-02 19:48:11,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:11,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 619 treesize of output 595 [2023-12-02 19:48:11,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2023-12-02 19:48:11,405 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 63 treesize of output 55 [2023-12-02 19:48:11,412 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 70 treesize of output 54 [2023-12-02 19:48:11,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:11,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 29 treesize of output 34 [2023-12-02 19:48:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:11,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179847033] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1536486487] [2023-12-02 19:48:11,836 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:11,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2023-12-02 19:48:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577864751] [2023-12-02 19:48:11,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:11,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 19:48:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:11,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 19:48:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1358, Unknown=11, NotChecked=74, Total=1560 [2023-12-02 19:48:11,837 INFO L87 Difference]: Start difference. First operand 10840 states and 42931 transitions. Second operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:14,404 INFO L93 Difference]: Finished difference Result 16312 states and 64935 transitions. [2023-12-02 19:48:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 19:48:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 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 29 [2023-12-02 19:48:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:14,449 INFO L225 Difference]: With dead ends: 16312 [2023-12-02 19:48:14,449 INFO L226 Difference]: Without dead ends: 16312 [2023-12-02 19:48:14,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=445, Invalid=3088, Unknown=11, NotChecked=116, Total=3660 [2023-12-02 19:48:14,450 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 733 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:14,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 357 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2532 Invalid, 0 Unknown, 294 Unchecked, 1.5s Time] [2023-12-02 19:48:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16312 states. [2023-12-02 19:48:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16312 to 11692. [2023-12-02 19:48:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11692 states, 11662 states have (on average 4.028125535928657) internal successors, (46976), 11691 states have internal predecessors, (46976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 46976 transitions. [2023-12-02 19:48:14,732 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 46976 transitions. Word has length 29 [2023-12-02 19:48:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:14,732 INFO L495 AbstractCegarLoop]: Abstraction has 11692 states and 46976 transitions. [2023-12-02 19:48:14,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 46976 transitions. [2023-12-02 19:48:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:48:14,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:14,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:14,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 19:48:14,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:14,936 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:14,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1601546279, now seen corresponding path program 1 times [2023-12-02 19:48:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108603447] [2023-12-02 19:48:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:15,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108603447] [2023-12-02 19:48:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108603447] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985280033] [2023-12-02 19:48:15,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:15,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:15,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:15,476 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:15,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 19:48:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:15,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 19:48:15,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:15,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:15,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:15,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:15,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:15,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:15,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:16,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:16,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:16,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:16,092 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 15 treesize of output 7 [2023-12-02 19:48:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:16,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:16,195 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1674 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1674) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2023-12-02 19:48:16,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:16,373 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 30 treesize of output 31 [2023-12-02 19:48:16,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:16,383 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 1105 treesize of output 1057 [2023-12-02 19:48:16,396 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 59 treesize of output 55 [2023-12-02 19:48:16,402 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 118 treesize of output 102 [2023-12-02 19:48:16,409 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 54 treesize of output 46 [2023-12-02 19:48:16,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:16,800 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 29 treesize of output 34 [2023-12-02 19:48:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:16,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985280033] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:16,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2045902066] [2023-12-02 19:48:16,859 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:16,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:16,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2023-12-02 19:48:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489190541] [2023-12-02 19:48:16,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:16,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 19:48:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 19:48:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1350, Unknown=5, NotChecked=74, Total=1560 [2023-12-02 19:48:16,860 INFO L87 Difference]: Start difference. First operand 11692 states and 46976 transitions. Second operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:18,996 INFO L93 Difference]: Finished difference Result 16312 states and 64243 transitions. [2023-12-02 19:48:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 19:48:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 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 29 [2023-12-02 19:48:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:19,049 INFO L225 Difference]: With dead ends: 16312 [2023-12-02 19:48:19,049 INFO L226 Difference]: Without dead ends: 16312 [2023-12-02 19:48:19,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=459, Invalid=3080, Unknown=5, NotChecked=116, Total=3660 [2023-12-02 19:48:19,050 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 865 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:19,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 280 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2005 Invalid, 0 Unknown, 292 Unchecked, 1.2s Time] [2023-12-02 19:48:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16312 states. [2023-12-02 19:48:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16312 to 11000. [2023-12-02 19:48:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11000 states, 10970 states have (on average 3.9685505925250686) internal successors, (43535), 10999 states have internal predecessors, (43535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11000 states to 11000 states and 43535 transitions. [2023-12-02 19:48:19,306 INFO L78 Accepts]: Start accepts. Automaton has 11000 states and 43535 transitions. Word has length 29 [2023-12-02 19:48:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:19,306 INFO L495 AbstractCegarLoop]: Abstraction has 11000 states and 43535 transitions. [2023-12-02 19:48:19,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 11000 states and 43535 transitions. [2023-12-02 19:48:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:48:19,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:19,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:19,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 19:48:19,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-12-02 19:48:19,510 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:19,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1322910794, now seen corresponding path program 1 times [2023-12-02 19:48:19,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:19,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418259472] [2023-12-02 19:48:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:20,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418259472] [2023-12-02 19:48:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418259472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659502242] [2023-12-02 19:48:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:20,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:20,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:20,059 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:20,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-12-02 19:48:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:20,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:48:20,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:20,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:20,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:20,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:20,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:20,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:20,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:20,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:20,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:20,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:20,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:20,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:20,873 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 17 treesize of output 9 [2023-12-02 19:48:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:20,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:20,927 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1728 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1728) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:48:20,937 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1728 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1728) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:48:21,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:21,254 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 35 treesize of output 36 [2023-12-02 19:48:21,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:21,263 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 1227 treesize of output 1203 [2023-12-02 19:48:21,279 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 143 treesize of output 135 [2023-12-02 19:48:21,286 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 282 treesize of output 250 [2023-12-02 19:48:21,294 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 119 treesize of output 115 [2023-12-02 19:48:21,303 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 130 treesize of output 114 [2023-12-02 19:48:21,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:21,823 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 29 treesize of output 34 [2023-12-02 19:48:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 19:48:21,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659502242] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:21,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1808333609] [2023-12-02 19:48:21,879 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:21,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:21,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2023-12-02 19:48:21,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86114410] [2023-12-02 19:48:21,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:21,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 19:48:21,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:21,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 19:48:21,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1639, Unknown=25, NotChecked=166, Total=1980 [2023-12-02 19:48:21,881 INFO L87 Difference]: Start difference. First operand 11000 states and 43535 transitions. Second operand has 45 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:24,542 INFO L93 Difference]: Finished difference Result 25843 states and 101149 transitions. [2023-12-02 19:48:24,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:48:24,543 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 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 29 [2023-12-02 19:48:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:24,623 INFO L225 Difference]: With dead ends: 25843 [2023-12-02 19:48:24,623 INFO L226 Difference]: Without dead ends: 25843 [2023-12-02 19:48:24,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=416, Invalid=3348, Unknown=26, NotChecked=242, Total=4032 [2023-12-02 19:48:24,624 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1422 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 3044 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 3739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 631 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:24,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 494 Invalid, 3739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3044 Invalid, 0 Unknown, 631 Unchecked, 1.8s Time] [2023-12-02 19:48:24,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25843 states. [2023-12-02 19:48:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25843 to 13511. [2023-12-02 19:48:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13511 states, 13481 states have (on average 4.076329649135821) internal successors, (54953), 13510 states have internal predecessors, (54953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 54953 transitions. [2023-12-02 19:48:25,013 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 54953 transitions. Word has length 29 [2023-12-02 19:48:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:25,014 INFO L495 AbstractCegarLoop]: Abstraction has 13511 states and 54953 transitions. [2023-12-02 19:48:25,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 54953 transitions. [2023-12-02 19:48:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:48:25,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:25,017 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:25,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2023-12-02 19:48:25,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-12-02 19:48:25,217 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:25,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1322910795, now seen corresponding path program 1 times [2023-12-02 19:48:25,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57779243] [2023-12-02 19:48:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:25,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:25,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57779243] [2023-12-02 19:48:25,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57779243] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:25,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657460271] [2023-12-02 19:48:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:25,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:25,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:25,749 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:25,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 19:48:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:25,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 19:48:25,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:25,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:26,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:26,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:26,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:26,269 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:26,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:26,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:26,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:26,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:26,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:26,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:26,532 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 15 treesize of output 7 [2023-12-02 19:48:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:26,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:26,580 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1783 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1783) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:48:26,640 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1782 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1782) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1783) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:48:26,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:26,946 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 33 treesize of output 34 [2023-12-02 19:48:26,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:26,961 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 17537 treesize of output 17153 [2023-12-02 19:48:26,993 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 127 treesize of output 123 [2023-12-02 19:48:27,003 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 123 treesize of output 115 [2023-12-02 19:48:27,011 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 115 treesize of output 99 [2023-12-02 19:48:27,020 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 130 treesize of output 98 [2023-12-02 19:48:27,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:27,500 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 29 treesize of output 34 [2023-12-02 19:48:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 19:48:27,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657460271] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:27,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1330621035] [2023-12-02 19:48:27,557 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:27,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:27,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2023-12-02 19:48:27,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480747084] [2023-12-02 19:48:27,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:27,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 19:48:27,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 19:48:27,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1641, Unknown=21, NotChecked=166, Total=1980 [2023-12-02 19:48:27,559 INFO L87 Difference]: Start difference. First operand 13511 states and 54953 transitions. Second operand has 45 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:30,212 INFO L93 Difference]: Finished difference Result 25843 states and 100436 transitions. [2023-12-02 19:48:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:48:30,213 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 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 29 [2023-12-02 19:48:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:30,291 INFO L225 Difference]: With dead ends: 25843 [2023-12-02 19:48:30,291 INFO L226 Difference]: Without dead ends: 25819 [2023-12-02 19:48:30,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=418, Invalid=3351, Unknown=21, NotChecked=242, Total=4032 [2023-12-02 19:48:30,293 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1283 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 633 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:30,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 472 Invalid, 3612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2910 Invalid, 0 Unknown, 633 Unchecked, 1.8s Time] [2023-12-02 19:48:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25819 states. [2023-12-02 19:48:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25819 to 12798. [2023-12-02 19:48:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12798 states, 12768 states have (on average 4.025140977443609) internal successors, (51393), 12797 states have internal predecessors, (51393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12798 states to 12798 states and 51393 transitions. [2023-12-02 19:48:30,685 INFO L78 Accepts]: Start accepts. Automaton has 12798 states and 51393 transitions. Word has length 29 [2023-12-02 19:48:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:30,685 INFO L495 AbstractCegarLoop]: Abstraction has 12798 states and 51393 transitions. [2023-12-02 19:48:30,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 12798 states and 51393 transitions. [2023-12-02 19:48:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:48:30,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:30,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:30,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 19:48:30,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:30,889 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:30,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:30,890 INFO L85 PathProgramCache]: Analyzing trace with hash -230491979, now seen corresponding path program 1 times [2023-12-02 19:48:30,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:30,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706613721] [2023-12-02 19:48:30,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:30,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:31,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:31,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706613721] [2023-12-02 19:48:31,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706613721] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:31,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621341544] [2023-12-02 19:48:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:31,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:31,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:31,329 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:31,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 19:48:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:31,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 19:48:31,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:31,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:31,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:31,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:31,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:31,826 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:31,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:31,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:31,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:31,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:32,025 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 17 treesize of output 9 [2023-12-02 19:48:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:32,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:32,124 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1832 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1832) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:48:32,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:32,378 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 32 treesize of output 33 [2023-12-02 19:48:32,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:32,386 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 311 treesize of output 299 [2023-12-02 19:48:32,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2023-12-02 19:48:32,404 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 59 treesize of output 55 [2023-12-02 19:48:32,411 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 70 treesize of output 54 [2023-12-02 19:48:32,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:48:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:32,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621341544] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:32,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1692492949] [2023-12-02 19:48:32,801 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:32,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:32,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2023-12-02 19:48:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544046916] [2023-12-02 19:48:32,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:32,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 19:48:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 19:48:32,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1497, Unknown=12, NotChecked=78, Total=1722 [2023-12-02 19:48:32,803 INFO L87 Difference]: Start difference. First operand 12798 states and 51393 transitions. Second operand has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:34,700 INFO L93 Difference]: Finished difference Result 18871 states and 76283 transitions. [2023-12-02 19:48:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 19:48:34,701 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 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 29 [2023-12-02 19:48:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:34,756 INFO L225 Difference]: With dead ends: 18871 [2023-12-02 19:48:34,756 INFO L226 Difference]: Without dead ends: 18871 [2023-12-02 19:48:34,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=423, Invalid=3229, Unknown=12, NotChecked=118, Total=3782 [2023-12-02 19:48:34,756 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 982 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:34,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 284 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1976 Invalid, 0 Unknown, 288 Unchecked, 1.2s Time] [2023-12-02 19:48:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18871 states. [2023-12-02 19:48:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18871 to 13578. [2023-12-02 19:48:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13578 states, 13548 states have (on average 4.079126070268674) internal successors, (55264), 13577 states have internal predecessors, (55264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13578 states to 13578 states and 55264 transitions. [2023-12-02 19:48:35,077 INFO L78 Accepts]: Start accepts. Automaton has 13578 states and 55264 transitions. Word has length 29 [2023-12-02 19:48:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:35,077 INFO L495 AbstractCegarLoop]: Abstraction has 13578 states and 55264 transitions. [2023-12-02 19:48:35,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 13578 states and 55264 transitions. [2023-12-02 19:48:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:48:35,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:35,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:35,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 19:48:35,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:35,281 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:35,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash -230491978, now seen corresponding path program 1 times [2023-12-02 19:48:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412545397] [2023-12-02 19:48:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:35,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:35,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412545397] [2023-12-02 19:48:35,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412545397] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:35,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421256419] [2023-12-02 19:48:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:35,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:35,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:35,779 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:35,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-12-02 19:48:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:35,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 19:48:35,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:35,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:36,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:36,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:36,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:36,217 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:36,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:36,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:36,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:36,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:36,402 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 15 treesize of output 7 [2023-12-02 19:48:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:36,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:36,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:36,763 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 30 treesize of output 31 [2023-12-02 19:48:36,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:36,773 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 553 treesize of output 529 [2023-12-02 19:48:36,784 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 59 treesize of output 51 [2023-12-02 19:48:36,791 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 51 treesize of output 47 [2023-12-02 19:48:36,799 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 62 treesize of output 46 [2023-12-02 19:48:37,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:48:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:37,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421256419] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1007207984] [2023-12-02 19:48:37,188 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:37,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2023-12-02 19:48:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032058530] [2023-12-02 19:48:37,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:37,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 19:48:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 19:48:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1467, Unknown=30, NotChecked=0, Total=1640 [2023-12-02 19:48:37,190 INFO L87 Difference]: Start difference. First operand 13578 states and 55264 transitions. Second operand has 41 states, 40 states have (on average 2.075) internal successors, (83), 40 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:38,915 INFO L93 Difference]: Finished difference Result 18871 states and 75515 transitions. [2023-12-02 19:48:38,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 19:48:38,916 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.075) internal successors, (83), 40 states have internal predecessors, (83), 0 states have call successors, (0), 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 29 [2023-12-02 19:48:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:38,969 INFO L225 Difference]: With dead ends: 18871 [2023-12-02 19:48:38,969 INFO L226 Difference]: Without dead ends: 18835 [2023-12-02 19:48:38,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=421, Invalid=3205, Unknown=34, NotChecked=0, Total=3660 [2023-12-02 19:48:38,969 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1069 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:38,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 227 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 19:48:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18835 states. [2023-12-02 19:48:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18835 to 12874. [2023-12-02 19:48:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12874 states, 12844 states have (on average 4.024758642167549) internal successors, (51694), 12873 states have internal predecessors, (51694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12874 states to 12874 states and 51694 transitions. [2023-12-02 19:48:39,296 INFO L78 Accepts]: Start accepts. Automaton has 12874 states and 51694 transitions. Word has length 29 [2023-12-02 19:48:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:39,296 INFO L495 AbstractCegarLoop]: Abstraction has 12874 states and 51694 transitions. [2023-12-02 19:48:39,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.075) internal successors, (83), 40 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 12874 states and 51694 transitions. [2023-12-02 19:48:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 19:48:39,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:39,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:39,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2023-12-02 19:48:39,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2023-12-02 19:48:39,500 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:39,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash 910585426, now seen corresponding path program 1 times [2023-12-02 19:48:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:39,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646718302] [2023-12-02 19:48:39,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:40,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:40,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646718302] [2023-12-02 19:48:40,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646718302] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:40,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286094775] [2023-12-02 19:48:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:40,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:40,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:40,083 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:40,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 19:48:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:40,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 19:48:40,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:40,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:40,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:40,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:40,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:40,658 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:40,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:40,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:40,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:40,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:40,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:40,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:40,933 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 17 treesize of output 9 [2023-12-02 19:48:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:40,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:41,116 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1935) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1936) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:48:41,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:41,455 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 35 treesize of output 36 [2023-12-02 19:48:41,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:41,470 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 9795 treesize of output 9603 [2023-12-02 19:48:41,505 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 143 treesize of output 135 [2023-12-02 19:48:41,515 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 135 treesize of output 131 [2023-12-02 19:48:41,525 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 131 treesize of output 115 [2023-12-02 19:48:41,537 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 146 treesize of output 114 [2023-12-02 19:48:42,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:42,079 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 29 treesize of output 34 [2023-12-02 19:48:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:42,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286094775] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:42,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [749357203] [2023-12-02 19:48:42,133 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:42,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:42,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2023-12-02 19:48:42,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14687225] [2023-12-02 19:48:42,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:42,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-02 19:48:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:42,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-02 19:48:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1788, Unknown=33, NotChecked=86, Total=2070 [2023-12-02 19:48:42,135 INFO L87 Difference]: Start difference. First operand 12874 states and 51694 transitions. Second operand has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 45 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:44,670 INFO L93 Difference]: Finished difference Result 25350 states and 99417 transitions. [2023-12-02 19:48:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 19:48:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 45 states have internal predecessors, (89), 0 states have call successors, (0), 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 30 [2023-12-02 19:48:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:44,751 INFO L225 Difference]: With dead ends: 25350 [2023-12-02 19:48:44,751 INFO L226 Difference]: Without dead ends: 25350 [2023-12-02 19:48:44,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=461, Invalid=3670, Unknown=33, NotChecked=126, Total=4290 [2023-12-02 19:48:44,751 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1162 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:44,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 331 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2116 Invalid, 0 Unknown, 330 Unchecked, 1.5s Time] [2023-12-02 19:48:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25350 states. [2023-12-02 19:48:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25350 to 13998. [2023-12-02 19:48:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13998 states, 13968 states have (on average 4.073382016036655) internal successors, (56897), 13997 states have internal predecessors, (56897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13998 states to 13998 states and 56897 transitions. [2023-12-02 19:48:45,152 INFO L78 Accepts]: Start accepts. Automaton has 13998 states and 56897 transitions. Word has length 30 [2023-12-02 19:48:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:45,152 INFO L495 AbstractCegarLoop]: Abstraction has 13998 states and 56897 transitions. [2023-12-02 19:48:45,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 45 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 13998 states and 56897 transitions. [2023-12-02 19:48:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 19:48:45,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:45,156 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:45,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 19:48:45,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2023-12-02 19:48:45,357 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:45,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 910585427, now seen corresponding path program 1 times [2023-12-02 19:48:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835852647] [2023-12-02 19:48:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:45,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:45,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835852647] [2023-12-02 19:48:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835852647] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:45,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793395652] [2023-12-02 19:48:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:45,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:45,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:45,999 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:46,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 19:48:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:46,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 19:48:46,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:46,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:46,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:46,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:46,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:46,617 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:46,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:46,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:46,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:46,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:46,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:46,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:48:46,905 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 15 treesize of output 7 [2023-12-02 19:48:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:46,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:46,968 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1991 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1991) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:48:46,972 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1991 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1991) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:48:47,032 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1989) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1990) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1991) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2023-12-02 19:48:47,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:47,264 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 33 treesize of output 34 [2023-12-02 19:48:47,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:47,274 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 1097 treesize of output 1073 [2023-12-02 19:48:47,288 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 258 treesize of output 250 [2023-12-02 19:48:47,295 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 250 treesize of output 218 [2023-12-02 19:48:47,305 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 110 treesize of output 106 [2023-12-02 19:48:47,312 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 214 treesize of output 198 [2023-12-02 19:48:47,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:47,902 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 29 treesize of output 34 [2023-12-02 19:48:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793395652] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98363359] [2023-12-02 19:48:47,964 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:47,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:47,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2023-12-02 19:48:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014844356] [2023-12-02 19:48:47,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:47,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 19:48:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:47,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 19:48:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1576, Unknown=10, NotChecked=246, Total=1980 [2023-12-02 19:48:47,966 INFO L87 Difference]: Start difference. First operand 13998 states and 56897 transitions. Second operand has 45 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 44 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:50,386 INFO L93 Difference]: Finished difference Result 25350 states and 98673 transitions. [2023-12-02 19:48:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:48:50,387 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 44 states have internal predecessors, (87), 0 states have call successors, (0), 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 30 [2023-12-02 19:48:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:50,470 INFO L225 Difference]: With dead ends: 25350 [2023-12-02 19:48:50,470 INFO L226 Difference]: Without dead ends: 25314 [2023-12-02 19:48:50,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=413, Invalid=3249, Unknown=10, NotChecked=360, Total=4032 [2023-12-02 19:48:50,471 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1106 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 3787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 950 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:50,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 436 Invalid, 3787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2786 Invalid, 0 Unknown, 950 Unchecked, 1.6s Time] [2023-12-02 19:48:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25314 states. [2023-12-02 19:48:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25314 to 13254. [2023-12-02 19:48:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13254 states, 13224 states have (on average 4.021249243799153) internal successors, (53177), 13253 states have internal predecessors, (53177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13254 states to 13254 states and 53177 transitions. [2023-12-02 19:48:50,851 INFO L78 Accepts]: Start accepts. Automaton has 13254 states and 53177 transitions. Word has length 30 [2023-12-02 19:48:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:50,852 INFO L495 AbstractCegarLoop]: Abstraction has 13254 states and 53177 transitions. [2023-12-02 19:48:50,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 44 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 13254 states and 53177 transitions. [2023-12-02 19:48:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 19:48:50,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:50,857 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:50,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-12-02 19:48:51,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2023-12-02 19:48:51,057 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:51,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash -853339971, now seen corresponding path program 2 times [2023-12-02 19:48:51,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:51,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842018600] [2023-12-02 19:48:51,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:51,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:51,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842018600] [2023-12-02 19:48:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842018600] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51405584] [2023-12-02 19:48:51,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:48:51,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:51,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:51,223 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:51,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-12-02 19:48:51,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:48:51,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:48:51,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 19:48:51,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:51,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:51,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51405584] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1747090796] [2023-12-02 19:48:51,732 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:51,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:51,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2023-12-02 19:48:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243293503] [2023-12-02 19:48:51,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:51,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 19:48:51,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:51,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 19:48:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2023-12-02 19:48:51,733 INFO L87 Difference]: Start difference. First operand 13254 states and 53177 transitions. Second operand has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:52,771 INFO L93 Difference]: Finished difference Result 33652 states and 133232 transitions. [2023-12-02 19:48:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:48:52,772 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 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 30 [2023-12-02 19:48:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:52,886 INFO L225 Difference]: With dead ends: 33652 [2023-12-02 19:48:52,886 INFO L226 Difference]: Without dead ends: 33004 [2023-12-02 19:48:52,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 19:48:52,887 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 350 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:52,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 261 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 19:48:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33004 states. [2023-12-02 19:48:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33004 to 25250. [2023-12-02 19:48:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25250 states, 25212 states have (on average 4.103839441535777) internal successors, (103466), 25249 states have internal predecessors, (103466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25250 states to 25250 states and 103466 transitions. [2023-12-02 19:48:53,549 INFO L78 Accepts]: Start accepts. Automaton has 25250 states and 103466 transitions. Word has length 30 [2023-12-02 19:48:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:48:53,549 INFO L495 AbstractCegarLoop]: Abstraction has 25250 states and 103466 transitions. [2023-12-02 19:48:53,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25250 states and 103466 transitions. [2023-12-02 19:48:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:48:53,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:48:53,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:48:53,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2023-12-02 19:48:53,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:53,758 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:48:53,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:48:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1488202754, now seen corresponding path program 1 times [2023-12-02 19:48:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:48:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211549701] [2023-12-02 19:48:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:48:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:54,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:48:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211549701] [2023-12-02 19:48:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211549701] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:48:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233420881] [2023-12-02 19:48:54,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:48:54,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:48:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:48:54,326 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:48:54,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-12-02 19:48:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:48:54,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 19:48:54,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:48:54,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:48:54,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:48:54,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:54,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:54,873 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:48:54,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:48:54,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:54,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:54,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:55,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:48:55,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:48:55,137 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 17 treesize of output 9 [2023-12-02 19:48:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:48:55,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:48:55,240 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2078 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2078) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 9223372039002259456))) is different from false [2023-12-02 19:48:55,248 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2078 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2078) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2023-12-02 19:48:55,257 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2078 (Array Int Int)) (v_ArrVal_2077 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2077) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2078) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2023-12-02 19:48:55,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:55,483 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 35 treesize of output 36 [2023-12-02 19:48:55,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:55,494 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 615 treesize of output 603 [2023-12-02 19:48:55,512 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 146 treesize of output 142 [2023-12-02 19:48:55,520 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 286 treesize of output 270 [2023-12-02 19:48:55,529 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 270 treesize of output 262 [2023-12-02 19:48:55,537 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 262 treesize of output 230 [2023-12-02 19:48:56,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:48:56,143 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 29 treesize of output 34 [2023-12-02 19:48:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 19:48:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233420881] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:48:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1483410105] [2023-12-02 19:48:56,202 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:48:56,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:48:56,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2023-12-02 19:48:56,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038705268] [2023-12-02 19:48:56,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:48:56,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 19:48:56,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:48:56,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 19:48:56,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1574, Unknown=14, NotChecked=246, Total=1980 [2023-12-02 19:48:56,203 INFO L87 Difference]: Start difference. First operand 25250 states and 103466 transitions. Second operand has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:48:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:48:59,410 INFO L93 Difference]: Finished difference Result 50886 states and 208436 transitions. [2023-12-02 19:48:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:48:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 19:48:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:48:59,615 INFO L225 Difference]: With dead ends: 50886 [2023-12-02 19:48:59,615 INFO L226 Difference]: Without dead ends: 50886 [2023-12-02 19:48:59,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=419, Invalid=3239, Unknown=14, NotChecked=360, Total=4032 [2023-12-02 19:48:59,615 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1283 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:48:59,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 431 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3088 Invalid, 0 Unknown, 870 Unchecked, 2.1s Time] [2023-12-02 19:48:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50886 states. [2023-12-02 19:49:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50886 to 38638. [2023-12-02 19:49:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38638 states, 38600 states have (on average 4.18621761658031) internal successors, (161588), 38637 states have internal predecessors, (161588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38638 states to 38638 states and 161588 transitions. [2023-12-02 19:49:00,880 INFO L78 Accepts]: Start accepts. Automaton has 38638 states and 161588 transitions. Word has length 31 [2023-12-02 19:49:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:49:00,881 INFO L495 AbstractCegarLoop]: Abstraction has 38638 states and 161588 transitions. [2023-12-02 19:49:00,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 38638 states and 161588 transitions. [2023-12-02 19:49:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:49:00,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:49:00,895 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:49:00,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2023-12-02 19:49:01,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2023-12-02 19:49:01,095 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:49:01,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:49:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1488202755, now seen corresponding path program 1 times [2023-12-02 19:49:01,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:49:01,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977448492] [2023-12-02 19:49:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:49:01,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:49:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:49:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:01,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:49:01,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977448492] [2023-12-02 19:49:01,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977448492] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:49:01,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391724588] [2023-12-02 19:49:01,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:49:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:49:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:49:01,911 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:49:01,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-12-02 19:49:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:49:02,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 19:49:02,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:49:02,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:49:02,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:49:02,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:02,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:49:02,510 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:49:02,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:49:02,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:49:02,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:02,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:49:02,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:02,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:49:02,782 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 15 treesize of output 7 [2023-12-02 19:49:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:02,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:49:02,906 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2133) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2023-12-02 19:49:02,960 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2132 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2131) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2132) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2133) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2023-12-02 19:49:03,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:49:03,146 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 33 treesize of output 34 [2023-12-02 19:49:03,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:49:03,161 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 4385 treesize of output 4289 [2023-12-02 19:49:03,179 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 127 treesize of output 119 [2023-12-02 19:49:03,188 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 119 treesize of output 115 [2023-12-02 19:49:03,195 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 246 treesize of output 214 [2023-12-02 19:49:03,204 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 114 treesize of output 98 [2023-12-02 19:49:03,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:49:03,713 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 29 treesize of output 34 [2023-12-02 19:49:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391724588] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:49:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [306223173] [2023-12-02 19:49:03,764 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:49:03,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:49:03,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2023-12-02 19:49:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568369266] [2023-12-02 19:49:03,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:49:03,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 19:49:03,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:49:03,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 19:49:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1645, Unknown=19, NotChecked=166, Total=1980 [2023-12-02 19:49:03,765 INFO L87 Difference]: Start difference. First operand 38638 states and 161588 transitions. Second operand has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:49:06,847 INFO L93 Difference]: Finished difference Result 50886 states and 206840 transitions. [2023-12-02 19:49:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:49:06,847 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 19:49:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:49:07,036 INFO L225 Difference]: With dead ends: 50886 [2023-12-02 19:49:07,036 INFO L226 Difference]: Without dead ends: 49960 [2023-12-02 19:49:07,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=424, Invalid=3347, Unknown=19, NotChecked=242, Total=4032 [2023-12-02 19:49:07,036 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 896 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 3869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 571 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:49:07,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 452 Invalid, 3869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3247 Invalid, 0 Unknown, 571 Unchecked, 1.9s Time] [2023-12-02 19:49:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49960 states. [2023-12-02 19:49:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49960 to 33880. [2023-12-02 19:49:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33880 states, 33842 states have (on average 4.128065717156196) internal successors, (139702), 33879 states have internal predecessors, (139702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33880 states to 33880 states and 139702 transitions. [2023-12-02 19:49:08,282 INFO L78 Accepts]: Start accepts. Automaton has 33880 states and 139702 transitions. Word has length 31 [2023-12-02 19:49:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:49:08,282 INFO L495 AbstractCegarLoop]: Abstraction has 33880 states and 139702 transitions. [2023-12-02 19:49:08,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 33880 states and 139702 transitions. [2023-12-02 19:49:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:49:08,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:49:08,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:49:08,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2023-12-02 19:49:08,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2023-12-02 19:49:08,491 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:49:08,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:49:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash -705555771, now seen corresponding path program 2 times [2023-12-02 19:49:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:49:08,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320646411] [2023-12-02 19:49:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:49:08,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:49:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:49:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:08,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:49:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320646411] [2023-12-02 19:49:08,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320646411] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:49:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210886004] [2023-12-02 19:49:08,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:49:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:49:08,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:49:08,630 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:49:08,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2023-12-02 19:49:08,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:49:08,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:49:08,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 19:49:08,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:49:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:09,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:49:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:09,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210886004] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:49:09,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1456306144] [2023-12-02 19:49:09,145 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:49:09,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:49:09,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2023-12-02 19:49:09,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495520695] [2023-12-02 19:49:09,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:49:09,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 19:49:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:49:09,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 19:49:09,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2023-12-02 19:49:09,147 INFO L87 Difference]: Start difference. First operand 33880 states and 139702 transitions. Second operand has 31 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 31 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:49:10,152 INFO L93 Difference]: Finished difference Result 35316 states and 138321 transitions. [2023-12-02 19:49:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:49:10,153 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 31 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 19:49:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:49:10,245 INFO L225 Difference]: With dead ends: 35316 [2023-12-02 19:49:10,245 INFO L226 Difference]: Without dead ends: 30260 [2023-12-02 19:49:10,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 19:49:10,246 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 542 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:49:10,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 350 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 19:49:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30260 states. [2023-12-02 19:49:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30260 to 25370. [2023-12-02 19:49:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25370 states, 25338 states have (on average 3.987883810876944) internal successors, (101045), 25369 states have internal predecessors, (101045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25370 states to 25370 states and 101045 transitions. [2023-12-02 19:49:10,986 INFO L78 Accepts]: Start accepts. Automaton has 25370 states and 101045 transitions. Word has length 31 [2023-12-02 19:49:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:49:10,986 INFO L495 AbstractCegarLoop]: Abstraction has 25370 states and 101045 transitions. [2023-12-02 19:49:10,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 31 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25370 states and 101045 transitions. [2023-12-02 19:49:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:49:10,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:49:10,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:49:10,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2023-12-02 19:49:11,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2023-12-02 19:49:11,194 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:49:11,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:49:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash 740027744, now seen corresponding path program 2 times [2023-12-02 19:49:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:49:11,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403985125] [2023-12-02 19:49:11,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:49:11,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:49:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:49:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:11,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:49:11,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403985125] [2023-12-02 19:49:11,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403985125] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:49:11,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116754943] [2023-12-02 19:49:11,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:49:11,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:49:11,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:49:11,825 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:49:11,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-12-02 19:49:12,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:49:12,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:49:12,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:49:12,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:49:12,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:49:12,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:12,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:49:12,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:12,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:49:12,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:12,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:49:12,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:12,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:49:12,599 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 17 treesize of output 9 [2023-12-02 19:49:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:12,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:49:12,690 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2226 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2226) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 9223372039002259456))) is different from false [2023-12-02 19:49:13,630 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_88| Int) (|v_thread1Thread1of1ForFork2_~#t3~0.base_88| Int)) (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (or (< |v_thread1Thread1of1ForFork2_~#t3~0.base_88| .cse0) (< |v_thread1Thread1of1ForFork2_~#t2~0.base_88| .cse0) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_88| v_ArrVal_2225) |v_thread1Thread1of1ForFork2_~#t3~0.base_88| v_ArrVal_2226) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 9223372039002259456)))))) is different from false [2023-12-02 19:49:16,159 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_88| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_88| Int)) (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (or (< |v_thread1Thread1of1ForFork2_~#t3~0.base_88| .cse0) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2223) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2224) |v_thread1Thread1of1ForFork2_~#t2~0.base_88| v_ArrVal_2225) |v_thread1Thread1of1ForFork2_~#t3~0.base_88| v_ArrVal_2226) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< |v_thread1Thread1of1ForFork2_~#t2~0.base_88| .cse0)))) is different from false [2023-12-02 19:49:16,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:49:16,190 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 35 treesize of output 36 [2023-12-02 19:49:16,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:49:16,205 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 78339 treesize of output 76803 [2023-12-02 19:49:16,236 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 143 treesize of output 139 [2023-12-02 19:49:16,244 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 139 treesize of output 131 [2023-12-02 19:49:16,253 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 131 treesize of output 115 [2023-12-02 19:49:16,262 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 146 treesize of output 114 [2023-12-02 19:49:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-12-02 19:49:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116754943] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:49:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [983055913] [2023-12-02 19:49:16,548 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:49:16,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:49:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2023-12-02 19:49:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110275033] [2023-12-02 19:49:16,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:49:16,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-02 19:49:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:49:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-02 19:49:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1397, Unknown=34, NotChecked=234, Total=1806 [2023-12-02 19:49:16,549 INFO L87 Difference]: Start difference. First operand 25370 states and 101045 transitions. Second operand has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:49:19,223 INFO L93 Difference]: Finished difference Result 56472 states and 225252 transitions. [2023-12-02 19:49:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:49:19,224 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 19:49:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:49:19,440 INFO L225 Difference]: With dead ends: 56472 [2023-12-02 19:49:19,441 INFO L226 Difference]: Without dead ends: 56472 [2023-12-02 19:49:19,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=386, Invalid=2896, Unknown=36, NotChecked=342, Total=3660 [2023-12-02 19:49:19,441 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1096 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 4196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1216 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:49:19,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 382 Invalid, 4196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2951 Invalid, 0 Unknown, 1216 Unchecked, 1.7s Time] [2023-12-02 19:49:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56472 states. [2023-12-02 19:49:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56472 to 34838. [2023-12-02 19:49:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34838 states, 34806 states have (on average 4.055593863127047) internal successors, (141159), 34837 states have internal predecessors, (141159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34838 states to 34838 states and 141159 transitions. [2023-12-02 19:49:20,766 INFO L78 Accepts]: Start accepts. Automaton has 34838 states and 141159 transitions. Word has length 31 [2023-12-02 19:49:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:49:20,766 INFO L495 AbstractCegarLoop]: Abstraction has 34838 states and 141159 transitions. [2023-12-02 19:49:20,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 34838 states and 141159 transitions. [2023-12-02 19:49:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:49:20,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:49:20,775 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:49:20,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2023-12-02 19:49:20,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2023-12-02 19:49:20,975 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:49:20,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:49:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash 740027745, now seen corresponding path program 2 times [2023-12-02 19:49:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:49:20,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859515405] [2023-12-02 19:49:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:49:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:49:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:49:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:21,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:49:21,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859515405] [2023-12-02 19:49:21,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859515405] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:49:21,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452755076] [2023-12-02 19:49:21,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:49:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:49:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:49:21,574 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:49:21,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-12-02 19:49:21,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:49:21,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:49:21,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 19:49:21,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:49:22,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 19:49:22,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:22,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:49:22,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:22,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:49:22,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:22,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:49:22,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:49:22,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:49:22,696 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:49:22,696 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 23 treesize of output 10 [2023-12-02 19:49:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:22,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:49:23,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:49:23,795 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 36 treesize of output 37 [2023-12-02 19:49:23,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:49:23,814 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 10305 treesize of output 10019 [2023-12-02 19:49:23,841 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 148 treesize of output 134 [2023-12-02 19:49:23,852 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 134 treesize of output 127 [2023-12-02 19:49:23,861 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 282 treesize of output 226 [2023-12-02 19:49:23,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 98 [2023-12-02 19:49:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:49:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452755076] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:49:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2001357020] [2023-12-02 19:49:24,623 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:49:24,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:49:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 45 [2023-12-02 19:49:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211327622] [2023-12-02 19:49:24,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:49:24,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-02 19:49:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:49:24,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-02 19:49:24,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1991, Unknown=7, NotChecked=0, Total=2162 [2023-12-02 19:49:24,625 INFO L87 Difference]: Start difference. First operand 34838 states and 141159 transitions. Second operand has 47 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 46 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:49:32,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:49:36,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:49:38,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:49:41,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:49:43,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:49:46,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:49:48,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:49:50,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:49:52,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:00,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:50:06,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:08,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:11,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:13,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:15,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:23,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:28,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:37,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:39,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:41,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:44,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:48,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:50,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:50:55,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:51:12,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:12,010 INFO L93 Difference]: Finished difference Result 136430 states and 544838 transitions. [2023-12-02 19:51:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-12-02 19:51:12,011 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 46 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 19:51:12,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:12,823 INFO L225 Difference]: With dead ends: 136430 [2023-12-02 19:51:12,823 INFO L226 Difference]: Without dead ends: 131758 [2023-12-02 19:51:12,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4997 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=2325, Invalid=15177, Unknown=54, NotChecked=0, Total=17556 [2023-12-02 19:51:12,825 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 3662 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 9618 mSolverCounterSat, 216 mSolverCounterUnsat, 272 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3662 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 10106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 9618 IncrementalHoareTripleChecker+Invalid, 272 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 86.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:12,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3662 Valid, 1268 Invalid, 10106 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [216 Valid, 9618 Invalid, 272 Unknown, 0 Unchecked, 86.8s Time] [2023-12-02 19:51:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131758 states. [2023-12-02 19:51:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131758 to 44684. [2023-12-02 19:51:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44684 states, 44653 states have (on average 4.252211497547757) internal successors, (189874), 44683 states have internal predecessors, (189874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44684 states to 44684 states and 189874 transitions. [2023-12-02 19:51:15,256 INFO L78 Accepts]: Start accepts. Automaton has 44684 states and 189874 transitions. Word has length 31 [2023-12-02 19:51:15,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:15,256 INFO L495 AbstractCegarLoop]: Abstraction has 44684 states and 189874 transitions. [2023-12-02 19:51:15,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 46 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 44684 states and 189874 transitions. [2023-12-02 19:51:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:51:15,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:15,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:15,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2023-12-02 19:51:15,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2023-12-02 19:51:15,467 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:51:15,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash 599046506, now seen corresponding path program 3 times [2023-12-02 19:51:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012485268] [2023-12-02 19:51:15,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:15,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:16,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012485268] [2023-12-02 19:51:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012485268] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:51:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702287844] [2023-12-02 19:51:16,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:51:16,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:51:16,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:51:16,214 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:51:16,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-12-02 19:51:16,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:51:16,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:51:16,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-02 19:51:16,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:51:16,685 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:51:16,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:51:16,752 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 19:51:16,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:51:17,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:51:17,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:51:17,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:51:17,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:51:17,472 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:51:17,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:51:17,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:51:17,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:51:17,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:51:17,702 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 17 treesize of output 9 [2023-12-02 19:51:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:17,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:51:17,770 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2336 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2336) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 9223372039002259456))) is different from false [2023-12-02 19:51:17,857 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2335 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2335) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2336) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 9223372039002259456))) is different from false [2023-12-02 19:51:18,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:51:18,294 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 35 treesize of output 36 [2023-12-02 19:51:18,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:51:18,306 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 615 treesize of output 603 [2023-12-02 19:51:18,324 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 290 treesize of output 258 [2023-12-02 19:51:18,333 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 258 treesize of output 242 [2023-12-02 19:51:18,345 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 119 treesize of output 115 [2023-12-02 19:51:18,357 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 122 treesize of output 114 [2023-12-02 19:51:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 19:51:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702287844] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:51:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1213419052] [2023-12-02 19:51:19,230 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:51:19,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:51:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2023-12-02 19:51:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073496679] [2023-12-02 19:51:19,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:51:19,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-02 19:51:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-02 19:51:19,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1733, Unknown=16, NotChecked=170, Total=2070 [2023-12-02 19:51:19,232 INFO L87 Difference]: Start difference. First operand 44684 states and 189874 transitions. Second operand has 46 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:25,016 INFO L93 Difference]: Finished difference Result 86626 states and 361967 transitions. [2023-12-02 19:51:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 19:51:25,017 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 19:51:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:25,400 INFO L225 Difference]: With dead ends: 86626 [2023-12-02 19:51:25,400 INFO L226 Difference]: Without dead ends: 83676 [2023-12-02 19:51:25,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=665, Invalid=4728, Unknown=17, NotChecked=290, Total=5700 [2023-12-02 19:51:25,401 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1441 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 4157 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 4157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 930 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:25,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 539 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 4157 Invalid, 0 Unknown, 930 Unchecked, 3.7s Time] [2023-12-02 19:51:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83676 states. [2023-12-02 19:51:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83676 to 48526. [2023-12-02 19:51:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48526 states, 48496 states have (on average 4.310190531177829) internal successors, (209027), 48525 states have internal predecessors, (209027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48526 states to 48526 states and 209027 transitions. [2023-12-02 19:51:27,456 INFO L78 Accepts]: Start accepts. Automaton has 48526 states and 209027 transitions. Word has length 31 [2023-12-02 19:51:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:27,456 INFO L495 AbstractCegarLoop]: Abstraction has 48526 states and 209027 transitions. [2023-12-02 19:51:27,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 48526 states and 209027 transitions. [2023-12-02 19:51:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 19:51:27,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:27,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:27,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2023-12-02 19:51:27,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2023-12-02 19:51:27,668 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:51:27,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash -553927421, now seen corresponding path program 3 times [2023-12-02 19:51:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:27,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976383819] [2023-12-02 19:51:27,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:27,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:28,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976383819] [2023-12-02 19:51:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976383819] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:51:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266403070] [2023-12-02 19:51:28,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:51:28,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:51:28,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:51:28,189 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:51:28,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-12-02 19:51:28,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:51:28,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:51:28,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 19:51:28,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:51:28,614 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:51:28,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 19:51:28,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:51:28,664 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 15 treesize of output 15 [2023-12-02 19:51:28,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:51:29,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:51:29,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:51:29,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:51:29,192 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 17 treesize of output 9 [2023-12-02 19:51:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:29,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:51:29,360 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2378 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2378) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) is different from false [2023-12-02 19:51:29,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:51:29,444 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 29 treesize of output 30 [2023-12-02 19:51:29,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:51:29,452 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 81 treesize of output 75 [2023-12-02 19:51:29,456 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 62 treesize of output 54 [2023-12-02 19:51:29,460 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 28 treesize of output 24 [2023-12-02 19:51:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266403070] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:51:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1120508355] [2023-12-02 19:51:29,836 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:51:29,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:51:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2023-12-02 19:51:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071538978] [2023-12-02 19:51:29,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:51:29,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 19:51:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:29,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 19:51:29,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1676, Unknown=3, NotChecked=82, Total=1892 [2023-12-02 19:51:29,837 INFO L87 Difference]: Start difference. First operand 48526 states and 209027 transitions. Second operand has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 43 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:32,891 INFO L93 Difference]: Finished difference Result 58298 states and 249413 transitions. [2023-12-02 19:51:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 19:51:32,892 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 43 states have internal predecessors, (93), 0 states have call successors, (0), 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 33 [2023-12-02 19:51:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:33,118 INFO L225 Difference]: With dead ends: 58298 [2023-12-02 19:51:33,118 INFO L226 Difference]: Without dead ends: 58298 [2023-12-02 19:51:33,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=448, Invalid=3713, Unknown=3, NotChecked=126, Total=4290 [2023-12-02 19:51:33,118 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 589 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:33,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 288 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2504 Invalid, 0 Unknown, 234 Unchecked, 1.7s Time] [2023-12-02 19:51:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58298 states. [2023-12-02 19:51:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58298 to 49454. [2023-12-02 19:51:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49454 states, 49424 states have (on average 4.304265134347685) internal successors, (212734), 49453 states have internal predecessors, (212734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49454 states to 49454 states and 212734 transitions. [2023-12-02 19:51:34,736 INFO L78 Accepts]: Start accepts. Automaton has 49454 states and 212734 transitions. Word has length 33 [2023-12-02 19:51:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:51:34,736 INFO L495 AbstractCegarLoop]: Abstraction has 49454 states and 212734 transitions. [2023-12-02 19:51:34,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 43 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 49454 states and 212734 transitions. [2023-12-02 19:51:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 19:51:34,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:51:34,750 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:51:34,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2023-12-02 19:51:34,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:51:34,950 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:51:34,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:51:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -13701313, now seen corresponding path program 3 times [2023-12-02 19:51:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:51:34,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184885523] [2023-12-02 19:51:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:51:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:51:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:51:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:35,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:51:35,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184885523] [2023-12-02 19:51:35,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184885523] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:51:35,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288898252] [2023-12-02 19:51:35,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:51:35,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:51:35,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:51:35,574 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:51:35,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-12-02 19:51:35,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:51:35,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:51:35,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 19:51:35,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:51:35,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 19:51:36,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:51:36,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:51:36,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:51:36,322 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:51:36,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:51:36,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:51:36,612 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 17 treesize of output 9 [2023-12-02 19:51:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:36,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:51:37,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:51:37,528 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 32 treesize of output 33 [2023-12-02 19:51:37,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:51:37,540 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 183 treesize of output 167 [2023-12-02 19:51:37,549 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 32 treesize of output 25 [2023-12-02 19:51:37,556 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 38 treesize of output 24 [2023-12-02 19:51:38,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 19:51:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:51:38,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288898252] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:51:38,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1456403798] [2023-12-02 19:51:38,704 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:51:38,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:51:38,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 48 [2023-12-02 19:51:38,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698608496] [2023-12-02 19:51:38,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:51:38,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 19:51:38,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:51:38,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 19:51:38,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2291, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 19:51:38,706 INFO L87 Difference]: Start difference. First operand 49454 states and 212734 transitions. Second operand has 50 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:51:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:51:57,461 INFO L93 Difference]: Finished difference Result 90252 states and 376083 transitions. [2023-12-02 19:51:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-12-02 19:51:57,462 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 19:51:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:51:57,879 INFO L225 Difference]: With dead ends: 90252 [2023-12-02 19:51:57,879 INFO L226 Difference]: Without dead ends: 90252 [2023-12-02 19:51:57,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4074 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1614, Invalid=13138, Unknown=10, NotChecked=0, Total=14762 [2023-12-02 19:51:57,880 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2841 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 5789 mSolverCounterSat, 188 mSolverCounterUnsat, 90 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 6067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 5789 IncrementalHoareTripleChecker+Invalid, 90 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:51:57,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 634 Invalid, 6067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 5789 Invalid, 90 Unknown, 0 Unchecked, 7.9s Time] [2023-12-02 19:51:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90252 states. [2023-12-02 19:51:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90252 to 51308. [2023-12-02 19:51:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51308 states, 51278 states have (on average 4.31309723468154) internal successors, (221167), 51307 states have internal predecessors, (221167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51308 states to 51308 states and 221167 transitions. [2023-12-02 19:52:00,063 INFO L78 Accepts]: Start accepts. Automaton has 51308 states and 221167 transitions. Word has length 34 [2023-12-02 19:52:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:52:00,064 INFO L495 AbstractCegarLoop]: Abstraction has 51308 states and 221167 transitions. [2023-12-02 19:52:00,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 51308 states and 221167 transitions. [2023-12-02 19:52:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 19:52:00,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:52:00,076 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:52:00,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2023-12-02 19:52:00,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:00,277 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:52:00,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:52:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash -13701312, now seen corresponding path program 2 times [2023-12-02 19:52:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:52:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910949646] [2023-12-02 19:52:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:52:00,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:52:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:52:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:01,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:52:01,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910949646] [2023-12-02 19:52:01,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910949646] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:52:01,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072723954] [2023-12-02 19:52:01,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:52:01,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:01,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:52:01,079 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:52:01,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2023-12-02 19:52:01,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:52:01,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:52:01,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 19:52:01,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:52:01,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 19:52:01,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:01,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:52:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:01,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:52:02,178 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:52:02,178 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 23 treesize of output 10 [2023-12-02 19:52:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:02,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:52:02,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:52:02,867 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 30 treesize of output 31 [2023-12-02 19:52:02,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:52:02,878 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 165 treesize of output 149 [2023-12-02 19:52:02,885 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 28 treesize of output 21 [2023-12-02 19:52:02,891 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 34 treesize of output 20 [2023-12-02 19:52:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:04,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072723954] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:52:04,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1727943924] [2023-12-02 19:52:04,119 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:52:04,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:52:04,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 48 [2023-12-02 19:52:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062755918] [2023-12-02 19:52:04,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:52:04,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 19:52:04,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:52:04,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 19:52:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2259, Unknown=3, NotChecked=0, Total=2450 [2023-12-02 19:52:04,121 INFO L87 Difference]: Start difference. First operand 51308 states and 221167 transitions. Second operand has 50 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:52:22,487 INFO L93 Difference]: Finished difference Result 91545 states and 379548 transitions. [2023-12-02 19:52:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-12-02 19:52:22,488 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 19:52:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:52:23,096 INFO L225 Difference]: With dead ends: 91545 [2023-12-02 19:52:23,096 INFO L226 Difference]: Without dead ends: 91449 [2023-12-02 19:52:23,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4297 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1985, Invalid=14776, Unknown=9, NotChecked=0, Total=16770 [2023-12-02 19:52:23,097 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2265 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 6373 mSolverCounterSat, 126 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 6531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 6373 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:52:23,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 661 Invalid, 6531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [126 Valid, 6373 Invalid, 32 Unknown, 0 Unchecked, 8.9s Time] [2023-12-02 19:52:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91449 states. [2023-12-02 19:52:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91449 to 51147. [2023-12-02 19:52:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51147 states, 51117 states have (on average 4.309857777256099) internal successors, (220307), 51146 states have internal predecessors, (220307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51147 states to 51147 states and 220307 transitions. [2023-12-02 19:52:25,547 INFO L78 Accepts]: Start accepts. Automaton has 51147 states and 220307 transitions. Word has length 34 [2023-12-02 19:52:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:52:25,547 INFO L495 AbstractCegarLoop]: Abstraction has 51147 states and 220307 transitions. [2023-12-02 19:52:25,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 51147 states and 220307 transitions. [2023-12-02 19:52:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 19:52:25,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:52:25,560 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:52:25,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2023-12-02 19:52:25,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:25,761 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:52:25,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:52:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1290900965, now seen corresponding path program 3 times [2023-12-02 19:52:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:52:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169353593] [2023-12-02 19:52:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:52:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:52:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:52:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:26,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:52:26,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169353593] [2023-12-02 19:52:26,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169353593] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:52:26,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103759958] [2023-12-02 19:52:26,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:52:26,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:26,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:52:26,744 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:52:26,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2023-12-02 19:52:26,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:52:26,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:52:26,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 19:52:26,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:52:27,010 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 19:52:27,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 11 [2023-12-02 19:52:27,078 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 19:52:27,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 19:52:27,488 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-12-02 19:52:27,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:27,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 19:52:28,038 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 16 treesize of output 11 [2023-12-02 19:52:28,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:52:28,458 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-12-02 19:52:28,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 19:52:28,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:52:28,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:28,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 19:52:28,748 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 15 treesize of output 7 [2023-12-02 19:52:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:28,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:52:28,828 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2535 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2535) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 4294967296)) is different from false [2023-12-02 19:52:28,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2534) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2535) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 4294967296)) is different from false [2023-12-02 19:52:33,462 INFO L349 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2023-12-02 19:52:33,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2023-12-02 19:52:33,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:52:33,479 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 2193 treesize of output 2145 [2023-12-02 19:52:33,504 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 258 treesize of output 226 [2023-12-02 19:52:33,517 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 111 treesize of output 107 [2023-12-02 19:52:33,528 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 222 treesize of output 206 [2023-12-02 19:52:33,537 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 106 treesize of output 98 [2023-12-02 19:52:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 19:52:34,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103759958] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:52:34,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [91425765] [2023-12-02 19:52:34,588 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:52:34,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:52:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2023-12-02 19:52:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004694755] [2023-12-02 19:52:34,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:52:34,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 19:52:34,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:52:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 19:52:34,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2264, Unknown=16, NotChecked=194, Total=2652 [2023-12-02 19:52:34,590 INFO L87 Difference]: Start difference. First operand 51147 states and 220307 transitions. Second operand has 52 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 51 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:52:42,329 INFO L93 Difference]: Finished difference Result 87303 states and 365488 transitions. [2023-12-02 19:52:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 19:52:42,330 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 51 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 19:52:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:52:42,895 INFO L225 Difference]: With dead ends: 87303 [2023-12-02 19:52:42,895 INFO L226 Difference]: Without dead ends: 87303 [2023-12-02 19:52:42,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=756, Invalid=6017, Unknown=41, NotChecked=326, Total=7140 [2023-12-02 19:52:42,896 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1026 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 4664 mSolverCounterSat, 49 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 5684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 4664 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 954 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:52:42,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 565 Invalid, 5684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 4664 Invalid, 17 Unknown, 954 Unchecked, 4.6s Time] [2023-12-02 19:52:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87303 states. [2023-12-02 19:52:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87303 to 43613. [2023-12-02 19:52:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43613 states, 43583 states have (on average 4.308858958768327) internal successors, (187793), 43612 states have internal predecessors, (187793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43613 states to 43613 states and 187793 transitions. [2023-12-02 19:52:44,597 INFO L78 Accepts]: Start accepts. Automaton has 43613 states and 187793 transitions. Word has length 34 [2023-12-02 19:52:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:52:44,598 INFO L495 AbstractCegarLoop]: Abstraction has 43613 states and 187793 transitions. [2023-12-02 19:52:44,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 51 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 43613 states and 187793 transitions. [2023-12-02 19:52:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:52:44,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:52:44,612 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:52:44,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2023-12-02 19:52:44,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:44,812 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:52:44,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:52:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash 625821672, now seen corresponding path program 2 times [2023-12-02 19:52:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:52:44,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444064340] [2023-12-02 19:52:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:52:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:52:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:52:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:45,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:52:45,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444064340] [2023-12-02 19:52:45,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444064340] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:52:45,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025221614] [2023-12-02 19:52:45,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:52:45,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:45,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:52:45,652 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:52:45,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2023-12-02 19:52:46,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:52:46,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:52:46,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:52:46,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:52:46,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:52:46,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:46,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:52:46,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:46,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:52:46,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:46,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:52:47,051 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 17 treesize of output 9 [2023-12-02 19:52:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:47,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:52:47,250 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2587 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2587) c_~X_0~0.base) (+ c_~X_0~0.offset 12 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2023-12-02 19:52:47,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:52:47,781 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 32 treesize of output 33 [2023-12-02 19:52:47,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:52:47,793 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 619 treesize of output 595 [2023-12-02 19:52:47,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2023-12-02 19:52:47,816 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 134 treesize of output 118 [2023-12-02 19:52:47,825 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 62 treesize of output 54 [2023-12-02 19:52:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:48,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025221614] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:52:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2118455993] [2023-12-02 19:52:48,398 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:52:48,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:52:48,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2023-12-02 19:52:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092771372] [2023-12-02 19:52:48,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:52:48,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 19:52:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:52:48,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 19:52:48,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2144, Unknown=40, NotChecked=94, Total=2450 [2023-12-02 19:52:48,399 INFO L87 Difference]: Start difference. First operand 43613 states and 187793 transitions. Second operand has 50 states, 49 states have (on average 2.0) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:52:52,972 INFO L93 Difference]: Finished difference Result 67592 states and 290509 transitions. [2023-12-02 19:52:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 19:52:52,973 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.0) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-02 19:52:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:52:53,435 INFO L225 Difference]: With dead ends: 67592 [2023-12-02 19:52:53,436 INFO L226 Difference]: Without dead ends: 67592 [2023-12-02 19:52:53,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=440, Invalid=4212, Unknown=44, NotChecked=134, Total=4830 [2023-12-02 19:52:53,436 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 774 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 4122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:52:53,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 578 Invalid, 4122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3779 Invalid, 0 Unknown, 316 Unchecked, 3.0s Time] [2023-12-02 19:52:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67592 states. [2023-12-02 19:52:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67592 to 46198. [2023-12-02 19:52:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46198 states, 46168 states have (on average 4.350155952174666) internal successors, (200838), 46197 states have internal predecessors, (200838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46198 states to 46198 states and 200838 transitions. [2023-12-02 19:52:55,208 INFO L78 Accepts]: Start accepts. Automaton has 46198 states and 200838 transitions. Word has length 35 [2023-12-02 19:52:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:52:55,208 INFO L495 AbstractCegarLoop]: Abstraction has 46198 states and 200838 transitions. [2023-12-02 19:52:55,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.0) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:52:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 46198 states and 200838 transitions. [2023-12-02 19:52:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:52:55,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:52:55,223 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:52:55,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2023-12-02 19:52:55,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:55,423 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:52:55,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:52:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash 625821673, now seen corresponding path program 2 times [2023-12-02 19:52:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:52:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71063486] [2023-12-02 19:52:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:52:55,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:52:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:52:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:56,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:52:56,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71063486] [2023-12-02 19:52:56,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71063486] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:52:56,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389550514] [2023-12-02 19:52:56,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:52:56,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:52:56,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:52:56,576 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:52:56,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2023-12-02 19:52:57,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:52:57,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:52:57,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 19:52:57,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:52:57,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 19:52:57,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:57,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:52:58,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:58,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:52:58,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:52:58,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:52:58,552 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:52:58,552 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 23 treesize of output 10 [2023-12-02 19:52:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:52:58,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:52:59,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:52:59,697 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 33 treesize of output 34 [2023-12-02 19:52:59,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:52:59,710 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 325 treesize of output 309 [2023-12-02 19:52:59,723 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 68 treesize of output 61 [2023-12-02 19:52:59,731 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 136 treesize of output 108 [2023-12-02 19:52:59,741 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 60 treesize of output 46 [2023-12-02 19:53:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:53:01,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389550514] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:53:01,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1551095531] [2023-12-02 19:53:01,127 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:53:01,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:53:01,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 52 [2023-12-02 19:53:01,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894645512] [2023-12-02 19:53:01,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:53:01,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-02 19:53:01,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:53:01,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-02 19:53:01,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2653, Unknown=3, NotChecked=0, Total=2862 [2023-12-02 19:53:01,129 INFO L87 Difference]: Start difference. First operand 46198 states and 200838 transitions. Second operand has 54 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 53 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:53:10,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:53:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:53:40,052 INFO L93 Difference]: Finished difference Result 188365 states and 808068 transitions. [2023-12-02 19:53:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2023-12-02 19:53:40,052 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 53 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-02 19:53:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:53:41,328 INFO L225 Difference]: With dead ends: 188365 [2023-12-02 19:53:41,328 INFO L226 Difference]: Without dead ends: 188341 [2023-12-02 19:53:41,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8118 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=3438, Invalid=24211, Unknown=73, NotChecked=0, Total=27722 [2023-12-02 19:53:41,329 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5225 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 9371 mSolverCounterSat, 295 mSolverCounterUnsat, 489 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5225 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 10155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 9371 IncrementalHoareTripleChecker+Invalid, 489 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:53:41,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5225 Valid, 1643 Invalid, 10155 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [295 Valid, 9371 Invalid, 489 Unknown, 0 Unchecked, 18.4s Time] [2023-12-02 19:53:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188341 states. [2023-12-02 19:53:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188341 to 74526. [2023-12-02 19:53:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74526 states, 74496 states have (on average 4.551089991408935) internal successors, (339038), 74525 states have internal predecessors, (339038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:53:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74526 states to 74526 states and 339038 transitions. [2023-12-02 19:53:45,365 INFO L78 Accepts]: Start accepts. Automaton has 74526 states and 339038 transitions. Word has length 35 [2023-12-02 19:53:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:53:45,365 INFO L495 AbstractCegarLoop]: Abstraction has 74526 states and 339038 transitions. [2023-12-02 19:53:45,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 53 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:53:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 74526 states and 339038 transitions. [2023-12-02 19:53:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:53:45,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:53:45,381 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:53:45,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2023-12-02 19:53:45,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2023-12-02 19:53:45,582 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:53:45,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:53:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash -424754110, now seen corresponding path program 2 times [2023-12-02 19:53:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:53:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542738017] [2023-12-02 19:53:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:53:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:53:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:53:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:53:46,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:53:46,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542738017] [2023-12-02 19:53:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542738017] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:53:46,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215558818] [2023-12-02 19:53:46,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:53:46,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:53:46,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:53:46,571 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:53:46,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2023-12-02 19:53:46,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:53:46,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:53:46,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 19:53:46,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:53:47,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 19:53:47,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:53:47,449 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 22 treesize of output 17 [2023-12-02 19:53:47,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:53:47,666 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 22 treesize of output 17 [2023-12-02 19:53:48,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:53:48,032 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 22 treesize of output 17 [2023-12-02 19:53:48,105 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:53:48,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 25 treesize of output 12 [2023-12-02 19:53:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:53:48,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:53:49,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:53:49,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-02 19:53:49,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:53:49,175 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 181 treesize of output 174 [2023-12-02 19:53:49,184 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 159 treesize of output 145 [2023-12-02 19:53:49,191 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 145 treesize of output 117 [2023-12-02 19:53:49,199 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 61 treesize of output 54 [2023-12-02 19:53:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:53:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215558818] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:53:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [826612556] [2023-12-02 19:53:50,431 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:53:50,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:53:50,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2023-12-02 19:53:50,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604495371] [2023-12-02 19:53:50,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:53:50,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-02 19:53:50,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:53:50,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-02 19:53:50,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2549, Unknown=4, NotChecked=0, Total=2756 [2023-12-02 19:53:50,432 INFO L87 Difference]: Start difference. First operand 74526 states and 339038 transitions. Second operand has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 52 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:54:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:54:32,351 INFO L93 Difference]: Finished difference Result 193182 states and 825439 transitions. [2023-12-02 19:54:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2023-12-02 19:54:32,352 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 52 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-02 19:54:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:54:33,742 INFO L225 Difference]: With dead ends: 193182 [2023-12-02 19:54:33,742 INFO L226 Difference]: Without dead ends: 192978 [2023-12-02 19:54:33,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11779 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=4274, Invalid=32733, Unknown=49, NotChecked=0, Total=37056 [2023-12-02 19:54:33,744 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 4460 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 10965 mSolverCounterSat, 333 mSolverCounterUnsat, 245 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4460 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 11543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 10965 IncrementalHoareTripleChecker+Invalid, 245 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:54:33,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4460 Valid, 1800 Invalid, 11543 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [333 Valid, 10965 Invalid, 245 Unknown, 0 Unchecked, 19.4s Time] [2023-12-02 19:54:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192978 states. [2023-12-02 19:54:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192978 to 100590. [2023-12-02 19:54:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100590 states, 100560 states have (on average 4.565344073190135) internal successors, (459091), 100589 states have internal predecessors, (459091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:54:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100590 states to 100590 states and 459091 transitions. [2023-12-02 19:54:39,162 INFO L78 Accepts]: Start accepts. Automaton has 100590 states and 459091 transitions. Word has length 35 [2023-12-02 19:54:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:54:39,163 INFO L495 AbstractCegarLoop]: Abstraction has 100590 states and 459091 transitions. [2023-12-02 19:54:39,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 52 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:54:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 100590 states and 459091 transitions. [2023-12-02 19:54:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:54:39,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:54:39,195 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:54:39,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2023-12-02 19:54:39,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2023-12-02 19:54:39,396 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:54:39,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:54:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash -424754109, now seen corresponding path program 2 times [2023-12-02 19:54:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:54:39,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112310321] [2023-12-02 19:54:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:54:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:54:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:54:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:54:40,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:54:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112310321] [2023-12-02 19:54:40,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112310321] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:54:40,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356189450] [2023-12-02 19:54:40,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:54:40,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:54:40,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:54:40,324 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:54:40,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2023-12-02 19:54:40,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:54:40,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:54:40,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 19:54:40,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:54:41,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 19:54:41,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:54:41,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:54:41,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:54:41,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:54:42,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:54:42,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:54:42,246 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:54:42,246 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 23 treesize of output 10 [2023-12-02 19:54:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:54:42,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:54:43,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:54:43,553 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 33 treesize of output 34 [2023-12-02 19:54:43,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:54:43,567 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 325 treesize of output 309 [2023-12-02 19:54:43,581 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 143 treesize of output 129 [2023-12-02 19:54:43,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2023-12-02 19:54:43,600 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 122 treesize of output 94 [2023-12-02 19:54:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:54:44,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356189450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:54:44,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [777769725] [2023-12-02 19:54:44,798 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:54:44,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:54:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2023-12-02 19:54:44,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639539414] [2023-12-02 19:54:44,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:54:44,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-02 19:54:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:54:44,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-02 19:54:44,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2550, Unknown=2, NotChecked=0, Total=2756 [2023-12-02 19:54:44,800 INFO L87 Difference]: Start difference. First operand 100590 states and 459091 transitions. Second operand has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 52 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:55:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:55:26,961 INFO L93 Difference]: Finished difference Result 199687 states and 854695 transitions. [2023-12-02 19:55:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2023-12-02 19:55:26,961 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 52 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-02 19:55:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:55:27,951 INFO L225 Difference]: With dead ends: 199687 [2023-12-02 19:55:27,952 INFO L226 Difference]: Without dead ends: 199255 [2023-12-02 19:55:27,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11505 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=4260, Invalid=32383, Unknown=29, NotChecked=0, Total=36672 [2023-12-02 19:55:27,953 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 4632 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 10438 mSolverCounterSat, 344 mSolverCounterUnsat, 190 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4632 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 10972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 10438 IncrementalHoareTripleChecker+Invalid, 190 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:55:27,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4632 Valid, 1654 Invalid, 10972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [344 Valid, 10438 Invalid, 190 Unknown, 0 Unchecked, 19.4s Time] [2023-12-02 19:55:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199255 states. [2023-12-02 19:55:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199255 to 88586. [2023-12-02 19:55:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88586 states, 88556 states have (on average 4.539376213921135) internal successors, (401989), 88585 states have internal predecessors, (401989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:55:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88586 states to 88586 states and 401989 transitions. [2023-12-02 19:55:32,026 INFO L78 Accepts]: Start accepts. Automaton has 88586 states and 401989 transitions. Word has length 35 [2023-12-02 19:55:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:55:32,026 INFO L495 AbstractCegarLoop]: Abstraction has 88586 states and 401989 transitions. [2023-12-02 19:55:32,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 52 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:55:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 88586 states and 401989 transitions. [2023-12-02 19:55:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 19:55:32,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:55:32,048 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:55:32,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2023-12-02 19:55:32,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2023-12-02 19:55:32,249 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:55:32,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:55:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1401724162, now seen corresponding path program 2 times [2023-12-02 19:55:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:55:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115794715] [2023-12-02 19:55:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:55:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:55:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:55:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:55:33,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:55:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115794715] [2023-12-02 19:55:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115794715] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:55:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045979014] [2023-12-02 19:55:33,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:55:33,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:55:33,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:55:33,243 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:55:33,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2023-12-02 19:55:33,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-02 19:55:33,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:55:33,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 19:55:33,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:55:33,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:55:34,012 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-02 19:55:34,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2023-12-02 19:55:34,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:55:34,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:55:34,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:55:34,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:55:34,320 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 19 treesize of output 7 [2023-12-02 19:55:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:55:34,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:55:34,526 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2790 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2790) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296)) is different from false [2023-12-02 19:55:34,533 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2789) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2790) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2023-12-02 19:55:34,545 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2789 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_692| Int) (v_ArrVal_2790 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_692|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2789) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2790) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2023-12-02 19:55:34,859 INFO L349 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2023-12-02 19:55:34,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2023-12-02 19:55:34,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:55:34,868 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 141 treesize of output 129 [2023-12-02 19:55:34,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-12-02 19:55:34,877 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 24 treesize of output 16 [2023-12-02 19:55:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2023-12-02 19:55:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045979014] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:55:35,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335371640] [2023-12-02 19:55:35,264 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:55:35,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:55:35,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2023-12-02 19:55:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254354989] [2023-12-02 19:55:35,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:55:35,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 19:55:35,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:55:35,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 19:55:35,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2119, Unknown=4, NotChecked=282, Total=2550 [2023-12-02 19:55:35,265 INFO L87 Difference]: Start difference. First operand 88586 states and 401989 transitions. Second operand has 51 states, 50 states have (on average 2.1) internal successors, (105), 50 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:55:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:55:39,243 INFO L93 Difference]: Finished difference Result 106096 states and 475460 transitions. [2023-12-02 19:55:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 19:55:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.1) internal successors, (105), 50 states have internal predecessors, (105), 0 states have call successors, (0), 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 36 [2023-12-02 19:55:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:55:39,790 INFO L225 Difference]: With dead ends: 106096 [2023-12-02 19:55:39,791 INFO L226 Difference]: Without dead ends: 106096 [2023-12-02 19:55:39,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=406, Invalid=4158, Unknown=4, NotChecked=402, Total=4970 [2023-12-02 19:55:39,791 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 587 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 2984 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 643 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:55:39,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 317 Invalid, 3637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2984 Invalid, 0 Unknown, 643 Unchecked, 1.9s Time] [2023-12-02 19:55:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106096 states. [2023-12-02 19:55:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106096 to 87660. [2023-12-02 19:55:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87660 states, 87630 states have (on average 4.5337555631633) internal successors, (397293), 87659 states have internal predecessors, (397293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:55:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87660 states to 87660 states and 397293 transitions. [2023-12-02 19:55:43,164 INFO L78 Accepts]: Start accepts. Automaton has 87660 states and 397293 transitions. Word has length 36 [2023-12-02 19:55:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:55:43,164 INFO L495 AbstractCegarLoop]: Abstraction has 87660 states and 397293 transitions. [2023-12-02 19:55:43,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.1) internal successors, (105), 50 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:55:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 87660 states and 397293 transitions. [2023-12-02 19:55:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 19:55:43,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:55:43,189 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:55:43,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2023-12-02 19:55:43,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:55:43,389 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:55:43,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:55:43,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1370999221, now seen corresponding path program 2 times [2023-12-02 19:55:43,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:55:43,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855964670] [2023-12-02 19:55:43,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:55:43,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:55:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:55:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:55:44,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:55:44,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855964670] [2023-12-02 19:55:44,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855964670] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:55:44,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445604888] [2023-12-02 19:55:44,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:55:44,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:55:44,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:55:44,169 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:55:44,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2023-12-02 19:55:44,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:55:44,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:55:44,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:55:44,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:55:45,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:55:45,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:55:45,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:55:45,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:55:45,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:55:45,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:55:45,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 19:55:45,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 17 treesize of output 9 [2023-12-02 19:55:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:55:45,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:55:45,879 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2842 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2842) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) is different from false [2023-12-02 19:55:46,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:55:46,299 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 32 treesize of output 33 [2023-12-02 19:55:46,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:55:46,310 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 311 treesize of output 299 [2023-12-02 19:55:46,323 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 138 treesize of output 130 [2023-12-02 19:55:46,331 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 130 treesize of output 114 [2023-12-02 19:55:46,340 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 58 treesize of output 54 [2023-12-02 19:55:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:55:46,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445604888] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:55:46,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [812672584] [2023-12-02 19:55:46,978 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:55:46,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:55:46,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2023-12-02 19:55:46,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428121038] [2023-12-02 19:55:46,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:55:46,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 19:55:46,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:55:46,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 19:55:46,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2062, Unknown=22, NotChecked=92, Total=2352 [2023-12-02 19:55:46,980 INFO L87 Difference]: Start difference. First operand 87660 states and 397293 transitions. Second operand has 49 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:55:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:55:52,669 INFO L93 Difference]: Finished difference Result 119562 states and 536248 transitions. [2023-12-02 19:55:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 19:55:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 0 states have call successors, (0), 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 36 [2023-12-02 19:55:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:55:53,320 INFO L225 Difference]: With dead ends: 119562 [2023-12-02 19:55:53,320 INFO L226 Difference]: Without dead ends: 119562 [2023-12-02 19:55:53,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=610, Invalid=4922, Unknown=22, NotChecked=146, Total=5700 [2023-12-02 19:55:53,321 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 735 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 4409 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 4789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:55:53,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 637 Invalid, 4789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4409 Invalid, 0 Unknown, 350 Unchecked, 3.1s Time] [2023-12-02 19:55:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119562 states. [2023-12-02 19:55:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119562 to 90580. [2023-12-02 19:55:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90580 states, 90550 states have (on average 4.53055770292656) internal successors, (410242), 90579 states have internal predecessors, (410242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:55:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90580 states to 90580 states and 410242 transitions. [2023-12-02 19:55:57,039 INFO L78 Accepts]: Start accepts. Automaton has 90580 states and 410242 transitions. Word has length 36 [2023-12-02 19:55:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:55:57,039 INFO L495 AbstractCegarLoop]: Abstraction has 90580 states and 410242 transitions. [2023-12-02 19:55:57,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:55:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 90580 states and 410242 transitions. [2023-12-02 19:55:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 19:55:57,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:55:57,063 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:55:57,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2023-12-02 19:55:57,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:55:57,264 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:55:57,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:55:57,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1370999220, now seen corresponding path program 2 times [2023-12-02 19:55:57,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:55:57,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451815334] [2023-12-02 19:55:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:55:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:55:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:55:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:55:57,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:55:57,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451815334] [2023-12-02 19:55:57,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451815334] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:55:57,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116813899] [2023-12-02 19:55:57,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:55:57,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:55:58,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:55:58,000 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:55:58,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2023-12-02 19:55:58,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:55:58,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:55:58,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 19:55:58,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:55:59,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 19:55:59,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:55:59,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:55:59,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:55:59,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:55:59,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:55:59,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:55:59,955 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:55:59,956 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 23 treesize of output 10 [2023-12-02 19:55:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:55:59,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:56:01,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:56:01,010 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 33 treesize of output 34 [2023-12-02 19:56:01,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:56:01,026 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 1297 treesize of output 1227 [2023-12-02 19:56:01,044 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 68 treesize of output 61 [2023-12-02 19:56:01,053 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 136 treesize of output 108 [2023-12-02 19:56:01,064 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 60 treesize of output 46 [2023-12-02 19:56:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:56:02,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116813899] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:56:02,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [910525241] [2023-12-02 19:56:02,325 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:56:02,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:56:02,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2023-12-02 19:56:02,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446346485] [2023-12-02 19:56:02,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:56:02,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-02 19:56:02,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:56:02,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-02 19:56:02,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2540, Unknown=6, NotChecked=0, Total=2756 [2023-12-02 19:56:02,327 INFO L87 Difference]: Start difference. First operand 90580 states and 410242 transitions. Second operand has 53 states, 52 states have (on average 2.019230769230769) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:56:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:56:25,831 INFO L93 Difference]: Finished difference Result 192432 states and 855355 transitions. [2023-12-02 19:56:25,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-12-02 19:56:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.019230769230769) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 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 36 [2023-12-02 19:56:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:56:26,919 INFO L225 Difference]: With dead ends: 192432 [2023-12-02 19:56:26,919 INFO L226 Difference]: Without dead ends: 192432 [2023-12-02 19:56:26,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5581 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2396, Invalid=17904, Unknown=6, NotChecked=0, Total=20306 [2023-12-02 19:56:26,920 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 3293 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 10102 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3293 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 10291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 10102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:56:26,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3293 Valid, 1143 Invalid, 10291 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [189 Valid, 10102 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2023-12-02 19:56:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192432 states. [2023-12-02 19:56:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192432 to 92046. [2023-12-02 19:56:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92046 states, 92016 states have (on average 4.493022952529995) internal successors, (413430), 92045 states have internal predecessors, (413430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:56:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92046 states to 92046 states and 413430 transitions. [2023-12-02 19:56:31,589 INFO L78 Accepts]: Start accepts. Automaton has 92046 states and 413430 transitions. Word has length 36 [2023-12-02 19:56:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:56:31,589 INFO L495 AbstractCegarLoop]: Abstraction has 92046 states and 413430 transitions. [2023-12-02 19:56:31,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.019230769230769) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:56:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 92046 states and 413430 transitions. [2023-12-02 19:56:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 19:56:31,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:56:31,615 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:56:31,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2023-12-02 19:56:31,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:56:31,816 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:56:31,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:56:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2074378055, now seen corresponding path program 2 times [2023-12-02 19:56:31,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:56:31,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234536234] [2023-12-02 19:56:31,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:56:31,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:56:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:56:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:56:32,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:56:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234536234] [2023-12-02 19:56:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234536234] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:56:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990558840] [2023-12-02 19:56:32,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:56:32,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:56:32,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:56:32,716 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:56:32,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2023-12-02 19:56:33,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:56:33,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:56:33,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 19:56:33,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:56:33,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 19:56:34,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:56:34,136 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 22 treesize of output 17 [2023-12-02 19:56:34,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:56:34,443 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 22 treesize of output 17 [2023-12-02 19:56:34,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:56:34,550 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 22 treesize of output 17 [2023-12-02 19:56:34,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:56:34,941 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 22 treesize of output 17 [2023-12-02 19:56:35,033 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:56:35,034 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 25 treesize of output 12 [2023-12-02 19:56:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:56:35,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:56:36,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:56:36,411 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 38 treesize of output 39 [2023-12-02 19:56:36,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:56:36,427 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 711 treesize of output 695 [2023-12-02 19:56:36,457 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 170 treesize of output 163 [2023-12-02 19:56:36,469 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 328 treesize of output 272 [2023-12-02 19:56:36,483 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 272 treesize of output 258 [2023-12-02 19:56:36,495 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 258 treesize of output 230 [2023-12-02 19:56:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:56:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990558840] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:56:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1747552024] [2023-12-02 19:56:38,272 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:56:38,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:56:38,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 54 [2023-12-02 19:56:38,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066121571] [2023-12-02 19:56:38,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:56:38,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-02 19:56:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:56:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-02 19:56:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2856, Unknown=4, NotChecked=0, Total=3080 [2023-12-02 19:56:38,273 INFO L87 Difference]: Start difference. First operand 92046 states and 413430 transitions. Second operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:57:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:57:20,954 INFO L93 Difference]: Finished difference Result 257235 states and 1073495 transitions. [2023-12-02 19:57:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-12-02 19:57:20,955 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 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 36 [2023-12-02 19:57:20,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:57:22,298 INFO L225 Difference]: With dead ends: 257235 [2023-12-02 19:57:22,298 INFO L226 Difference]: Without dead ends: 257067 [2023-12-02 19:57:22,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6817 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=2709, Invalid=22392, Unknown=21, NotChecked=0, Total=25122 [2023-12-02 19:57:22,300 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 10191 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 11726 mSolverCounterSat, 632 mSolverCounterUnsat, 124 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10191 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 12482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 11726 IncrementalHoareTripleChecker+Invalid, 124 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:57:22,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10191 Valid, 2558 Invalid, 12482 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [632 Valid, 11726 Invalid, 124 Unknown, 0 Unchecked, 20.3s Time] [2023-12-02 19:57:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257067 states. [2023-12-02 19:57:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257067 to 81828. [2023-12-02 19:57:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81828 states, 81798 states have (on average 4.379300227389423) internal successors, (358218), 81827 states have internal predecessors, (358218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:57:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81828 states to 81828 states and 358218 transitions. [2023-12-02 19:57:27,437 INFO L78 Accepts]: Start accepts. Automaton has 81828 states and 358218 transitions. Word has length 36 [2023-12-02 19:57:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:57:27,438 INFO L495 AbstractCegarLoop]: Abstraction has 81828 states and 358218 transitions. [2023-12-02 19:57:27,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:57:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 81828 states and 358218 transitions. [2023-12-02 19:57:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 19:57:27,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:57:27,460 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:57:27,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2023-12-02 19:57:27,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:57:27,661 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2023-12-02 19:57:27,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:57:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2074378054, now seen corresponding path program 2 times [2023-12-02 19:57:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:57:27,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115594729] [2023-12-02 19:57:27,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:57:27,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:57:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:57:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:57:28,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:57:28,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115594729] [2023-12-02 19:57:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115594729] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:57:28,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172400168] [2023-12-02 19:57:28,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:57:28,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:57:28,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:57:28,787 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:57:28,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5589b-b111-4ab5-9fed-8ecc302aa6eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2023-12-02 19:57:29,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:57:29,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:57:29,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:57:29,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:57:29,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 19:57:29,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:57:29,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:57:30,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:57:30,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:57:30,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:57:30,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:57:30,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:57:30,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 19:57:30,446 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:57:30,446 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 23 treesize of output 10 [2023-12-02 19:57:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:57:30,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:57:31,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:57:31,596 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 36 treesize of output 37 [2023-12-02 19:57:31,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:57:31,612 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 645 treesize of output 629 [2023-12-02 19:57:31,631 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 303 treesize of output 247 [2023-12-02 19:57:31,641 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 247 treesize of output 233 [2023-12-02 19:57:31,652 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 233 treesize of output 205 [2023-12-02 19:57:31,664 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 105 treesize of output 98 [2023-12-02 19:57:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:57:33,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172400168] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:57:33,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [719290675] [2023-12-02 19:57:33,472 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 19:57:33,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:57:33,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 54 [2023-12-02 19:57:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123329764] [2023-12-02 19:57:33,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:57:33,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-02 19:57:33,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:57:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-02 19:57:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2857, Unknown=4, NotChecked=0, Total=3080 [2023-12-02 19:57:33,474 INFO L87 Difference]: Start difference. First operand 81828 states and 358218 transitions. Second operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)