./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/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_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/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_526debc2-ac8c-4444-9853-e108a5a8a1c9/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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:26:22,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:26:22,335 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 13:26:22,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:26:22,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:26:22,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:26:22,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:26:22,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:26:22,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:26:22,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:26:22,370 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:26:22,371 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:26:22,371 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:26:22,372 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:26:22,373 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:26:22,373 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:26:22,374 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:26:22,374 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:26:22,375 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:26:22,375 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:26:22,376 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:26:22,380 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:26:22,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:26:22,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:26:22,381 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:26:22,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:26:22,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:26:22,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:26:22,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:26:22,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:26:22,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:26:22,384 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 13:26:22,384 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:26:22,384 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:26:22,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:26:22,385 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:26:22,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:26:22,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:26:22,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:26:22,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:26:22,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:26:22,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:26:22,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:26:22,387 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:26:22,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:26:22,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:26:22,387 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:26:22,387 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:26:22,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:26:22,388 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_526debc2-ac8c-4444-9853-e108a5a8a1c9/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_526debc2-ac8c-4444-9853-e108a5a8a1c9/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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2023-12-02 13:26:22,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:26:22,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:26:22,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:26:22,632 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:26:22,632 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:26:22,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 13:26:25,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:26:25,639 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:26:25,640 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 13:26:25,657 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/data/01392ac11/cea23e40ba9d4b8197dfb76e71d3998f/FLAG9c3870abc [2023-12-02 13:26:25,672 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/data/01392ac11/cea23e40ba9d4b8197dfb76e71d3998f [2023-12-02 13:26:25,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:26:25,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:26:25,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:26:25,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:26:25,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:26:25,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:26:25" (1/1) ... [2023-12-02 13:26:25,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56bb7be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:25, skipping insertion in model container [2023-12-02 13:26:25,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:26:25" (1/1) ... [2023-12-02 13:26:25,740 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:26:26,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:26:26,181 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:26:26,243 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:26:26,320 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:26:26,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26 WrapperNode [2023-12-02 13:26:26,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:26:26,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:26:26,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:26:26,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:26:26,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,386 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 226 [2023-12-02 13:26:26,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:26:26,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:26:26,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:26:26,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:26:26,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:26:26,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:26:26,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:26:26,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:26:26,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (1/1) ... [2023-12-02 13:26:26,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:26:26,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:26:26,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:26:26,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:26:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-02 13:26:26,500 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-02 13:26:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-02 13:26:26,500 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-02 13:26:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:26:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:26:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 13:26:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 13:26:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 13:26:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 13:26:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:26:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:26:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:26:26,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:26:26,504 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 13:26:26,640 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:26:26,642 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:26:26,981 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:26:27,291 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:26:27,291 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 13:26:27,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:26:27 BoogieIcfgContainer [2023-12-02 13:26:27,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:26:27,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:26:27,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:26:27,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:26:27,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:26:25" (1/3) ... [2023-12-02 13:26:27,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c84b770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:26:27, skipping insertion in model container [2023-12-02 13:26:27,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:26:26" (2/3) ... [2023-12-02 13:26:27,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c84b770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:26:27, skipping insertion in model container [2023-12-02 13:26:27,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:26:27" (3/3) ... [2023-12-02 13:26:27,301 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-12-02 13:26:27,311 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 13:26:27,322 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:26:27,322 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-12-02 13:26:27,322 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 13:26:27,391 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 13:26:27,422 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 62 transitions, 138 flow [2023-12-02 13:26:27,512 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1126 states, 1078 states have (on average 2.7764378478664193) internal successors, (2993), 1125 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:27,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:26:27,539 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;@5c2f15e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:26:27,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-12-02 13:26:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 1126 states, 1078 states have (on average 2.7764378478664193) internal successors, (2993), 1125 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:26:27,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:27,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:27,555 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:27,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1388236445, now seen corresponding path program 1 times [2023-12-02 13:26:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750892103] [2023-12-02 13:26:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:28,235 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 13:26:28,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750892103] [2023-12-02 13:26:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750892103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:28,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:28,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:26:28,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756150214] [2023-12-02 13:26:28,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:28,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:26:28,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:28,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:26:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:26:28,284 INFO L87 Difference]: Start difference. First operand has 1126 states, 1078 states have (on average 2.7764378478664193) internal successors, (2993), 1125 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:28,527 INFO L93 Difference]: Finished difference Result 1230 states and 3261 transitions. [2023-12-02 13:26:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:26:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 13:26:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:28,558 INFO L225 Difference]: With dead ends: 1230 [2023-12-02 13:26:28,558 INFO L226 Difference]: Without dead ends: 1230 [2023-12-02 13:26:28,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:26:28,564 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:28,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 89 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:26:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2023-12-02 13:26:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1227. [2023-12-02 13:26:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1179 states have (on average 2.761662425784563) internal successors, (3256), 1226 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 3256 transitions. [2023-12-02 13:26:28,676 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 3256 transitions. Word has length 8 [2023-12-02 13:26:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:28,677 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 3256 transitions. [2023-12-02 13:26:28,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 3256 transitions. [2023-12-02 13:26:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 13:26:28,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:28,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:28,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:26:28,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:28,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1089532431, now seen corresponding path program 1 times [2023-12-02 13:26:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:28,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985445202] [2023-12-02 13:26:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:28,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:29,046 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 13:26:29,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985445202] [2023-12-02 13:26:29,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985445202] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:29,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:26:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89985082] [2023-12-02 13:26:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:29,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:26:29,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:29,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:26:29,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:26:29,051 INFO L87 Difference]: Start difference. First operand 1227 states and 3256 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:29,297 INFO L93 Difference]: Finished difference Result 1712 states and 4510 transitions. [2023-12-02 13:26:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:26:29,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 13:26:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:29,316 INFO L225 Difference]: With dead ends: 1712 [2023-12-02 13:26:29,316 INFO L226 Difference]: Without dead ends: 1712 [2023-12-02 13:26:29,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:26:29,318 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 108 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:29,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 87 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:26:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2023-12-02 13:26:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1376. [2023-12-02 13:26:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1328 states have (on average 2.7808734939759034) internal successors, (3693), 1375 states have internal predecessors, (3693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 3693 transitions. [2023-12-02 13:26:29,418 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 3693 transitions. Word has length 9 [2023-12-02 13:26:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:29,418 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 3693 transitions. [2023-12-02 13:26:29,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 3693 transitions. [2023-12-02 13:26:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 13:26:29,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:29,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:29,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:26:29,421 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:29,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:29,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1691643503, now seen corresponding path program 1 times [2023-12-02 13:26:29,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:29,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973389603] [2023-12-02 13:26:29,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:29,493 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 13:26:29,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:29,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973389603] [2023-12-02 13:26:29,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973389603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:29,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:29,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:26:29,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583785267] [2023-12-02 13:26:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:29,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:26:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:26:29,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:26:29,496 INFO L87 Difference]: Start difference. First operand 1376 states and 3693 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:29,571 INFO L93 Difference]: Finished difference Result 566 states and 1315 transitions. [2023-12-02 13:26:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:26:29,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 13:26:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:29,576 INFO L225 Difference]: With dead ends: 566 [2023-12-02 13:26:29,576 INFO L226 Difference]: Without dead ends: 528 [2023-12-02 13:26:29,576 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 13:26:29,578 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:29,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 33 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:26:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-02 13:26:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2023-12-02 13:26:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 516 states have (on average 2.393410852713178) internal successors, (1235), 527 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1235 transitions. [2023-12-02 13:26:29,600 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1235 transitions. Word has length 11 [2023-12-02 13:26:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:29,601 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 1235 transitions. [2023-12-02 13:26:29,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1235 transitions. [2023-12-02 13:26:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 13:26:29,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:29,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:29,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 13:26:29,603 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:29,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash -711202270, now seen corresponding path program 1 times [2023-12-02 13:26:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:29,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64981728] [2023-12-02 13:26:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:29,872 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 13:26:29,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:29,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64981728] [2023-12-02 13:26:29,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64981728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:29,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:29,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:26:29,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576601316] [2023-12-02 13:26:29,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:29,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:26:29,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:26:29,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:26:29,875 INFO L87 Difference]: Start difference. First operand 528 states and 1235 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:30,069 INFO L93 Difference]: Finished difference Result 564 states and 1317 transitions. [2023-12-02 13:26:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:26:30,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 13:26:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:30,074 INFO L225 Difference]: With dead ends: 564 [2023-12-02 13:26:30,074 INFO L226 Difference]: Without dead ends: 564 [2023-12-02 13:26:30,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:26:30,076 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:30,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 89 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:26:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2023-12-02 13:26:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 561. [2023-12-02 13:26:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 549 states have (on average 2.389799635701275) internal successors, (1312), 560 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1312 transitions. [2023-12-02 13:26:30,100 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1312 transitions. Word has length 11 [2023-12-02 13:26:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:30,100 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 1312 transitions. [2023-12-02 13:26:30,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1312 transitions. [2023-12-02 13:26:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:26:30,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:30,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:30,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 13:26:30,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:30,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1193433590, now seen corresponding path program 1 times [2023-12-02 13:26:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:30,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395286937] [2023-12-02 13:26:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:30,389 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 13:26:30,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:30,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395286937] [2023-12-02 13:26:30,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395286937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:30,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:30,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:26:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482945833] [2023-12-02 13:26:30,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:30,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:26:30,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:30,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:26:30,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:26:30,392 INFO L87 Difference]: Start difference. First operand 561 states and 1312 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:30,584 INFO L93 Difference]: Finished difference Result 762 states and 1775 transitions. [2023-12-02 13:26:30,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:26:30,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 13:26:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:30,591 INFO L225 Difference]: With dead ends: 762 [2023-12-02 13:26:30,591 INFO L226 Difference]: Without dead ends: 762 [2023-12-02 13:26:30,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:26:30,593 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 95 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:30,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 91 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:26:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-12-02 13:26:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 606. [2023-12-02 13:26:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 594 states have (on average 2.410774410774411) internal successors, (1432), 605 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1432 transitions. [2023-12-02 13:26:30,620 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1432 transitions. Word has length 12 [2023-12-02 13:26:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:30,620 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1432 transitions. [2023-12-02 13:26:30,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1432 transitions. [2023-12-02 13:26:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:26:30,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:30,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:30,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 13:26:30,622 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:30,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash -572463128, now seen corresponding path program 2 times [2023-12-02 13:26:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:30,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845008159] [2023-12-02 13:26:30,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:30,889 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 13:26:30,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845008159] [2023-12-02 13:26:30,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845008159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:30,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:30,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:26:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060153427] [2023-12-02 13:26:30,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:30,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:26:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:30,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:26:30,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:26:30,892 INFO L87 Difference]: Start difference. First operand 606 states and 1432 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:31,097 INFO L93 Difference]: Finished difference Result 777 states and 1825 transitions. [2023-12-02 13:26:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:26:31,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 13:26:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:31,105 INFO L225 Difference]: With dead ends: 777 [2023-12-02 13:26:31,105 INFO L226 Difference]: Without dead ends: 777 [2023-12-02 13:26:31,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:26:31,107 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 72 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:31,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 90 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:26:31,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2023-12-02 13:26:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 576. [2023-12-02 13:26:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 2.4148936170212765) internal successors, (1362), 575 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1362 transitions. [2023-12-02 13:26:31,133 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1362 transitions. Word has length 12 [2023-12-02 13:26:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:31,134 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 1362 transitions. [2023-12-02 13:26:31,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1362 transitions. [2023-12-02 13:26:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:26:31,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:31,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:31,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 13:26:31,135 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:31,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -572432247, now seen corresponding path program 1 times [2023-12-02 13:26:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050378133] [2023-12-02 13:26:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:31,198 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 13:26:31,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:31,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050378133] [2023-12-02 13:26:31,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050378133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:31,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:31,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:26:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540343501] [2023-12-02 13:26:31,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:31,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:26:31,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:31,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:26:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:26:31,201 INFO L87 Difference]: Start difference. First operand 576 states and 1362 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:31,327 INFO L93 Difference]: Finished difference Result 624 states and 1463 transitions. [2023-12-02 13:26:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:26:31,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 13:26:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:31,333 INFO L225 Difference]: With dead ends: 624 [2023-12-02 13:26:31,333 INFO L226 Difference]: Without dead ends: 624 [2023-12-02 13:26:31,333 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 13:26:31,334 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:31,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 68 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:26:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-12-02 13:26:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2023-12-02 13:26:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 612 states have (on average 2.3905228758169934) internal successors, (1463), 623 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1463 transitions. [2023-12-02 13:26:31,359 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1463 transitions. Word has length 12 [2023-12-02 13:26:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:31,360 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 1463 transitions. [2023-12-02 13:26:31,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1463 transitions. [2023-12-02 13:26:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 13:26:31,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:31,361 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:31,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 13:26:31,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:31,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:31,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1986709928, now seen corresponding path program 1 times [2023-12-02 13:26:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:31,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875434764] [2023-12-02 13:26:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:31,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:31,637 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 13:26:31,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875434764] [2023-12-02 13:26:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875434764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:26:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174518249] [2023-12-02 13:26:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:31,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:26:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:26:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:26:31,640 INFO L87 Difference]: Start difference. First operand 624 states and 1463 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:31,772 INFO L93 Difference]: Finished difference Result 639 states and 1497 transitions. [2023-12-02 13:26:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:26:31,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 13:26:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:31,777 INFO L225 Difference]: With dead ends: 639 [2023-12-02 13:26:31,777 INFO L226 Difference]: Without dead ends: 639 [2023-12-02 13:26:31,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:26:31,778 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:31,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:26:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-12-02 13:26:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2023-12-02 13:26:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 627 states have (on average 2.38755980861244) internal successors, (1497), 638 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1497 transitions. [2023-12-02 13:26:31,796 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1497 transitions. Word has length 15 [2023-12-02 13:26:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:31,797 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 1497 transitions. [2023-12-02 13:26:31,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1497 transitions. [2023-12-02 13:26:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 13:26:31,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:31,798 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:31,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 13:26:31,798 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:31,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash -590532740, now seen corresponding path program 1 times [2023-12-02 13:26:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948474191] [2023-12-02 13:26:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:32,047 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 13:26:32,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:32,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948474191] [2023-12-02 13:26:32,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948474191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:32,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:32,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:26:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525770699] [2023-12-02 13:26:32,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:32,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:26:32,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:32,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:26:32,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:26:32,049 INFO L87 Difference]: Start difference. First operand 639 states and 1497 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 13:26:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:32,223 INFO L93 Difference]: Finished difference Result 745 states and 1744 transitions. [2023-12-02 13:26:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:26:32,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 13:26:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:32,229 INFO L225 Difference]: With dead ends: 745 [2023-12-02 13:26:32,229 INFO L226 Difference]: Without dead ends: 745 [2023-12-02 13:26:32,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:26:32,230 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:32,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:26:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-12-02 13:26:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 669. [2023-12-02 13:26:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 657 states have (on average 2.385083713850837) internal successors, (1567), 668 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1567 transitions. [2023-12-02 13:26:32,249 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1567 transitions. Word has length 16 [2023-12-02 13:26:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:32,250 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 1567 transitions. [2023-12-02 13:26:32,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 13:26:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1567 transitions. [2023-12-02 13:26:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 13:26:32,251 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:32,251 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:32,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 13:26:32,251 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:32,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1150868502, now seen corresponding path program 2 times [2023-12-02 13:26:32,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:32,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803312942] [2023-12-02 13:26:32,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:32,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:32,526 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 13:26:32,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:32,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803312942] [2023-12-02 13:26:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803312942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:26:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:26:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:26:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75311157] [2023-12-02 13:26:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:26:32,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:26:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:26:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:26:32,528 INFO L87 Difference]: Start difference. First operand 669 states and 1567 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 13:26:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:32,727 INFO L93 Difference]: Finished difference Result 669 states and 1552 transitions. [2023-12-02 13:26:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:26:32,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 13:26:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:32,733 INFO L225 Difference]: With dead ends: 669 [2023-12-02 13:26:32,733 INFO L226 Difference]: Without dead ends: 669 [2023-12-02 13:26:32,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:26:32,734 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:32,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:26:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2023-12-02 13:26:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 624. [2023-12-02 13:26:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 612 states have (on average 2.3643790849673203) internal successors, (1447), 623 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1447 transitions. [2023-12-02 13:26:32,759 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1447 transitions. Word has length 16 [2023-12-02 13:26:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:32,759 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 1447 transitions. [2023-12-02 13:26:32,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 13:26:32,760 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1447 transitions. [2023-12-02 13:26:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 13:26:32,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:32,760 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:32,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 13:26:32,761 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:32,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash -429872346, now seen corresponding path program 1 times [2023-12-02 13:26:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:32,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058547186] [2023-12-02 13:26:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:33,280 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 13:26:33,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058547186] [2023-12-02 13:26:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058547186] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:26:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460968376] [2023-12-02 13:26:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:33,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:26:33,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:26:33,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:26:33,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:26:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:33,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 13:26:33,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:26:33,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 15 treesize of output 1 [2023-12-02 13:26:33,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 13:26:33,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:26:33,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 18 treesize of output 13 [2023-12-02 13:26:33,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2023-12-02 13:26:33,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-12-02 13:26:33,922 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 13:26:33,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:26:34,112 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_272 Int)) (or (< (+ v_ArrVal_272 2147483648) 0) (< 0 (+ (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_269)) |c_~#stored_elements~0.base| v_ArrVal_271) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_272)) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2023-12-02 13:26:34,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:26:34,167 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 60 treesize of output 51 [2023-12-02 13:26:34,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:26:34,181 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 65 treesize of output 67 [2023-12-02 13:26:34,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-12-02 13:26:34,205 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 9 treesize of output 5 [2023-12-02 13:26:34,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:26:34,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2023-12-02 13:26:36,417 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 13:26:36,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460968376] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:26:36,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [229650526] [2023-12-02 13:26:36,424 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 13:26:36,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:26:36,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2023-12-02 13:26:36,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213867277] [2023-12-02 13:26:36,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:26:36,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 13:26:36,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 13:26:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=293, Unknown=5, NotChecked=36, Total=420 [2023-12-02 13:26:36,429 INFO L87 Difference]: Start difference. First operand 624 states and 1447 transitions. Second operand has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 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 13:26:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:37,285 INFO L93 Difference]: Finished difference Result 1338 states and 3122 transitions. [2023-12-02 13:26:37,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:26:37,285 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 13:26:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:37,294 INFO L225 Difference]: With dead ends: 1338 [2023-12-02 13:26:37,295 INFO L226 Difference]: Without dead ends: 1338 [2023-12-02 13:26:37,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=177, Invalid=524, Unknown=5, NotChecked=50, Total=756 [2023-12-02 13:26:37,296 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 313 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:37,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 276 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 574 Invalid, 0 Unknown, 195 Unchecked, 0.6s Time] [2023-12-02 13:26:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2023-12-02 13:26:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 833. [2023-12-02 13:26:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 821 states have (on average 2.459196102314251) internal successors, (2019), 832 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2019 transitions. [2023-12-02 13:26:37,329 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2019 transitions. Word has length 17 [2023-12-02 13:26:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:37,329 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 2019 transitions. [2023-12-02 13:26:37,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 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 13:26:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2019 transitions. [2023-12-02 13:26:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 13:26:37,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:37,331 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:37,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:26:37,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:26:37,532 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:37,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2118827658, now seen corresponding path program 1 times [2023-12-02 13:26:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:37,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553882696] [2023-12-02 13:26:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:37,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:38,368 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 13:26:38,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:38,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553882696] [2023-12-02 13:26:38,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553882696] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:26:38,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515512045] [2023-12-02 13:26:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:38,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:26:38,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:26:38,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:26:38,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:26:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:38,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 13:26:38,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:26:38,543 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:26:38,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 13:26:38,748 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 13:26:38,821 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 13:26:38,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 13:26:38,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:26:38,932 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 13:26:38,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2023-12-02 13:26:38,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-12-02 13:26:39,027 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 13:26:39,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:26:39,179 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 Int) (v_ArrVal_334 (Array Int Int)) (v_ArrVal_336 Int)) (or (< (+ v_ArrVal_336 2147483648) 0) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_332)) |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_336)) (+ 1608 |c_~#queue~0.offset|)))))) is different from false [2023-12-02 13:26:39,206 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 Int) (v_ArrVal_331 (Array Int Int)) (v_ArrVal_334 (Array Int Int)) (v_ArrVal_336 Int)) (or (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_331))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_332))) |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_336)) (+ 1608 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_336 2147483648) 0))) is different from false [2023-12-02 13:26:39,274 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2023-12-02 13:26:39,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2582 treesize of output 2260 [2023-12-02 13:26:39,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:26:39,314 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 263 treesize of output 255 [2023-12-02 13:26:39,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 367 [2023-12-02 13:26:39,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 114 [2023-12-02 13:26:39,439 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 13 treesize of output 1 [2023-12-02 13:26:39,493 INFO L349 Elim1Store]: treesize reduction 34, result has 54.7 percent of original size [2023-12-02 13:26:39,494 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 262 treesize of output 281 [2023-12-02 13:26:40,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:26:40,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 57 [2023-12-02 13:26:40,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:26:40,989 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 516 treesize of output 458 [2023-12-02 13:26:41,277 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 13:26:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515512045] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:26:41,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [923646634] [2023-12-02 13:26:41,278 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 13:26:41,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:26:41,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-12-02 13:26:41,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276595469] [2023-12-02 13:26:41,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:26:41,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 13:26:41,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:41,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 13:26:41,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=407, Unknown=4, NotChecked=86, Total=600 [2023-12-02 13:26:41,280 INFO L87 Difference]: Start difference. First operand 833 states and 2019 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:42,283 INFO L93 Difference]: Finished difference Result 1126 states and 2689 transitions. [2023-12-02 13:26:42,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:26:42,284 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 13:26:42,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:42,292 INFO L225 Difference]: With dead ends: 1126 [2023-12-02 13:26:42,292 INFO L226 Difference]: Without dead ends: 1126 [2023-12-02 13:26:42,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=748, Unknown=4, NotChecked=122, Total=1122 [2023-12-02 13:26:42,293 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 562 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:42,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 273 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 580 Invalid, 0 Unknown, 358 Unchecked, 0.6s Time] [2023-12-02 13:26:42,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2023-12-02 13:26:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 608. [2023-12-02 13:26:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 597 states have (on average 2.3618090452261304) internal successors, (1410), 607 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1410 transitions. [2023-12-02 13:26:42,311 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1410 transitions. Word has length 18 [2023-12-02 13:26:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:42,312 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 1410 transitions. [2023-12-02 13:26:42,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1410 transitions. [2023-12-02 13:26:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 13:26:42,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:42,313 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:42,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 13:26:42,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:26:42,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:42,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash -441140196, now seen corresponding path program 1 times [2023-12-02 13:26:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:42,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788717060] [2023-12-02 13:26:42,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:43,008 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 13:26:43,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788717060] [2023-12-02 13:26:43,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788717060] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:26:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493817387] [2023-12-02 13:26:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:43,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:26:43,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:26:43,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:26:43,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 13:26:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:43,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 13:26:43,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:26:43,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:26:43,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:26:43,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:26:43,175 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:26:43,175 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:26:43,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 13:26:43,191 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 13:26:43,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:26:43,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2023-12-02 13:26:43,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-12-02 13:26:43,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:26:43,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2023-12-02 13:26:43,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2023-12-02 13:26:43,646 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 13:26:43,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:26:43,681 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_396 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_397)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 13:26:43,695 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_396 (Array Int Int))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_395) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_397)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-12-02 13:26:43,721 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_395) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_397)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-12-02 13:26:43,742 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_392 Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_395) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_392) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_392) .cse1 v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_397)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-12-02 13:26:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 13:26:45,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493817387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:26:45,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1554556344] [2023-12-02 13:26:45,911 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 13:26:45,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:26:45,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-12-02 13:26:45,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190128081] [2023-12-02 13:26:45,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:26:45,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 13:26:45,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:45,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 13:26:45,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=222, Unknown=5, NotChecked=140, Total=462 [2023-12-02 13:26:45,913 INFO L87 Difference]: Start difference. First operand 608 states and 1410 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:46,299 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ (* (select .cse0 .cse6) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_397 Int)) (< (select (store .cse0 .cse1 v_ArrVal_397) .cse2) 2147483647)) (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_395) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_397)) .cse2) 2147483647)))) (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_392 Int) (v_ArrVal_390 Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse7 (store .cse0 .cse1 v_ArrVal_390))) (or (< (+ (select .cse7 .cse6) 1) v_ArrVal_395) (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_392) .cse6 v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse6)) |c_~#queue~0.offset|) v_ArrVal_397)) .cse2) 2147483647) (< (+ (select .cse7 .cse2) 1) v_ArrVal_392))))))) is different from false [2023-12-02 13:26:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:46,442 INFO L93 Difference]: Finished difference Result 718 states and 1663 transitions. [2023-12-02 13:26:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:26:46,443 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 13:26:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:46,447 INFO L225 Difference]: With dead ends: 718 [2023-12-02 13:26:46,447 INFO L226 Difference]: Without dead ends: 718 [2023-12-02 13:26:46,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=133, Invalid=301, Unknown=6, NotChecked=210, Total=650 [2023-12-02 13:26:46,448 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:46,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 228 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 0 Unknown, 558 Unchecked, 0.4s Time] [2023-12-02 13:26:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-12-02 13:26:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 650. [2023-12-02 13:26:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 639 states have (on average 2.3646322378716746) internal successors, (1511), 649 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1511 transitions. [2023-12-02 13:26:46,470 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1511 transitions. Word has length 18 [2023-12-02 13:26:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:46,470 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 1511 transitions. [2023-12-02 13:26:46,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1511 transitions. [2023-12-02 13:26:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 13:26:46,471 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:46,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:46,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 13:26:46,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:26:46,672 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:46,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2052888008, now seen corresponding path program 1 times [2023-12-02 13:26:46,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:46,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159510400] [2023-12-02 13:26:46,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:46,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:47,460 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 13:26:47,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159510400] [2023-12-02 13:26:47,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159510400] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:26:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884038821] [2023-12-02 13:26:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:47,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:26:47,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:26:47,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:26:47,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 13:26:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:47,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 13:26:47,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:26:47,651 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:26:47,651 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 13:26:47,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:26:47,662 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:26:47,678 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:26:47,678 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:26:47,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-02 13:26:47,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:26:47,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2023-12-02 13:26:48,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-12-02 13:26:48,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:26:48,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2023-12-02 13:26:48,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2023-12-02 13:26:48,207 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 13:26:48,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:26:48,253 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 Int) (v_ArrVal_464 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_465)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 13:26:48,266 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_464 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_465)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_463))) is different from false [2023-12-02 13:26:48,287 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_465)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_463)))) is different from false [2023-12-02 13:26:48,307 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_460 Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_460) (< (+ (select .cse0 .cse1) 1) v_ArrVal_463) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_460) .cse1 v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_465)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-12-02 13:26:50,488 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_460 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_458 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_457))) (let ((.cse0 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) v_ArrVal_458))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_463) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_460) .cse1 v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_465)) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_460))))) is different from false [2023-12-02 13:26:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 13:26:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884038821] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:26:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1506308832] [2023-12-02 13:26:50,511 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 13:26:50,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:26:50,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-12-02 13:26:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895552916] [2023-12-02 13:26:50,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:26:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 13:26:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 13:26:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=273, Unknown=6, NotChecked=200, Total=600 [2023-12-02 13:26:50,513 INFO L87 Difference]: Start difference. First operand 650 states and 1511 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:50,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_460 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_458 Int)) (let ((.cse0 (store .cse4 .cse5 v_ArrVal_458))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_460) (< (+ (select .cse0 .cse2) 1) v_ArrVal_463) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_460) .cse2 v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_465)) .cse1) 2147483647)))) (forall ((v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_465)) .cse1) 2147483647) (< (+ (select .cse7 .cse8) 1) v_ArrVal_463)))) (forall ((v_ArrVal_465 Int)) (< (select (store .cse4 .cse5 v_ArrVal_465) .cse1) 2147483647))))) is different from false [2023-12-02 13:26:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:26:51,295 INFO L93 Difference]: Finished difference Result 1264 states and 2962 transitions. [2023-12-02 13:26:51,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:26:51,296 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 13:26:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:26:51,304 INFO L225 Difference]: With dead ends: 1264 [2023-12-02 13:26:51,304 INFO L226 Difference]: Without dead ends: 1264 [2023-12-02 13:26:51,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=148, Invalid=331, Unknown=7, NotChecked=270, Total=756 [2023-12-02 13:26:51,305 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 264 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1666 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:26:51,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 382 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 551 Invalid, 0 Unknown, 1666 Unchecked, 0.6s Time] [2023-12-02 13:26:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2023-12-02 13:26:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 920. [2023-12-02 13:26:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 909 states have (on average 2.4576457645764576) internal successors, (2234), 919 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2234 transitions. [2023-12-02 13:26:51,333 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2234 transitions. Word has length 19 [2023-12-02 13:26:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:26:51,334 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 2234 transitions. [2023-12-02 13:26:51,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2234 transitions. [2023-12-02 13:26:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 13:26:51,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:26:51,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:26:51,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 13:26:51,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:26:51,536 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:26:51,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:26:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1259148600, now seen corresponding path program 2 times [2023-12-02 13:26:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:26:51,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845022486] [2023-12-02 13:26:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:26:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:26:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:26:52,213 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 13:26:52,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:26:52,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845022486] [2023-12-02 13:26:52,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845022486] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:26:52,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253915691] [2023-12-02 13:26:52,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:26:52,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:26:52,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:26:52,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:26:52,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 13:26:52,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 13:26:52,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:26:52,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 13:26:52,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:26:52,401 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:26:52,402 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 13:26:52,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:26:52,412 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:26:52,430 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:26:52,430 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:26:52,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:26:52,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2023-12-02 13:26:52,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2023-12-02 13:26:52,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-12-02 13:26:52,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:26:52,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2023-12-02 13:26:52,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2023-12-02 13:26:53,030 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 13:26:53,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:26:53,082 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_532 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_532) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_533)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 13:26:53,097 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_531 Int) (v_ArrVal_532 (Array Int Int))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_531) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_531)) |c_~#stored_elements~0.base| v_ArrVal_532) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_533)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-12-02 13:26:53,123 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_531 Int) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_531) (< (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_529))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_531))) |c_~#stored_elements~0.base| v_ArrVal_532) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_533)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-12-02 13:26:53,140 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_531 Int) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_529))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 v_ArrVal_531))) |c_~#stored_elements~0.base| v_ArrVal_532) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_533)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 1) v_ArrVal_531)))) is different from false [2023-12-02 13:26:53,164 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_531 Int) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_527 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_527) (< (+ (select .cse0 .cse1) 1) v_ArrVal_531) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_529) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_527)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_529) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 v_ArrVal_531)) |c_~#stored_elements~0.base| v_ArrVal_532) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_533)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-12-02 13:26:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 13:26:55,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253915691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:26:55,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [539332157] [2023-12-02 13:26:55,358 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 13:26:55,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:26:55,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-12-02 13:26:55,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925550449] [2023-12-02 13:26:55,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:26:55,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 13:26:55,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:26:55,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 13:26:55,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=287, Unknown=6, NotChecked=200, Total=600 [2023-12-02 13:26:55,360 INFO L87 Difference]: Start difference. First operand 920 states and 2234 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:26:57,692 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 13:26:59,701 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 13:27:01,707 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 13:27:03,716 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 13:27:05,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:07,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:09,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:15,859 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 13:27:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:16,223 INFO L93 Difference]: Finished difference Result 1287 states and 3091 transitions. [2023-12-02 13:27:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 13:27:16,223 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 13:27:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:16,231 INFO L225 Difference]: With dead ends: 1287 [2023-12-02 13:27:16,231 INFO L226 Difference]: Without dead ends: 1287 [2023-12-02 13:27:16,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=173, Invalid=439, Unknown=8, NotChecked=250, Total=870 [2023-12-02 13:27:16,233 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 295 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 21 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 811 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:16,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 243 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 381 Invalid, 8 Unknown, 811 Unchecked, 16.6s Time] [2023-12-02 13:27:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2023-12-02 13:27:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 965. [2023-12-02 13:27:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 954 states have (on average 2.451781970649895) internal successors, (2339), 964 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:27:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 2339 transitions. [2023-12-02 13:27:16,267 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 2339 transitions. Word has length 19 [2023-12-02 13:27:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:16,267 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 2339 transitions. [2023-12-02 13:27:16,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:27:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 2339 transitions. [2023-12-02 13:27:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 13:27:16,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:16,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:16,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 13:27:16,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 13:27:16,470 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:27:16,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1904162414, now seen corresponding path program 3 times [2023-12-02 13:27:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:16,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695042253] [2023-12-02 13:27:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:17,099 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 13:27:17,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695042253] [2023-12-02 13:27:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695042253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353947939] [2023-12-02 13:27:17,101 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:27:17,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:17,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:17,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 13:27:17,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:27:17,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:27:17,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 13:27:17,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:17,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:17,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:17,273 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:27:17,288 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:27:17,288 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:27:17,310 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 13:27:17,310 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 20 treesize of output 22 [2023-12-02 13:27:17,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:17,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2023-12-02 13:27:17,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:17,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2023-12-02 13:27:17,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:17,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2023-12-02 13:27:17,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:17,894 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 13:27:17,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 56 [2023-12-02 13:27:17,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:17,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2023-12-02 13:27:18,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2023-12-02 13:27:18,053 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 13:27:18,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:27:18,152 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_601 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_599) |c_~#stored_elements~0.base| v_ArrVal_600) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_601)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 13:27:18,185 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_597 Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_601 Int)) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_597)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_599) |c_~#stored_elements~0.base| v_ArrVal_600) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_601)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_597))) is different from false [2023-12-02 13:27:18,213 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_597 Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_601 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_597)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_599) |c_~#stored_elements~0.base| v_ArrVal_600) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_601)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_597))))) is different from false [2023-12-02 13:27:24,884 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 13:27:24,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353947939] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:27:24,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1915835261] [2023-12-02 13:27:24,885 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 13:27:24,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:27:24,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-12-02 13:27:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596040280] [2023-12-02 13:27:24,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:27:24,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 13:27:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 13:27:24,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=333, Unknown=9, NotChecked=126, Total=600 [2023-12-02 13:27:24,887 INFO L87 Difference]: Start difference. First operand 965 states and 2339 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:27:27,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_601 Int)) (< (select (store .cse0 .cse1 v_ArrVal_601) .cse2) 2147483647)) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_601 Int)) (< (select (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_600) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_601)) .cse2) 2147483647)) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_597 Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_601 Int)) (or (< (select (let ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_597)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_599) |c_~#stored_elements~0.base| v_ArrVal_600) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_601)) .cse2) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_597))) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_597 Int) (v_ArrVal_596 Int) (v_ArrVal_593 Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_601 Int)) (let ((.cse6 (store .cse0 .cse1 v_ArrVal_593))) (let ((.cse7 (select .cse6 .cse4))) (or (< (+ (select .cse6 .cse2) 1) v_ArrVal_596) (< (+ .cse7 1) v_ArrVal_597) (= .cse7 400) (< (select (let ((.cse8 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_596) .cse4 v_ArrVal_597)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_599) |c_~#stored_elements~0.base| v_ArrVal_600) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse4) 4)) v_ArrVal_601)) .cse2) 2147483647)))))))) is different from false [2023-12-02 13:27:29,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:29,394 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_601 Int)) (< (select (store .cse0 .cse1 v_ArrVal_601) .cse2) 2147483647)) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_601 Int)) (< (select (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_600) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_601)) .cse2) 2147483647)) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_597 Int) (v_ArrVal_596 Int) (v_ArrVal_593 Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_601 Int)) (let ((.cse5 (store .cse0 .cse1 v_ArrVal_593))) (let ((.cse6 (select .cse5 .cse4))) (or (< (+ (select .cse5 .cse2) 1) v_ArrVal_596) (< (+ .cse6 1) v_ArrVal_597) (= .cse6 400) (< (select (let ((.cse7 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_596) .cse4 v_ArrVal_597)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_599) |c_~#stored_elements~0.base| v_ArrVal_600) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)) v_ArrVal_601)) .cse2) 2147483647)))))))) is different from false [2023-12-02 13:27:29,568 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_601 Int)) (< (select (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_601)) .cse2) 2147483647)) (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_601 Int)) (< (select (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_600) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_601)) .cse2) 2147483647)))) is different from false [2023-12-02 13:27:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:29,875 INFO L93 Difference]: Finished difference Result 1500 states and 3635 transitions. [2023-12-02 13:27:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 13:27:29,876 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 13:27:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:29,885 INFO L225 Difference]: With dead ends: 1500 [2023-12-02 13:27:29,886 INFO L226 Difference]: Without dead ends: 1500 [2023-12-02 13:27:29,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=272, Invalid=605, Unknown=17, NotChecked=366, Total=1260 [2023-12-02 13:27:29,887 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 303 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 35 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 1677 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:29,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 406 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 681 Invalid, 17 Unknown, 1677 Unchecked, 2.4s Time] [2023-12-02 13:27:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-12-02 13:27:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 922. [2023-12-02 13:27:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 911 states have (on average 2.4577387486278814) internal successors, (2239), 921 states have internal predecessors, (2239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:27:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 2239 transitions. [2023-12-02 13:27:29,915 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 2239 transitions. Word has length 19 [2023-12-02 13:27:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:29,916 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 2239 transitions. [2023-12-02 13:27:29,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:27:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 2239 transitions. [2023-12-02 13:27:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 13:27:29,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:29,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:29,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 13:27:30,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 13:27:30,119 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:27:30,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1266054527, now seen corresponding path program 1 times [2023-12-02 13:27:30,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:30,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540862607] [2023-12-02 13:27:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:30,634 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 13:27:30,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:30,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540862607] [2023-12-02 13:27:30,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540862607] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:30,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405588692] [2023-12-02 13:27:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:30,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:30,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:30,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:30,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 13:27:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:30,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 13:27:30,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:30,855 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 13:27:30,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:30,879 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 13:27:30,927 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-02 13:27:30,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 56 [2023-12-02 13:27:30,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-02 13:27:30,969 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 13:27:30,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 13:27:30,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:27:31,087 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_659 (Array Int Int)) (v_ArrVal_660 Int)) (or (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_659) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_660)) .cse1)) 2147483650)) (< (+ v_ArrVal_660 2147483648) 0))) is different from false [2023-12-02 13:27:31,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:27:31,096 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 50 treesize of output 41 [2023-12-02 13:27:31,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:27:31,105 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 65 treesize of output 67 [2023-12-02 13:27:31,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 36 treesize of output 24 [2023-12-02 13:27:31,121 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 9 treesize of output 5 [2023-12-02 13:27:31,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:27:31,131 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 49 treesize of output 41 [2023-12-02 13:27:31,232 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 13:27:31,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405588692] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:27:31,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1125286956] [2023-12-02 13:27:31,232 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 13:27:31,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:27:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-12-02 13:27:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440017643] [2023-12-02 13:27:31,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:27:31,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 13:27:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:31,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 13:27:31,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=383, Unknown=1, NotChecked=40, Total=506 [2023-12-02 13:27:31,235 INFO L87 Difference]: Start difference. First operand 922 states and 2239 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:27:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:32,025 INFO L93 Difference]: Finished difference Result 1889 states and 4563 transitions. [2023-12-02 13:27:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 13:27:32,025 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 13:27:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:32,038 INFO L225 Difference]: With dead ends: 1889 [2023-12-02 13:27:32,038 INFO L226 Difference]: Without dead ends: 1889 [2023-12-02 13:27:32,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=916, Unknown=1, NotChecked=66, Total=1260 [2023-12-02 13:27:32,040 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 471 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:32,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 342 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 759 Invalid, 0 Unknown, 245 Unchecked, 0.5s Time] [2023-12-02 13:27:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2023-12-02 13:27:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1161. [2023-12-02 13:27:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1150 states have (on average 2.5121739130434784) internal successors, (2889), 1160 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:27:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2889 transitions. [2023-12-02 13:27:32,076 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2889 transitions. Word has length 20 [2023-12-02 13:27:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:32,076 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 2889 transitions. [2023-12-02 13:27:32,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:27:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2889 transitions. [2023-12-02 13:27:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 13:27:32,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:32,078 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:32,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 13:27:32,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 13:27:32,280 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:27:32,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash -243991179, now seen corresponding path program 1 times [2023-12-02 13:27:32,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:32,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168728273] [2023-12-02 13:27:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:32,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:32,708 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 13:27:32,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168728273] [2023-12-02 13:27:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168728273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613049567] [2023-12-02 13:27:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:32,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:32,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:32,710 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:32,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 13:27:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:32,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 13:27:32,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:33,092 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 13:27:33,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:33,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 13:27:33,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:33,164 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 13:27:33,227 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-12-02 13:27:33,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 46 [2023-12-02 13:27:33,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 13:27:33,275 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 13:27:33,293 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 13:27:33,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:27:33,384 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 Int)) (or (< (+ v_ArrVal_727 2147483648) 0) (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_726) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_727)) .cse1)) 2147483650)))) is different from false [2023-12-02 13:27:33,396 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int)) (or (< (+ v_ArrVal_727 2147483648) 0) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_725)) |c_~#stored_elements~0.base| v_ArrVal_726) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_727)) .cse1)))))) is different from false [2023-12-02 13:27:33,428 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-12-02 13:27:33,429 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 86 treesize of output 61 [2023-12-02 13:27:33,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:27:33,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 76 treesize of output 78 [2023-12-02 13:27:33,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 36 treesize of output 24 [2023-12-02 13:27:33,502 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 20 [2023-12-02 13:27:33,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:27:33,516 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 55 treesize of output 47 [2023-12-02 13:27:33,661 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 13:27:33,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613049567] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:27:33,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1730513038] [2023-12-02 13:27:33,662 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 13:27:33,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:27:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-12-02 13:27:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563533008] [2023-12-02 13:27:33,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:27:33,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 13:27:33,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:33,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 13:27:33,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=376, Unknown=2, NotChecked=82, Total=552 [2023-12-02 13:27:33,664 INFO L87 Difference]: Start difference. First operand 1161 states and 2889 transitions. Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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 13:27:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:27:33,897 INFO L93 Difference]: Finished difference Result 1234 states and 3049 transitions. [2023-12-02 13:27:33,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:27:33,898 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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 21 [2023-12-02 13:27:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:27:33,903 INFO L225 Difference]: With dead ends: 1234 [2023-12-02 13:27:33,903 INFO L226 Difference]: Without dead ends: 1234 [2023-12-02 13:27:33,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=426, Unknown=2, NotChecked=90, Total=650 [2023-12-02 13:27:33,904 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 241 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:27:33,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 130 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 245 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2023-12-02 13:27:33,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2023-12-02 13:27:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 906. [2023-12-02 13:27:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 896 states have (on average 2.439732142857143) internal successors, (2186), 905 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:27:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2186 transitions. [2023-12-02 13:27:33,930 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 2186 transitions. Word has length 21 [2023-12-02 13:27:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:27:33,930 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 2186 transitions. [2023-12-02 13:27:33,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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 13:27:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 2186 transitions. [2023-12-02 13:27:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 13:27:33,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:27:33,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:27:33,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 13:27:34,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 13:27:34,136 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:27:34,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:27:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash 592985322, now seen corresponding path program 1 times [2023-12-02 13:27:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:27:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547972664] [2023-12-02 13:27:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:27:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:27:34,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:27:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547972664] [2023-12-02 13:27:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547972664] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:27:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150198175] [2023-12-02 13:27:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:27:34,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:27:34,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:27:34,509 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:27:34,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 13:27:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:27:34,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 13:27:34,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:27:34,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:34,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:34,649 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:27:34,661 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:27:34,662 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:27:34,672 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 13:27:34,673 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 13:27:34,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:27:34,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-12-02 13:27:34,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2023-12-02 13:27:34,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:27:34,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 46 treesize of output 33 [2023-12-02 13:27:35,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2023-12-02 13:27:35,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2023-12-02 13:27:35,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46 [2023-12-02 13:27:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:27:35,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:27:36,080 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_793 Int) (v_ArrVal_794 (Array Int Int))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_793) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_793)) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_795)) .cse1)) 2147483647))) is different from false [2023-12-02 13:27:36,179 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_793 Int) (v_ArrVal_790 Int) (v_ArrVal_794 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_793) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_790) .cse1 v_ArrVal_793)) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))) v_ArrVal_795)) .cse3)) 2147483647)))) is different from false [2023-12-02 13:27:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 13:27:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150198175] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:27:40,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [235463398] [2023-12-02 13:27:40,318 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 13:27:40,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:27:40,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2023-12-02 13:27:40,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244840453] [2023-12-02 13:27:40,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:27:40,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 13:27:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:27:40,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 13:27:40,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=326, Unknown=10, NotChecked=82, Total=552 [2023-12-02 13:27:40,320 INFO L87 Difference]: Start difference. First operand 906 states and 2186 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 13:27:42,748 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 13:27:44,757 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 13:27:46,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:48,768 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 13:27:50,775 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 13:27:50,785 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| 5))) (let ((.cse4 (select .cse5 1604))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_795 Int) (v_ArrVal_793 Int) (v_ArrVal_794 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_793)) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_795)) .cse1)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_793)))) (<= .cse4 1) (= 5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (let ((.cse6 (* .cse4 4))) (store (store (store (store (store ((as const (Array Int Int)) 0) 1600 0) 0 (select .cse5 0)) 1608 (select .cse5 1608)) 1604 .cse4) .cse6 (select .cse5 .cse6))) .cse5)))) is different from false [2023-12-02 13:27:52,815 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 13:27:54,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:56,827 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 13:27:58,832 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 13:28:00,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:28:00,853 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (and (forall ((v_ArrVal_795 Int) (v_ArrVal_793 Int) (v_ArrVal_794 (Array Int Int))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_793)) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_795)) .cse1)) 2147483647) (< (+ .cse4 1) v_ArrVal_793))) (<= .cse4 1)))) is different from false [2023-12-02 13:28:00,865 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 1) (forall ((v_ArrVal_795 Int) (v_ArrVal_793 Int) (v_ArrVal_794 (Array Int Int))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_793) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_793)) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_795)) .cse1)) 2147483647)))) is different from false [2023-12-02 13:28:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:01,474 INFO L93 Difference]: Finished difference Result 1638 states and 3912 transitions. [2023-12-02 13:28:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 13:28:01,475 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 21 [2023-12-02 13:28:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:01,479 INFO L225 Difference]: With dead ends: 1638 [2023-12-02 13:28:01,479 INFO L226 Difference]: Without dead ends: 1638 [2023-12-02 13:28:01,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=256, Invalid=621, Unknown=13, NotChecked=300, Total=1190 [2023-12-02 13:28:01,480 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 279 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 19 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 990 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:01,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 403 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 722 Invalid, 39 Unknown, 990 Unchecked, 20.9s Time] [2023-12-02 13:28:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2023-12-02 13:28:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1237. [2023-12-02 13:28:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1227 states have (on average 2.486552567237164) internal successors, (3051), 1236 states have internal predecessors, (3051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 3051 transitions. [2023-12-02 13:28:01,516 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 3051 transitions. Word has length 21 [2023-12-02 13:28:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:01,516 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 3051 transitions. [2023-12-02 13:28:01,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 13:28:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 3051 transitions. [2023-12-02 13:28:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 13:28:01,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:01,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:01,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 13:28:01,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:01,719 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:01,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 592986316, now seen corresponding path program 1 times [2023-12-02 13:28:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931185384] [2023-12-02 13:28:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:01,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:01,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931185384] [2023-12-02 13:28:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931185384] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:01,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606718527] [2023-12-02 13:28:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:01,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:01,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:01,776 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:01,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 13:28:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:01,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:28:01,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:01,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:28:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606718527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:28:01,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:28:01,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-12-02 13:28:01,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18064046] [2023-12-02 13:28:01,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:28:01,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:28:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:01,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:28:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:28:01,930 INFO L87 Difference]: Start difference. First operand 1237 states and 3051 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 13:28:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:02,020 INFO L93 Difference]: Finished difference Result 1221 states and 2982 transitions. [2023-12-02 13:28:02,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:28:02,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 13:28:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:02,023 INFO L225 Difference]: With dead ends: 1221 [2023-12-02 13:28:02,023 INFO L226 Difference]: Without dead ends: 1221 [2023-12-02 13:28:02,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:28:02,024 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:02,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 43 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:28:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2023-12-02 13:28:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1221. [2023-12-02 13:28:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1212 states have (on average 2.4603960396039604) internal successors, (2982), 1220 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2982 transitions. [2023-12-02 13:28:02,044 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2982 transitions. Word has length 21 [2023-12-02 13:28:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:02,044 INFO L495 AbstractCegarLoop]: Abstraction has 1221 states and 2982 transitions. [2023-12-02 13:28:02,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 13:28:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2982 transitions. [2023-12-02 13:28:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:28:02,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:02,045 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 13:28:02,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 13:28:02,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:02,246 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:02,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1547957182, now seen corresponding path program 1 times [2023-12-02 13:28:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:02,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139109302] [2023-12-02 13:28:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:02,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139109302] [2023-12-02 13:28:02,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139109302] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:02,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442379867] [2023-12-02 13:28:02,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:02,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:02,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:02,763 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:02,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 13:28:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:02,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 13:28:02,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:02,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:02,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:02,896 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:28:02,906 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:28:02,907 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:28:02,925 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:28:02,925 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 13:28:02,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-02 13:28:03,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:28:03,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-12-02 13:28:03,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2023-12-02 13:28:03,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:03,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 13:28:03,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-12-02 13:28:03,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2023-12-02 13:28:03,347 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 41 treesize of output 31 [2023-12-02 13:28:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:03,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:03,427 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_931 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_930) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_931)) .cse1)) 2147483647)) is different from false [2023-12-02 13:28:03,437 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_931 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_930) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_931)) .cse1)) 2147483647)) is different from false [2023-12-02 13:28:03,453 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_931 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_930) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_931)) .cse1)) 2147483647))) is different from false [2023-12-02 13:28:03,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_926 Int) (v_ArrVal_931 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_926) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_930) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_931)) .cse2)) 2147483647))))) is different from false [2023-12-02 13:28:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-02 13:28:03,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442379867] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:03,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1545220237] [2023-12-02 13:28:03,687 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 13:28:03,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:03,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2023-12-02 13:28:03,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613126710] [2023-12-02 13:28:03,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:03,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 13:28:03,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:03,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 13:28:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=388, Unknown=9, NotChecked=180, Total=702 [2023-12-02 13:28:03,689 INFO L87 Difference]: Start difference. First operand 1221 states and 2982 transitions. Second operand has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:05,782 INFO L93 Difference]: Finished difference Result 2928 states and 7101 transitions. [2023-12-02 13:28:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 13:28:05,783 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 13:28:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:05,789 INFO L225 Difference]: With dead ends: 2928 [2023-12-02 13:28:05,789 INFO L226 Difference]: Without dead ends: 2928 [2023-12-02 13:28:05,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=414, Invalid=1396, Unknown=12, NotChecked=340, Total=2162 [2023-12-02 13:28:05,790 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 557 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 41 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 1635 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:05,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 529 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1108 Invalid, 13 Unknown, 1635 Unchecked, 1.2s Time] [2023-12-02 13:28:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2023-12-02 13:28:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1579. [2023-12-02 13:28:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1570 states have (on average 2.4980891719745224) internal successors, (3922), 1578 states have internal predecessors, (3922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 3922 transitions. [2023-12-02 13:28:05,829 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 3922 transitions. Word has length 22 [2023-12-02 13:28:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:05,829 INFO L495 AbstractCegarLoop]: Abstraction has 1579 states and 3922 transitions. [2023-12-02 13:28:05,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 3922 transitions. [2023-12-02 13:28:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:28:05,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:05,831 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 13:28:05,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-02 13:28:06,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:06,032 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:06,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:06,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1574567374, now seen corresponding path program 2 times [2023-12-02 13:28:06,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:06,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267397303] [2023-12-02 13:28:06,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:06,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:06,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:06,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267397303] [2023-12-02 13:28:06,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267397303] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:06,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553079011] [2023-12-02 13:28:06,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:28:06,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:06,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:06,534 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:06,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 13:28:06,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 13:28:06,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:28:06,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 13:28:06,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:06,822 INFO L349 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2023-12-02 13:28:06,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 67 [2023-12-02 13:28:06,838 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:28:06,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2023-12-02 13:28:07,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2023-12-02 13:28:07,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-12-02 13:28:07,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-12-02 13:28:07,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2023-12-02 13:28:07,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 13:28:07,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-12-02 13:28:07,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2023-12-02 13:28:07,483 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 41 treesize of output 31 [2023-12-02 13:28:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:07,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:07,603 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1005 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1005)) .cse1)) 2147483647)) is different from false [2023-12-02 13:28:07,611 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1005 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1005)) .cse1)) 2147483647)) is different from false [2023-12-02 13:28:07,626 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1005 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1005)) .cse1)) 2147483647)) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2023-12-02 13:28:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 13:28:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553079011] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [507630601] [2023-12-02 13:28:07,809 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 13:28:07,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:07,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2023-12-02 13:28:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070048739] [2023-12-02 13:28:07,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:07,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 13:28:07,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:07,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 13:28:07,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=418, Unknown=6, NotChecked=138, Total=702 [2023-12-02 13:28:07,811 INFO L87 Difference]: Start difference. First operand 1579 states and 3922 transitions. Second operand has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:08,662 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (let ((.cse5 (+ .cse0 1)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (or (= 400 .cse0) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1005 Int) (v_ArrVal_999 Int)) (< (select (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_999) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1005)) .cse2) 2147483647))) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1005 Int)) (< (select (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1005)) .cse2) 2147483647)) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)))))) is different from false [2023-12-02 13:28:08,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (or (= 400 .cse0) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1005 Int) (v_ArrVal_999 Int)) (< (select (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_999) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1005)) .cse2) 2147483647))) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1005 Int) (v_ArrVal_999 Int) (v_ArrVal_997 Int)) (let ((.cse6 (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_997)))) (let ((.cse7 (select .cse6 .cse2))) (or (< (select (let ((.cse5 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_999) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1005)) .cse2) 2147483647) (= 400 .cse7))))) (< .cse0 2147483647) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1005 Int)) (< (select (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) v_ArrVal_1005)) .cse2) 2147483647)) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1005 Int)) (< (select (let ((.cse10 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse10 .cse2))) v_ArrVal_1005)) .cse2) 2147483647))))) is different from false [2023-12-02 13:28:09,269 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1005 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1004) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1005)) .cse1) 2147483647)) (forall ((v_ArrVal_1005 Int)) (< (select (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1005)) .cse1) 2147483647)))) is different from false [2023-12-02 13:28:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:10,090 INFO L93 Difference]: Finished difference Result 3458 states and 8523 transitions. [2023-12-02 13:28:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 13:28:10,091 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 13:28:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:10,098 INFO L225 Difference]: With dead ends: 3458 [2023-12-02 13:28:10,098 INFO L226 Difference]: Without dead ends: 3458 [2023-12-02 13:28:10,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=324, Invalid=949, Unknown=11, NotChecked=438, Total=1722 [2023-12-02 13:28:10,099 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 923 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 103 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 3936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 2800 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:10,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 494 Invalid, 3936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 993 Invalid, 40 Unknown, 2800 Unchecked, 1.5s Time] [2023-12-02 13:28:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2023-12-02 13:28:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 1980. [2023-12-02 13:28:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1980 states, 1971 states have (on average 2.5657026889903602) internal successors, (5057), 1979 states have internal predecessors, (5057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:10,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 5057 transitions. [2023-12-02 13:28:10,149 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 5057 transitions. Word has length 22 [2023-12-02 13:28:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:10,149 INFO L495 AbstractCegarLoop]: Abstraction has 1980 states and 5057 transitions. [2023-12-02 13:28:10,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 5057 transitions. [2023-12-02 13:28:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:28:10,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:10,151 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 13:28:10,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-02 13:28:10,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 13:28:10,351 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:10,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1201749950, now seen corresponding path program 3 times [2023-12-02 13:28:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:10,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354443928] [2023-12-02 13:28:10,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:10,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:10,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354443928] [2023-12-02 13:28:10,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354443928] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391836359] [2023-12-02 13:28:10,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:28:10,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:10,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:10,754 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:10,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 13:28:10,872 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:28:10,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:28:10,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 13:28:10,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:10,901 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:28:10,901 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 13:28:10,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:10,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:28:10,916 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:28:10,917 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:28:10,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:28:11,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-12-02 13:28:11,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2023-12-02 13:28:11,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:11,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 46 treesize of output 33 [2023-12-02 13:28:11,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2023-12-02 13:28:11,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2023-12-02 13:28:11,438 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 149 treesize of output 116 [2023-12-02 13:28:11,505 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 149 treesize of output 117 [2023-12-02 13:28:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:12,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:12,376 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (= 400 (select .cse0 .cse1)) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1080 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1080)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1) 2147483647)))) is different from false [2023-12-02 13:28:12,468 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1078 Int) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1080 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1077))) (let ((.cse0 (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1078)))) (or (= 400 (select .cse0 .cse1)) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1080)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2023-12-02 13:28:12,489 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1075 Int) (v_ArrVal_1078 Int) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1080 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1075)) |c_~#stored_elements~0.base| v_ArrVal_1077))) (let ((.cse0 (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1078)))) (or (= 400 (select .cse0 .cse1)) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1075) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1080)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2023-12-02 13:28:12,528 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1075 Int) (v_ArrVal_1078 Int) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1080 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1075)) |c_~#stored_elements~0.base| v_ArrVal_1077))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1078)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1075) (= 400 (select .cse2 .cse3)) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1080)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#queue~0.base|) .cse3) 2147483647)))))) is different from false [2023-12-02 13:28:12,553 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1073 Int) (v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1075 Int) (v_ArrVal_1078 Int) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1080 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1073) .cse1 v_ArrVal_1075)) |c_~#stored_elements~0.base| v_ArrVal_1077))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)) v_ArrVal_1078)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1075) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1080)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#queue~0.base|) .cse4) 2147483647) (= (select .cse3 .cse4) 400)))))) is different from false [2023-12-02 13:28:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-02 13:28:14,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391836359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:14,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732846772] [2023-12-02 13:28:14,766 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 13:28:14,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2023-12-02 13:28:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233532571] [2023-12-02 13:28:14,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:14,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 13:28:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 13:28:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=411, Unknown=12, NotChecked=240, Total=812 [2023-12-02 13:28:14,769 INFO L87 Difference]: Start difference. First operand 1980 states and 5057 transitions. Second operand has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:17,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:28:19,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:28:21,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:28:23,121 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 13:28:25,126 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 13:28:25,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| 5))) (let ((.cse6 (select .cse8 1604))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1075 Int) (v_ArrVal_1078 Int) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1080 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1075)) |c_~#stored_elements~0.base| v_ArrVal_1077))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1078)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1075) (= 400 (select .cse2 .cse3)) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1080)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#queue~0.base|) .cse3) 2147483647)))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| .cse6) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (= 5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (let ((.cse12 (store ((as const (Array Int Int)) 0) 1600 0)) (.cse13 (select .cse8 0)) (.cse11 (select .cse8 1608))) (or (exists ((v_DerPreprocessor_77 Int) (v_DerPreprocessor_75 Int)) (let ((.cse9 (store .cse12 0 .cse13)) (.cse10 (select .cse8 v_DerPreprocessor_75))) (let ((.cse7 (select (store (store (store .cse9 1608 v_DerPreprocessor_77) 1604 .cse6) v_DerPreprocessor_75 .cse10) 1604))) (and (= v_DerPreprocessor_75 (* .cse7 4)) (= .cse8 (store (store (store .cse9 1604 .cse6) v_DerPreprocessor_75 .cse10) 1608 .cse11)) (<= .cse7 1))))) (= (store (store (store .cse12 1604 0) 0 .cse13) 1608 .cse11) .cse8)))))) is different from false [2023-12-02 13:28:25,171 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1075 Int) (v_ArrVal_1078 Int) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1080 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1075)) |c_~#stored_elements~0.base| v_ArrVal_1077))) (let ((.cse0 (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1078)))) (or (= 400 (select .cse0 .cse1)) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1075) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1080)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1082) |c_~#queue~0.base|) .cse1) 2147483647))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 1)) is different from false [2023-12-02 13:28:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:26,270 INFO L93 Difference]: Finished difference Result 3061 states and 7677 transitions. [2023-12-02 13:28:26,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 13:28:26,270 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 13:28:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:26,277 INFO L225 Difference]: With dead ends: 3061 [2023-12-02 13:28:26,277 INFO L226 Difference]: Without dead ends: 3061 [2023-12-02 13:28:26,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=271, Invalid=796, Unknown=17, NotChecked=476, Total=1560 [2023-12-02 13:28:26,278 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 400 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 36 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 3224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 2232 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:26,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 488 Invalid, 3224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 919 Invalid, 37 Unknown, 2232 Unchecked, 11.0s Time] [2023-12-02 13:28:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2023-12-02 13:28:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 2212. [2023-12-02 13:28:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 2203 states have (on average 2.571947344530186) internal successors, (5666), 2211 states have internal predecessors, (5666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 5666 transitions. [2023-12-02 13:28:26,326 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 5666 transitions. Word has length 22 [2023-12-02 13:28:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:26,326 INFO L495 AbstractCegarLoop]: Abstraction has 2212 states and 5666 transitions. [2023-12-02 13:28:26,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 5666 transitions. [2023-12-02 13:28:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:28:26,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:26,328 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 13:28:26,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 13:28:26,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 13:28:26,529 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:26,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1202707265, now seen corresponding path program 1 times [2023-12-02 13:28:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:26,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830864456] [2023-12-02 13:28:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:28:26,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830864456] [2023-12-02 13:28:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830864456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:28:26,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:28:26,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:28:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575165032] [2023-12-02 13:28:26,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:28:26,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:28:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:28:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:28:26,563 INFO L87 Difference]: Start difference. First operand 2212 states and 5666 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:26,665 INFO L93 Difference]: Finished difference Result 2196 states and 5497 transitions. [2023-12-02 13:28:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:28:26,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 13:28:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:26,670 INFO L225 Difference]: With dead ends: 2196 [2023-12-02 13:28:26,670 INFO L226 Difference]: Without dead ends: 2196 [2023-12-02 13:28:26,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:28:26,671 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:26,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:28:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2023-12-02 13:28:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2196. [2023-12-02 13:28:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 2188 states have (on average 2.5123400365630713) internal successors, (5497), 2195 states have internal predecessors, (5497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 5497 transitions. [2023-12-02 13:28:26,711 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 5497 transitions. Word has length 22 [2023-12-02 13:28:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:26,711 INFO L495 AbstractCegarLoop]: Abstraction has 2196 states and 5497 transitions. [2023-12-02 13:28:26,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 5497 transitions. [2023-12-02 13:28:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 13:28:26,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:26,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:26,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 13:28:26,714 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:26,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -347116464, now seen corresponding path program 1 times [2023-12-02 13:28:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:26,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441013216] [2023-12-02 13:28:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:28:26,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441013216] [2023-12-02 13:28:26,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441013216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:28:26,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:28:26,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:28:26,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987513826] [2023-12-02 13:28:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:28:26,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:28:26,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:28:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:28:26,763 INFO L87 Difference]: Start difference. First operand 2196 states and 5497 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:26,838 INFO L93 Difference]: Finished difference Result 1137 states and 2449 transitions. [2023-12-02 13:28:26,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:28:26,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 13:28:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:26,854 INFO L225 Difference]: With dead ends: 1137 [2023-12-02 13:28:26,854 INFO L226 Difference]: Without dead ends: 1137 [2023-12-02 13:28:26,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:28:26,854 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:26,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 18 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:28:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2023-12-02 13:28:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1022. [2023-12-02 13:28:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1012 states have (on average 2.183794466403162) internal successors, (2210), 1021 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 2210 transitions. [2023-12-02 13:28:26,876 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 2210 transitions. Word has length 25 [2023-12-02 13:28:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:26,876 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 2210 transitions. [2023-12-02 13:28:26,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 2210 transitions. [2023-12-02 13:28:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 13:28:26,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:26,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:26,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-02 13:28:26,878 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:26,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1235580061, now seen corresponding path program 1 times [2023-12-02 13:28:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:26,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765484814] [2023-12-02 13:28:26,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:26,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:27,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765484814] [2023-12-02 13:28:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765484814] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105274484] [2023-12-02 13:28:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:27,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:27,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:27,359 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:27,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 13:28:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:27,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 13:28:27,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:27,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:27,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:27,503 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:28:27,513 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:28:27,513 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:28:27,521 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 13:28:27,521 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 13:28:27,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:28:27,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2023-12-02 13:28:27,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2023-12-02 13:28:27,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:27,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2023-12-02 13:28:27,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2023-12-02 13:28:27,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2023-12-02 13:28:27,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 44 [2023-12-02 13:28:28,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:28,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2023-12-02 13:28:28,084 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 57 treesize of output 43 [2023-12-02 13:28:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:28,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:28,513 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1224 Int) (v_ArrVal_1217 Int) (v_ArrVal_1219 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1216) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1217))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1219) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1224)) .cse4) 2147483647) (< 400 (select .cse3 .cse1)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1219))))) is different from false [2023-12-02 13:28:28,565 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1224 Int) (v_ArrVal_1217 Int) (v_ArrVal_1219 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1216) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1217)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1219) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1224)) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1219) (< 400 (select .cse3 .cse1)))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2023-12-02 13:28:28,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1213 Int) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1224 Int) (v_ArrVal_1217 Int) (v_ArrVal_1219 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1213) .cse7 (+ .cse8 1))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1216) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1217))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1219) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1224)) .cse4) 2147483647) (< 400 (select .cse3 .cse1)) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1213) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1219))))) (= 400 .cse8)))) is different from false [2023-12-02 13:28:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-02 13:28:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105274484] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [781080034] [2023-12-02 13:28:28,902 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 13:28:28,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:28,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 29 [2023-12-02 13:28:28,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849163504] [2023-12-02 13:28:28,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:28,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 13:28:28,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:28,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 13:28:28,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=543, Unknown=13, NotChecked=156, Total=870 [2023-12-02 13:28:28,904 INFO L87 Difference]: Start difference. First operand 1022 states and 2210 transitions. Second operand has 30 states, 30 states have (on average 2.5) internal successors, (75), 29 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 13:28:30,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1224 Int) (v_ArrVal_1217 Int) (v_ArrVal_1219 Int)) (let ((.cse0 (store .cse4 .cse5 v_ArrVal_1217))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1219) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1219) .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1224)) .cse1) 2147483647) (< 400 (select .cse0 .cse3))))) (or (< 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1224 Int)) (< (select (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) 1)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_1224)) .cse1) 2147483647))) (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1224 Int) (v_ArrVal_1217 Int) (v_ArrVal_1219 Int)) (let ((.cse8 (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1216) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_1217)))) (or (< (select (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_1219) .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1224)) .cse1) 2147483647) (< 400 (select .cse8 .cse3)) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1219)))) (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1211 Int) (v_ArrVal_1213 Int) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1224 Int) (v_ArrVal_1217 Int) (v_ArrVal_1219 Int)) (let ((.cse11 (store .cse4 .cse5 v_ArrVal_1211))) (let ((.cse13 (select .cse11 .cse3))) (let ((.cse10 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse1 v_ArrVal_1213) .cse3 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1216) |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1217)))) (or (< (+ (select .cse10 .cse1) 1) v_ArrVal_1219) (< (+ (select .cse11 .cse1) 1) v_ArrVal_1213) (< (select (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse1 v_ArrVal_1219) .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_1224)) .cse1) 2147483647) (= 400 .cse13) (< 400 (select .cse10 .cse3)))))))))) is different from false [2023-12-02 13:28:33,091 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 13:28:35,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:28:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:35,617 INFO L93 Difference]: Finished difference Result 1185 states and 2516 transitions. [2023-12-02 13:28:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 13:28:35,618 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 13:28:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:35,619 INFO L225 Difference]: With dead ends: 1185 [2023-12-02 13:28:35,619 INFO L226 Difference]: Without dead ends: 1185 [2023-12-02 13:28:35,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=16, NotChecked=268, Total=1406 [2023-12-02 13:28:35,620 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 101 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 12 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:35,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 477 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1316 Invalid, 14 Unknown, 495 Unchecked, 6.3s Time] [2023-12-02 13:28:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2023-12-02 13:28:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1019. [2023-12-02 13:28:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1009 states have (on average 2.162537165510406) internal successors, (2182), 1018 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2182 transitions. [2023-12-02 13:28:35,635 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2182 transitions. Word has length 25 [2023-12-02 13:28:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:35,635 INFO L495 AbstractCegarLoop]: Abstraction has 1019 states and 2182 transitions. [2023-12-02 13:28:35,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.5) internal successors, (75), 29 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 13:28:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2182 transitions. [2023-12-02 13:28:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 13:28:35,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:35,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:35,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 13:28:35,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 13:28:35,838 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:35,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1056714599, now seen corresponding path program 1 times [2023-12-02 13:28:35,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:35,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264442361] [2023-12-02 13:28:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:35,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:35,896 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 13:28:35,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264442361] [2023-12-02 13:28:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264442361] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711624491] [2023-12-02 13:28:35,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:35,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:35,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:35,898 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:35,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 13:28:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:36,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:28:36,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:36,067 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 13:28:36,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:36,102 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 13:28:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711624491] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [524434870] [2023-12-02 13:28:36,103 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 13:28:36,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-02 13:28:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459788385] [2023-12-02 13:28:36,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:36,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 13:28:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 13:28:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:28:36,105 INFO L87 Difference]: Start difference. First operand 1019 states and 2182 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:36,246 INFO L93 Difference]: Finished difference Result 1179 states and 2465 transitions. [2023-12-02 13:28:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:28:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 13:28:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:36,248 INFO L225 Difference]: With dead ends: 1179 [2023-12-02 13:28:36,248 INFO L226 Difference]: Without dead ends: 1179 [2023-12-02 13:28:36,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:28:36,249 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 71 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:36,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 76 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:28:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2023-12-02 13:28:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1128. [2023-12-02 13:28:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1118 states have (on average 2.1225402504472273) internal successors, (2373), 1127 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2373 transitions. [2023-12-02 13:28:36,264 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2373 transitions. Word has length 26 [2023-12-02 13:28:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:36,264 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 2373 transitions. [2023-12-02 13:28:36,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2373 transitions. [2023-12-02 13:28:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 13:28:36,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:36,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:36,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 13:28:36,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 13:28:36,466 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:36,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash 628203889, now seen corresponding path program 1 times [2023-12-02 13:28:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:36,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855173851] [2023-12-02 13:28:36,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:37,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855173851] [2023-12-02 13:28:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855173851] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:37,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992697290] [2023-12-02 13:28:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:37,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:37,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:37,019 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:37,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 13:28:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:37,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-02 13:28:37,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:37,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:37,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:37,177 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:28:37,187 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:28:37,188 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:28:37,208 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:28:37,208 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 13:28:37,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-02 13:28:37,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:28:37,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-12-02 13:28:37,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2023-12-02 13:28:37,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:37,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 13:28:37,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-12-02 13:28:37,552 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 41 treesize of output 31 [2023-12-02 13:28:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:37,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:37,731 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 Int) (v_ArrVal_1364 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1364) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1365)) .cse1))))) is different from false [2023-12-02 13:28:37,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 Int) (v_ArrVal_1364 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1361) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1364) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1365)) .cse1))))) is different from false [2023-12-02 13:28:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 13:28:37,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992697290] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:37,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [119185079] [2023-12-02 13:28:37,903 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 13:28:37,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:37,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2023-12-02 13:28:37,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689186224] [2023-12-02 13:28:37,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:37,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 13:28:37,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:37,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 13:28:37,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=501, Unknown=17, NotChecked=98, Total=756 [2023-12-02 13:28:37,905 INFO L87 Difference]: Start difference. First operand 1128 states and 2373 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:38,740 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1365 Int)) (not (= 400 (select (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1365)) .cse1)))) (forall ((v_ArrVal_1365 Int) (v_ArrVal_1364 (Array Int Int))) (not (= (select (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1364) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1365)) .cse1) 400))))) is different from false [2023-12-02 13:28:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:39,063 INFO L93 Difference]: Finished difference Result 1157 states and 2362 transitions. [2023-12-02 13:28:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 13:28:39,064 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 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 13:28:39,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:39,065 INFO L225 Difference]: With dead ends: 1157 [2023-12-02 13:28:39,065 INFO L226 Difference]: Without dead ends: 1157 [2023-12-02 13:28:39,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=285, Invalid=1040, Unknown=19, NotChecked=216, Total=1560 [2023-12-02 13:28:39,066 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 264 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 46 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 437 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:39,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 265 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 762 Invalid, 8 Unknown, 437 Unchecked, 0.8s Time] [2023-12-02 13:28:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2023-12-02 13:28:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1081. [2023-12-02 13:28:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1071 states have (on average 2.082166199813259) internal successors, (2230), 1080 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 2230 transitions. [2023-12-02 13:28:39,080 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 2230 transitions. Word has length 26 [2023-12-02 13:28:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:39,080 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 2230 transitions. [2023-12-02 13:28:39,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 2230 transitions. [2023-12-02 13:28:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 13:28:39,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:39,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:39,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 13:28:39,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 13:28:39,283 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:39,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash -103537791, now seen corresponding path program 2 times [2023-12-02 13:28:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302940282] [2023-12-02 13:28:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:39,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302940282] [2023-12-02 13:28:39,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302940282] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858546342] [2023-12-02 13:28:39,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:28:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:39,756 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:39,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 13:28:39,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 13:28:39,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:28:39,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-02 13:28:39,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:40,051 INFO L349 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2023-12-02 13:28:40,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 67 [2023-12-02 13:28:40,061 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:28:40,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2023-12-02 13:28:40,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2023-12-02 13:28:40,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-12-02 13:28:40,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-12-02 13:28:40,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2023-12-02 13:28:40,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 13:28:40,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-12-02 13:28:40,744 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 41 treesize of output 31 [2023-12-02 13:28:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:40,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:40,836 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1451 Int) (v_ArrVal_1450 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1450) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1451)) .cse1)) 400))) is different from false [2023-12-02 13:28:40,843 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1450 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1449) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1450) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1451)) .cse1))))) is different from false [2023-12-02 13:28:40,851 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1450 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1449) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1450) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1451)) .cse1)) 400))) is different from false [2023-12-02 13:28:40,865 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1450 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1449) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1450) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1451)) .cse1))))) is different from false [2023-12-02 13:28:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 13:28:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858546342] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:41,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [179599107] [2023-12-02 13:28:41,036 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 13:28:41,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:41,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 28 [2023-12-02 13:28:41,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834334978] [2023-12-02 13:28:41,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:41,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 13:28:41,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:41,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 13:28:41,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=465, Unknown=11, NotChecked=196, Total=812 [2023-12-02 13:28:41,038 INFO L87 Difference]: Start difference. First operand 1081 states and 2230 transitions. Second operand has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:42,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1451 Int)) (not (= 400 (select (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1451)) .cse1)))) (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1450 (Array Int Int))) (not (= 400 (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1449) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1450) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1451)) .cse1)))))) is different from false [2023-12-02 13:28:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:28:42,415 INFO L93 Difference]: Finished difference Result 1193 states and 2414 transitions. [2023-12-02 13:28:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 13:28:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 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 13:28:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:28:42,417 INFO L225 Difference]: With dead ends: 1193 [2023-12-02 13:28:42,417 INFO L226 Difference]: Without dead ends: 1193 [2023-12-02 13:28:42,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=286, Invalid=982, Unknown=12, NotChecked=360, Total=1640 [2023-12-02 13:28:42,418 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 196 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:28:42,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 281 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 817 Invalid, 0 Unknown, 887 Unchecked, 0.8s Time] [2023-12-02 13:28:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2023-12-02 13:28:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1021. [2023-12-02 13:28:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1011 states have (on average 2.0633036597428287) internal successors, (2086), 1020 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 2086 transitions. [2023-12-02 13:28:42,440 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 2086 transitions. Word has length 26 [2023-12-02 13:28:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:28:42,440 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 2086 transitions. [2023-12-02 13:28:42,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 2086 transitions. [2023-12-02 13:28:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 13:28:42,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:28:42,442 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:28:42,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 13:28:42,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 13:28:42,642 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:28:42,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:28:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1690911875, now seen corresponding path program 4 times [2023-12-02 13:28:42,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:28:42,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841263715] [2023-12-02 13:28:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:28:42,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:28:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:43,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:28:43,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841263715] [2023-12-02 13:28:43,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841263715] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:28:43,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131419491] [2023-12-02 13:28:43,577 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 13:28:43,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:28:43,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:28:43,578 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:28:43,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 13:28:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:28:43,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-02 13:28:43,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:28:43,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:43,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:43,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:28:43,751 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:28:43,751 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:28:43,768 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:28:43,768 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 13:28:43,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:28:43,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2023-12-02 13:28:44,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2023-12-02 13:28:44,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-12-02 13:28:44,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:44,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2023-12-02 13:28:44,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2023-12-02 13:28:44,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 69 [2023-12-02 13:28:44,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 193 [2023-12-02 13:28:44,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:28:44,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 521 treesize of output 432 [2023-12-02 13:28:45,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 529 treesize of output 439 [2023-12-02 13:28:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:28:45,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:28:45,456 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int)) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1541) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1545)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-12-02 13:28:45,479 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1541) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1545)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-12-02 13:28:45,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1539 Int) (v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int)) (or (< (+ .cse0 1) v_ArrVal_1541) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1539) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1539) .cse3 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_1545)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) (= 400 .cse0)))) is different from false [2023-12-02 13:28:47,722 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int) (v_ArrVal_1538 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1536) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1538)))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1539) .cse1 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1545)) .cse3) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1539) (= .cse4 400) (< (+ .cse4 1) v_ArrVal_1541)))))) is different from false [2023-12-02 13:28:47,756 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int) (v_ArrVal_1535 Int) (v_ArrVal_1538 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1535)))) (let ((.cse0 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1536) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1538)))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (select .cse0 .cse4))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1535) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1539) (= 400 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1539) .cse4 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1545)) .cse1) 2147483647) (< (+ .cse2 1) v_ArrVal_1541)))))) is different from false [2023-12-02 13:28:47,822 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int) (v_ArrVal_1535 Int) (v_ArrVal_1538 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1533))) (store .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1535))))) (let ((.cse1 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1536) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1538)))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse1 .cse4))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1535) (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1539) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1539) .cse4 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1545)) .cse2) 2147483647) (< (+ .cse0 1) v_ArrVal_1541)))))) is different from false [2023-12-02 13:28:47,867 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int) (v_ArrVal_1535 Int) (v_ArrVal_1538 Int)) (let ((.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1533))) (store .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse6 v_ArrVal_1535))))) (let ((.cse1 (let ((.cse7 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1536) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1538)))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse1 .cse4))) (or (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1539) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1539) .cse4 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1545)) .cse2) 2147483647) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse6) 1) v_ArrVal_1535) (< (+ .cse0 1) v_ArrVal_1541))))))) is different from false [2023-12-02 13:28:47,910 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1531 Int) (v_ArrVal_1545 Int) (v_ArrVal_1535 Int) (v_ArrVal_1538 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1533) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1533) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse7 v_ArrVal_1535)))) (let ((.cse3 (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1536) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1538)))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1539) .cse1 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1545)) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1539) (= 400 .cse5) (< (+ .cse5 1) v_ArrVal_1541) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1531) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1535))))))) is different from false [2023-12-02 13:28:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-12-02 13:28:53,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131419491] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:28:53,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [563815873] [2023-12-02 13:28:53,818 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 13:28:53,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:28:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36 [2023-12-02 13:28:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110195263] [2023-12-02 13:28:53,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:28:53,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 13:28:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:28:53,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 13:28:53,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=661, Unknown=13, NotChecked=504, Total=1406 [2023-12-02 13:28:53,820 INFO L87 Difference]: Start difference. First operand 1021 states and 2086 transitions. Second operand has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:28:56,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:28:58,456 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 13:29:00,461 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 13:29:02,470 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 13:29:04,478 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 13:29:06,484 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 13:29:08,493 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 13:29:10,509 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 13:29:12,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:29:14,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:29:16,528 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 13:29:26,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:28,835 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 13:29:30,843 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 13:29:32,851 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 13:29:34,857 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 13:29:36,864 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 13:29:38,869 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 13:29:40,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:29:42,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:29:44,891 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 13:29:46,929 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 13:29:49,003 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 13:30:01,382 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 13:30:03,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:05,442 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 13:30:07,451 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 13:30:09,458 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 13:30:11,461 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 13:30:13,477 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 13:30:15,480 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 13:30:17,578 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 13:30:19,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:21,590 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 13:30:25,847 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int)) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1541) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1545)) .cse2) 2147483647))) (forall ((v_ArrVal_1539 Int) (v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int) (v_ArrVal_1538 Int)) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1538)))) (let ((.cse3 (select .cse4 .cse1))) (or (= 400 .cse3) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1539) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_1539) .cse1 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_1545)) .cse2) 2147483647) (< (+ .cse3 1) v_ArrVal_1541))))) (forall ((v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int)) (< (select (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1545)) .cse2) 2147483647)))) is different from false [2023-12-02 13:30:25,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1539 Int) (v_ArrVal_1541 Int) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int) (v_ArrVal_1538 Int)) (let ((.cse1 (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1538)))) (let ((.cse0 (select .cse1 .cse4))) (or (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1539) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1539) .cse4 v_ArrVal_1541)) |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_1545)) .cse2) 2147483647) (< (+ .cse0 1) v_ArrVal_1541))))) (forall ((v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1545 Int)) (< (select (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1543) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse4) 4)) v_ArrVal_1545)) .cse2) 2147483647)))) is different from false [2023-12-02 13:30:27,950 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 13:30:29,972 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 13:30:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:30,378 INFO L93 Difference]: Finished difference Result 1638 states and 3326 transitions. [2023-12-02 13:30:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 13:30:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 13:30:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:30,381 INFO L225 Difference]: With dead ends: 1638 [2023-12-02 13:30:30,381 INFO L226 Difference]: Without dead ends: 1638 [2023-12-02 13:30:30,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=521, Invalid=1553, Unknown=36, NotChecked=970, Total=3080 [2023-12-02 13:30:30,383 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 550 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 43 mSolverCounterUnsat, 123 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 3998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 123 IncrementalHoareTripleChecker+Unknown, 3031 IncrementalHoareTripleChecker+Unchecked, 74.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:30,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 328 Invalid, 3998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 801 Invalid, 123 Unknown, 3031 Unchecked, 74.4s Time] [2023-12-02 13:30:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2023-12-02 13:30:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1155. [2023-12-02 13:30:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1145 states have (on average 2.0820960698689954) internal successors, (2384), 1154 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2384 transitions. [2023-12-02 13:30:30,402 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2384 transitions. Word has length 28 [2023-12-02 13:30:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:30,402 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 2384 transitions. [2023-12-02 13:30:30,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2384 transitions. [2023-12-02 13:30:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 13:30:30,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:30,404 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:30,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 13:30:30,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:30,604 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:30:30,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash -669919895, now seen corresponding path program 5 times [2023-12-02 13:30:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48386737] [2023-12-02 13:30:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:31,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:31,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48386737] [2023-12-02 13:30:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48386737] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:30:31,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459918614] [2023-12-02 13:30:31,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:30:31,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:31,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:30:31,628 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:30:31,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 13:30:31,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 13:30:31,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:30:31,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-02 13:30:31,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:30:31,925 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:30:31,925 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 13:30:31,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:30:31,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:30:31,949 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:30:31,949 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:30:32,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:30:32,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2023-12-02 13:30:32,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-12-02 13:30:32,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2023-12-02 13:30:32,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:30:32,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2023-12-02 13:30:32,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2023-12-02 13:30:32,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 69 [2023-12-02 13:30:33,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 182 [2023-12-02 13:30:37,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:30:37,306 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 499 treesize of output 418 [2023-12-02 13:30:41,581 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 507 treesize of output 425 [2023-12-02 13:30:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:41,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:30:41,901 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select .cse1 .cse2))) (or (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1636 Int)) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1630) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1630))) (= 400 .cse3)))) is different from false [2023-12-02 13:30:43,176 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1625 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1625)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1626))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1627) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1628)))) (let ((.cse5 (select .cse3 .cse1)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1630) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse4) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1625) (= 400 .cse5) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1630)))))) is different from false [2023-12-02 13:30:43,230 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1625 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1625)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1626))) (let ((.cse3 (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1627) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1628)))) (let ((.cse5 (select .cse3 .cse1)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1630) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse4) 2147483647) (= 400 .cse5) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1630) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1625))))))) is different from false [2023-12-02 13:30:43,277 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1623 Int) (v_ArrVal_1625 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1623) .cse7 v_ArrVal_1625)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1626))) (let ((.cse4 (let ((.cse8 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1627) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1628)))) (let ((.cse0 (select .cse4 .cse2)) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1630) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1636)) .cse5) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1630) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1623) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1625))))))) is different from false [2023-12-02 13:30:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2023-12-02 13:30:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459918614] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:30:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2135391250] [2023-12-02 13:30:57,758 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 13:30:57,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:30:57,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36 [2023-12-02 13:30:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388649615] [2023-12-02 13:30:57,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:30:57,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 13:30:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:57,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 13:30:57,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=834, Unknown=37, NotChecked=268, Total=1406 [2023-12-02 13:30:57,760 INFO L87 Difference]: Start difference. First operand 1155 states and 2384 transitions. Second operand has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:31:04,926 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 13:31:07,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:31:09,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:31:16,161 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 13:31:18,216 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 13:31:20,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:31:22,298 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 13:31:24,346 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 13:31:26,402 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 13:31:28,428 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 13:31:30,436 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 13:31:32,498 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 13:31:34,519 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 13:31:36,526 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 13:31:38,625 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 13:31:40,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:31:40,970 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1636 Int)) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1630) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse5) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1630))) (= 400 .cse4)))) (forall ((v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1636 Int)) (let ((.cse8 (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1628)))) (let ((.cse6 (select .cse8 .cse1))) (or (= 400 .cse6) (< (select (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_1630) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1636)) .cse5) 2147483647) (< (+ (select .cse8 .cse5) 1) v_ArrVal_1630))))))) is different from false [2023-12-02 13:31:43,053 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 13:31:49,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse7 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1636 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647)) (forall ((v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1636 Int)) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_1628))) (let ((.cse3 (select .cse5 .cse1))) (or (= 400 .cse3) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_1630) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_1636)) .cse2) 2147483647) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1630))))) (forall ((v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse10 (let ((.cse11 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1627) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) v_ArrVal_1628)))) (let ((.cse8 (select .cse10 .cse1))) (or (= 400 .cse8) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_1630) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647) (< (+ (select .cse10 .cse2) 1) v_ArrVal_1630))))) (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1636 Int)) (< (select (let ((.cse12 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse14 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647)) (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1636 Int)) (< (select (let ((.cse15 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse14 (+ (select .cse13 .cse14) 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse15 (+ (* 4 (select .cse15 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647))) (forall ((v_ArrVal_1636 Int)) (< (select (store .cse6 .cse7 v_ArrVal_1636) .cse2) 2147483647))))) is different from false [2023-12-02 13:31:51,878 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 13:31:53,892 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 13:31:53,933 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse16 (+ (select .cse18 .cse19) 1)) (.cse7 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1636 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647)) (forall ((v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1636 Int)) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_1628))) (let ((.cse3 (select .cse5 .cse1))) (or (= 400 .cse3) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_1630) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_1636)) .cse2) 2147483647) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1630))))) (forall ((v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse10 (let ((.cse11 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1627) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) v_ArrVal_1628)))) (let ((.cse8 (select .cse10 .cse1))) (or (= 400 .cse8) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_1630) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647) (< (+ (select .cse10 .cse2) 1) v_ArrVal_1630))))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1625 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse18 .cse19 v_ArrVal_1625)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1626))) (let ((.cse14 (let ((.cse17 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1627) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1628)))) (let ((.cse15 (select .cse14 .cse1))) (or (< (select (let ((.cse12 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse2 v_ArrVal_1630) .cse1 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647) (= 400 .cse15) (< (+ (select .cse14 .cse2) 1) v_ArrVal_1630) (< .cse16 v_ArrVal_1625)))))) (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1636 Int)) (< (select (let ((.cse20 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse18 .cse19 .cse16)) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse20 (+ (* 4 (select .cse20 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647))) (forall ((v_ArrVal_1636 Int)) (< (select (store .cse6 .cse7 v_ArrVal_1636) .cse2) 2147483647))))) is different from false [2023-12-02 13:31:55,947 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 13:32:00,939 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 13:32:02,946 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 13:32:02,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse6 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1625 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1625)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1626))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1627) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1628)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1630) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse4) 2147483647) (< .cse6 v_ArrVal_1625) (= 400 .cse5) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1630)))))) (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1636 Int)) (< (select (let ((.cse10 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse4) 2147483647)))) is different from false [2023-12-02 13:32:04,983 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 13:32:05,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1636 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647)) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1628 Int) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1626))) (let ((.cse5 (let ((.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1627) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1628)))) (let ((.cse6 (select .cse5 .cse1))) (or (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_1630) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1634) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1636)) .cse2) 2147483647) (= 400 .cse6) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1630)))))))) is different from false [2023-12-02 13:32:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:32:06,559 INFO L93 Difference]: Finished difference Result 1879 states and 3778 transitions. [2023-12-02 13:32:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 13:32:06,559 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 13:32:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:32:06,561 INFO L225 Difference]: With dead ends: 1879 [2023-12-02 13:32:06,562 INFO L226 Difference]: Without dead ends: 1879 [2023-12-02 13:32:06,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=675, Invalid=2039, Unknown=78, NotChecked=990, Total=3782 [2023-12-02 13:32:06,563 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 441 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 62 mSolverCounterUnsat, 221 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 221 IncrementalHoareTripleChecker+Unknown, 2016 IncrementalHoareTripleChecker+Unchecked, 51.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:32:06,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 293 Invalid, 3312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1013 Invalid, 221 Unknown, 2016 Unchecked, 51.9s Time] [2023-12-02 13:32:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2023-12-02 13:32:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1345. [2023-12-02 13:32:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1335 states have (on average 2.1198501872659175) internal successors, (2830), 1344 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:32:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2830 transitions. [2023-12-02 13:32:06,586 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2830 transitions. Word has length 28 [2023-12-02 13:32:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:32:06,586 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 2830 transitions. [2023-12-02 13:32:06,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:32:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2830 transitions. [2023-12-02 13:32:06,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 13:32:06,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:32:06,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:32:06,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-02 13:32:06,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:32:06,788 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:32:06,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:32:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1275655061, now seen corresponding path program 6 times [2023-12-02 13:32:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:32:06,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322739227] [2023-12-02 13:32:06,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:32:06,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:32:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:32:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:32:07,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:32:07,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322739227] [2023-12-02 13:32:07,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322739227] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:32:07,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624545835] [2023-12-02 13:32:07,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:32:07,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:32:07,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:32:07,796 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:32:07,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 13:32:07,955 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:32:07,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:32:07,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 13:32:07,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:32:07,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:32:07,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:32:07,976 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:32:07,988 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:32:07,988 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:32:08,013 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:32:08,013 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 13:32:08,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:32:08,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2023-12-02 13:32:08,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-12-02 13:32:08,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:32:08,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2023-12-02 13:32:08,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2023-12-02 13:32:08,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 69 [2023-12-02 13:32:09,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 180 [2023-12-02 13:32:09,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 193 [2023-12-02 13:32:09,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:32:09,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 521 treesize of output 432 [2023-12-02 13:32:09,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 529 treesize of output 439 [2023-12-02 13:32:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:32:09,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:32:10,080 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 Int) (v_ArrVal_1724 Int)) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1724) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1724)) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_1726)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-12-02 13:32:10,102 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1724 Int)) (or (< (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1724))) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_1726)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1724))) is different from false [2023-12-02 13:32:11,127 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 Int) (v_ArrVal_1724 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1721)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 v_ArrVal_1724)) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_1726)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1724) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1721)))) is different from false [2023-12-02 13:32:19,492 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1726 Int) (v_ArrVal_1718 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 Int) (v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1724 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1715)))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1717))) (let ((.cse0 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse1))) v_ArrVal_1718))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1724) (< (select (let ((.cse2 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base| (store (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 .cse5 v_ArrVal_1721)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base|) .cse1 v_ArrVal_1724)) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1726)) .cse5) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1715) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1721)))))) is different from false [2023-12-02 13:32:19,550 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1726 Int) (v_ArrVal_1718 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 Int) (v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1724 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1715)))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1717))) (let ((.cse0 (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse1))) v_ArrVal_1718))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1724) (< (select (let ((.cse2 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base| (store (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 .cse5 v_ArrVal_1721)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base|) .cse1 v_ArrVal_1724)) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1726)) .cse5) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1715) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1721))))))) is different from false [2023-12-02 13:32:19,590 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1726 Int) (v_ArrVal_1718 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 Int) (v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1713 Int) (v_ArrVal_1724 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1713) .cse7 v_ArrVal_1715)))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1717))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) v_ArrVal_1718)))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1713) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1721) (< (select (let ((.cse2 (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base| (store (select (store (store .cse5 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1721)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base|) .cse3 v_ArrVal_1724)) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1726)) .cse1) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1724) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1715))))))) is different from false [2023-12-02 13:32:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-12-02 13:32:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624545835] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:32:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1752336929] [2023-12-02 13:32:30,041 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 13:32:30,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:32:30,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36 [2023-12-02 13:32:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629977428] [2023-12-02 13:32:30,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:32:30,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 13:32:30,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:32:30,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 13:32:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=768, Unknown=32, NotChecked=390, Total=1406 [2023-12-02 13:32:30,043 INFO L87 Difference]: Start difference. First operand 1345 states and 2830 transitions. Second operand has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:32:33,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:32:41,082 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 13:32:43,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:32:45,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:32:47,103 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 13:32:49,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:32:51,116 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 13:32:53,120 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 13:32:55,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:32:57,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:32:59,140 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 13:33:01,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:03,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:12,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:20,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:22,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:24,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:26,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:28,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:30,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:32,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:34,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:36,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:38,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:40,979 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 13:33:42,990 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 13:33:45,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:47,045 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 13:33:49,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:51,134 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 13:33:53,540 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 13:33:55,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:33:57,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:34:00,677 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 13:34:07,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (+ (select .cse13 .cse5) 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1726 Int)) (< (select (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1726)) .cse2) 2147483647)) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1724 Int)) (or (< (select (let ((.cse3 (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse5 v_ArrVal_1724))) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1726)) .cse2) 2147483647) (< .cse6 v_ArrVal_1724))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 Int)) (< (select (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) v_ArrVal_1726)) .cse2) 2147483647)) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1726 Int) (v_ArrVal_1718 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 Int) (v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1724 Int)) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse5 v_ArrVal_1715)))) (let ((.cse11 (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1717))) (let ((.cse8 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* 4 (select .cse12 .cse1))) v_ArrVal_1718)))) (or (< (+ (select .cse8 .cse1) 1) v_ArrVal_1724) (< (select (let ((.cse9 (select (store (store (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base| (store (select (store (store .cse11 |c_~#queue~0.base| (store .cse8 .cse2 v_ArrVal_1721)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base|) .cse1 v_ArrVal_1724)) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1726)) .cse2) 2147483647) (< .cse6 v_ArrVal_1715) (< (+ (select .cse8 .cse2) 1) v_ArrVal_1721))))))))) is different from false [2023-12-02 13:34:11,997 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 13:34:14,053 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 13:34:16,112 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 13:34:16,150 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1726 Int) (v_ArrVal_1718 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1721 Int) (v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1724 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse8 v_ArrVal_1715)))) (let ((.cse4 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1717))) (let ((.cse0 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) v_ArrVal_1718)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1724) (< (select (let ((.cse2 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base| (store (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 .cse5 v_ArrVal_1721)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722) |c_~#queue~0.base|) .cse1 v_ArrVal_1724)) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1726)) .cse5) 2147483647) (< .cse6 v_ArrVal_1715) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1721)))))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1724 Int)) (or (< (select (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1722))) (store .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse8 v_ArrVal_1724))) |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_1726)) .cse5) 2147483647) (< .cse6 v_ArrVal_1724))))) is different from false [2023-12-02 13:34:18,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:34:20,345 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 13:34:22,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:34:24,381 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 13:34:24,393 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1726 Int)) (< (select (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1726)) .cse2) 2147483647)) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 Int)) (< (select (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1725) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse1))) v_ArrVal_1726)) .cse2) 2147483647)))) is different from false [2023-12-02 13:34:26,463 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 13:34:28,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:34:31,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:34:33,893 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 13:34:35,901 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 13:34:37,909 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 13:34:39,916 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 13:34:41,919 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 13:34:43,926 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 13:34:45,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:34:47,939 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 13:34:49,946 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 13:34:51,965 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 13:34:53,979 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 13:34:56,007 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 13:34:58,017 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 13:35:00,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:35:02,029 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 13:35:04,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:35:06,754 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 13:35:08,762 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 13:35:10,768 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 13:35:12,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:35:14,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:35:16,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:35:18,795 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 13:35:20,802 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 13:35:22,812 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 13:35:24,819 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 13:35:26,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 13:35:29,745 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 13:35:31,758 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 13:35:33,822 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 13:35:35,829 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 13:35:37,840 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 13:35:39,845 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 13:35: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 13:35:43,852 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 13:35:45,884 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 13:35:47,919 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 13:35:49,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:35:51,942 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 13:35:54,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:35:56,140 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 13:35:58,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 13:36:00,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:36:02,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:36:04,258 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 13:36:06,268 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 13:36:08,275 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 13:36:10,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:36:12,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:36:14,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:36:16,829 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 13:36:18,842 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 13:36:20,849 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 13:36:22,856 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 13:36:25,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:36:27,446 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 13:36:29,456 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 13:36:31,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:36:33,468 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 13:36:36,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:36:38,050 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 13:36:40,055 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 13:36:42,060 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 13:36:44,110 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 13:36:46,145 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 13:36:48,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 13:36:50,160 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 13:36:52,880 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 13:36:54,914 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 13:36:56,925 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 13:36:58,935 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 13:37:00,962 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 13:37:02,968 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 13:37:04,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:37:07,010 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 13:37:09,013 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 13:37:11,122 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 13:37:13,141 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 13:37:15,152 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 13:37:17,157 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 13:37:19,411 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 13:37:21,425 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 13:37:23,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:37:25,457 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 13:37:27,465 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 13:37:29,608 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 13:37:31,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:37:33,642 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 13:37:35,646 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 13:37:37,727 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 13:37:39,733 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 13:37:41,737 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 13:37:43,739 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 13:37:45,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:37:47,750 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 13:37:49,755 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 13:37:51,761 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 13:37:53,768 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 13:37:55,773 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 13:37:57,779 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 13:37:59,785 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 13:38:01,924 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 13:38:03,932 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 13:38:05,937 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 13:38:07,945 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 13:38:09,950 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 13:38:11,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:38:13,966 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 13:38:15,972 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 13:38:17,980 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 13:38:19,985 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 13:38:21,993 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 13:38:23,998 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 13:38:26,304 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 13:38:29,086 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 13:38:31,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:38:33,199 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 13:38:35,204 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 13:38:37,214 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 13:38:39,720 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 13:38:41,727 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 13:38:43,752 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 13:38:45,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:38:47,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:38:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:38:47,823 INFO L93 Difference]: Finished difference Result 2080 states and 4288 transitions. [2023-12-02 13:38:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 13:38:47,823 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 13:38:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:38:47,826 INFO L225 Difference]: With dead ends: 2080 [2023-12-02 13:38:47,826 INFO L226 Difference]: Without dead ends: 2080 [2023-12-02 13:38:47,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=615, Invalid=2005, Unknown=68, NotChecked=972, Total=3660 [2023-12-02 13:38:47,827 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 383 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 77 mSolverCounterUnsat, 375 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 349.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 4677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 375 IncrementalHoareTripleChecker+Unknown, 2835 IncrementalHoareTripleChecker+Unchecked, 350.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:38:47,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 622 Invalid, 4677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1390 Invalid, 375 Unknown, 2835 Unchecked, 350.5s Time] [2023-12-02 13:38:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2023-12-02 13:38:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1328. [2023-12-02 13:38:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1318 states have (on average 2.1168437025796663) internal successors, (2790), 1327 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:38:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2790 transitions. [2023-12-02 13:38:47,847 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2790 transitions. Word has length 28 [2023-12-02 13:38:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:38:47,847 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 2790 transitions. [2023-12-02 13:38:47,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:38:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2790 transitions. [2023-12-02 13:38:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 13:38:47,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:38:47,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:38:47,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 13:38:48,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:38:48,049 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 13:38:48,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:38:48,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1891818475, now seen corresponding path program 7 times [2023-12-02 13:38:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:38:48,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584173964] [2023-12-02 13:38:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:38:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:38:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:38:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:38:48,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:38:48,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584173964] [2023-12-02 13:38:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584173964] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:38:48,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30645508] [2023-12-02 13:38:48,954 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 13:38:48,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:38:48,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:38:48,955 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:38:48,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_526debc2-ac8c-4444-9853-e108a5a8a1c9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 13:38:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:38:49,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 13:38:49,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:38:49,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:38:49,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:38:49,124 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:38:49,140 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 13:38:49,140 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:38:49,158 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:38:49,158 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 13:38:49,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-02 13:38:49,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2023-12-02 13:38:49,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-12-02 13:38:49,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:38:49,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2023-12-02 13:38:49,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2023-12-02 13:38:49,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 69 [2023-12-02 13:38:50,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 193 [2023-12-02 13:38:50,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:38:50,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 521 treesize of output 432 [2023-12-02 13:38:50,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 521 treesize of output 432 [2023-12-02 13:38:50,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 529 treesize of output 439 [2023-12-02 13:38:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:38:50,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:38:51,050 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1818 Int) (v_ArrVal_1816 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_1818)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 13:38:51,057 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1818 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_1818)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 13:38:51,264 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1818 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1813) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_1818)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-12-02 13:38:57,971 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 Int) (v_ArrVal_1818 Int) (v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1806)))) (let ((.cse0 (let ((.cse5 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1808) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1810))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1813) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1806) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1812) (< (select (let ((.cse3 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1812) .cse1 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse2) 2147483647))))) is different from false [2023-12-02 13:38:58,021 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 Int) (v_ArrVal_1818 Int) (v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1806)))) (let ((.cse0 (let ((.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1808) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1810))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1813) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1812) (< (select (let ((.cse3 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1812) .cse1 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse2) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1806)))))) is different from false [2023-12-02 13:38:58,059 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1804 Int) (v_ArrVal_1806 Int) (v_ArrVal_1818 Int) (v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1804) .cse6 v_ArrVal_1806)))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1808) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1810))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1812) .cse1 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1818)) .cse4) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1813) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1804) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1812) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1806)))))) is different from false [2023-12-02 13:39:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-02 13:39:07,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30645508] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:39:07,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [370096612] [2023-12-02 13:39:07,007 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 13:39:07,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:39:07,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36 [2023-12-02 13:39:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093934023] [2023-12-02 13:39:07,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:39:07,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 13:39:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:39:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 13:39:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=731, Unknown=23, NotChecked=390, Total=1406 [2023-12-02 13:39:07,009 INFO L87 Difference]: Start difference. First operand 1328 states and 2790 transitions. Second operand has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:39:09,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:39:13,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:39:17,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:39:19,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:39:21,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:39:24,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:39:26,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:39:26,660 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (+ (select .cse3 .cse4) 1)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse18 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1818 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int))) (or (< .cse0 v_ArrVal_1813) (< (select (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1818)) .cse5) 2147483647))) (forall ((v_ArrVal_1806 Int) (v_ArrVal_1818 Int) (v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1806)))) (let ((.cse6 (let ((.cse9 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1808) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1810)))) (or (< (+ (select .cse6 .cse2) 1) v_ArrVal_1813) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1812) (< (select (let ((.cse7 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1812) .cse2 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse5) 2147483647) (< .cse0 v_ArrVal_1806))))) (forall ((v_ArrVal_1818 Int) (v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse11 (let ((.cse12 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1808) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1810)))) (or (< (select (let ((.cse10 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_1812) .cse2 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse5) 2147483647) (< (+ (select .cse11 .cse2) 1) v_ArrVal_1813) (< (+ (select .cse11 .cse5) 1) v_ArrVal_1812)))) (forall ((v_ArrVal_1804 Int) (v_ArrVal_1803 Int) (v_ArrVal_1806 Int) (v_ArrVal_1818 Int) (v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse15 (store .cse17 .cse18 v_ArrVal_1803))) (let ((.cse14 (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_1804) .cse2 v_ArrVal_1806)) |c_~#stored_elements~0.base| v_ArrVal_1808) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1810)))) (or (< (select (let ((.cse13 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_1812) .cse2 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse5) 2147483647) (< (+ (select .cse14 .cse2) 1) v_ArrVal_1813) (< (+ (select .cse15 .cse2) 1) v_ArrVal_1806) (< (+ (select .cse14 .cse5) 1) v_ArrVal_1812) (< (+ (select .cse15 .cse5) 1) v_ArrVal_1804))))) (forall ((v_ArrVal_1818 Int)) (< (select (store .cse17 .cse18 v_ArrVal_1818) .cse5) 2147483647)) (forall ((v_ArrVal_1818 Int) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse19 (store .cse17 .cse18 v_ArrVal_1810))) (or (< (+ (select .cse19 .cse5) 1) v_ArrVal_1812) (< (+ (select .cse19 .cse2) 1) v_ArrVal_1813) (< (select (let ((.cse20 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse5 v_ArrVal_1812) .cse2 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse5) 2147483647))))))) is different from false [2023-12-02 13:39:26,690 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1818 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int))) (or (< .cse0 v_ArrVal_1813) (< (select (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1818)) .cse5) 2147483647))) (forall ((v_ArrVal_1806 Int) (v_ArrVal_1818 Int) (v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1806)))) (let ((.cse6 (let ((.cse9 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1808) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1810)))) (or (< (+ (select .cse6 .cse2) 1) v_ArrVal_1813) (< .cse0 v_ArrVal_1806) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1812) (< (select (let ((.cse7 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1812) .cse2 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse5) 2147483647))))))) is different from false [2023-12-02 13:39:26,745 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1818 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1818)) .cse2) 2147483647)) (forall ((v_ArrVal_1818 Int) (v_ArrVal_1808 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse4 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1808) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1810)))) (or (< (select (let ((.cse3 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_1812) .cse1 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse2) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1813) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1812)))))) is different from false [2023-12-02 13:39:26,759 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1818 Int) (v_ArrVal_1816 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse2) 2147483647)) (forall ((v_ArrVal_1818 Int) (v_ArrVal_1810 Int) (v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1813 Int) (v_ArrVal_1815 (Array Int Int)) (v_ArrVal_1812 Int)) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1810)))) (or (< (+ (select .cse3 .cse2) 1) v_ArrVal_1812) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1813) (< (select (let ((.cse4 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1812) .cse1 v_ArrVal_1813)) |c_~#stored_elements~0.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1816) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1818)) .cse2) 2147483647)))))) is different from false [2023-12-02 13:39:28,830 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 13:39:30,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 13:39:32,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:39:34,438 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 13:39:36,445 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 13:39:38,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:39:40,466 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 13:39:42,495 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 13:39:44,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:39:46,562 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 13:39:48,587 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 13:39:50,591 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 13:39:52,606 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 13:39:54,618 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 13:39:56,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:39:58,678 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 13:40:00,686 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 13:40:02,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:40:04,180 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 13:40:06,189 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 13:40:08,221 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 13:40:10,982 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 13:40:13,097 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 13:40:15,110 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 13:40:17,386 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 13:40:19,400 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 13:40:21,411 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 13:40:23,425 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 13:40:25,443 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 13:40:27,686 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 13:40:30,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:40:32,462 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 13:40:34,498 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 13:40:36,691 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 13:40:38,696 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 13:40:40,708 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 13:40:42,729 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 13:40:43,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:40:45,858 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 13:40:47,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:40:50,054 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 13:40:52,193 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 13:40:54,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:40:56,245 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]