./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue.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_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/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_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/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_34823443-f954-42a9-a525-7dc455bf0324/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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:43:25,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:43:25,308 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 13:43:25,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:43:25,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:43:25,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:43:25,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:43:25,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:43:25,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:43:25,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:43:25,338 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:43:25,339 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:43:25,339 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:43:25,340 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:43:25,340 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:43:25,341 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:43:25,341 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:43:25,342 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:43:25,342 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:43:25,343 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:43:25,343 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:43:25,344 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:43:25,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:43:25,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:43:25,346 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:43:25,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:43:25,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:43:25,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:43:25,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:43:25,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:43:25,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:43:25,348 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 13:43:25,349 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:43:25,349 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:43:25,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:43:25,349 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:43:25,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:43:25,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:43:25,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:43:25,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:43:25,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:43:25,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:43:25,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:43:25,351 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:43:25,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:43:25,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:43:25,352 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:43:25,352 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:43:25,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:43:25,352 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_34823443-f954-42a9-a525-7dc455bf0324/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_34823443-f954-42a9-a525-7dc455bf0324/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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2023-12-02 13:43:25,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:43:25,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:43:25,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:43:25,575 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:43:25,576 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:43:25,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread/queue.i [2023-12-02 13:43:28,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:43:28,694 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:43:28,695 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/sv-benchmarks/c/pthread/queue.i [2023-12-02 13:43:28,712 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/data/b49883b77/37b12c82f6904fbd9bd8c23a17bb6c05/FLAG3f4d31717 [2023-12-02 13:43:28,726 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/data/b49883b77/37b12c82f6904fbd9bd8c23a17bb6c05 [2023-12-02 13:43:28,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:43:28,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:43:28,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:43:28,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:43:28,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:43:28,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:43:28" (1/1) ... [2023-12-02 13:43:28,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb95b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:28, skipping insertion in model container [2023-12-02 13:43:28,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:43:28" (1/1) ... [2023-12-02 13:43:28,794 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:43:29,185 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:43:29,198 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:43:29,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:43:29,343 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:43:29,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29 WrapperNode [2023-12-02 13:43:29,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:43:29,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:43:29,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:43:29,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:43:29,353 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:43:29" (1/1) ... [2023-12-02 13:43:29,372 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:43:29" (1/1) ... [2023-12-02 13:43:29,401 INFO L138 Inliner]: procedures = 275, calls = 74, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 287 [2023-12-02 13:43:29,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:43:29,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:43:29,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:43:29,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:43:29,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (1/1) ... [2023-12-02 13:43:29,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (1/1) ... [2023-12-02 13:43:29,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (1/1) ... [2023-12-02 13:43:29,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (1/1) ... [2023-12-02 13:43:29,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (1/1) ... [2023-12-02 13:43:29,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (1/1) ... [2023-12-02 13:43:29,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (1/1) ... [2023-12-02 13:43:29,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (1/1) ... [2023-12-02 13:43:29,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:43:29,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:43:29,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:43:29,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:43:29,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (1/1) ... [2023-12-02 13:43:29,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:43:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:43:29,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/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:43:29,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/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:43:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-02 13:43:29,516 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-02 13:43:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-02 13:43:29,516 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-02 13:43:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:43:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:43:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 13:43:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 13:43:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 13:43:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 13:43:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:43:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:43:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:43:29,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:43:29,520 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:43:29,661 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:43:29,663 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:43:30,028 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:43:30,267 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:43:30,267 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 13:43:30,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:43:30 BoogieIcfgContainer [2023-12-02 13:43:30,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:43:30,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:43:30,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:43:30,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:43:30,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:43:28" (1/3) ... [2023-12-02 13:43:30,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d62f473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:43:30, skipping insertion in model container [2023-12-02 13:43:30,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:29" (2/3) ... [2023-12-02 13:43:30,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d62f473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:43:30, skipping insertion in model container [2023-12-02 13:43:30,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:43:30" (3/3) ... [2023-12-02 13:43:30,277 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2023-12-02 13:43:30,287 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 13:43:30,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:43:30,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-12-02 13:43:30,297 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 13:43:30,375 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 13:43:30,407 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 87 transitions, 188 flow [2023-12-02 13:43:30,515 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2063 states, 1973 states have (on average 2.784591991890522) internal successors, (5494), 2062 states have internal predecessors, (5494), 0 states have call successors, (0), 0 states have 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:43:30,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:43:30,538 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;@5d1bffef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:43:30,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-12-02 13:43:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 2063 states, 1973 states have (on average 2.784591991890522) internal successors, (5494), 2062 states have internal predecessors, (5494), 0 states have call successors, (0), 0 states have 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:43:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 13:43:30,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:30,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:30,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:30,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash -417298804, now seen corresponding path program 1 times [2023-12-02 13:43:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:30,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639971959] [2023-12-02 13:43:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:31,243 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:43:31,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:31,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639971959] [2023-12-02 13:43:31,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639971959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:31,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:31,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:43:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672233475] [2023-12-02 13:43:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:31,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:43:31,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:43:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:43:31,284 INFO L87 Difference]: Start difference. First operand has 2063 states, 1973 states have (on average 2.784591991890522) internal successors, (5494), 2062 states have internal predecessors, (5494), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:43:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:31,546 INFO L93 Difference]: Finished difference Result 2151 states and 5678 transitions. [2023-12-02 13:43:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:43:31,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-12-02 13:43:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:31,580 INFO L225 Difference]: With dead ends: 2151 [2023-12-02 13:43:31,580 INFO L226 Difference]: Without dead ends: 2151 [2023-12-02 13:43:31,582 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:43:31,585 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 34 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:31,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 118 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:43:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2023-12-02 13:43:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 2151. [2023-12-02 13:43:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 2055 states have (on average 2.76301703163017) internal successors, (5678), 2150 states have internal predecessors, (5678), 0 states have call successors, (0), 0 states have 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:43:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 5678 transitions. [2023-12-02 13:43:31,760 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 5678 transitions. Word has length 7 [2023-12-02 13:43:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:31,761 INFO L495 AbstractCegarLoop]: Abstraction has 2151 states and 5678 transitions. [2023-12-02 13:43:31,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:43:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 5678 transitions. [2023-12-02 13:43:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:43:31,762 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:31,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:43:31,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:31,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash -51419889, now seen corresponding path program 1 times [2023-12-02 13:43:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923863112] [2023-12-02 13:43:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:31,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:32,145 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:43:32,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:32,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923863112] [2023-12-02 13:43:32,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923863112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:32,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:32,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:43:32,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091020299] [2023-12-02 13:43:32,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:32,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:43:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:32,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:43:32,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:43:32,149 INFO L87 Difference]: Start difference. First operand 2151 states and 5678 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:43:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:32,483 INFO L93 Difference]: Finished difference Result 2439 states and 6421 transitions. [2023-12-02 13:43:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:43:32,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:43:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:32,505 INFO L225 Difference]: With dead ends: 2439 [2023-12-02 13:43:32,505 INFO L226 Difference]: Without dead ends: 2439 [2023-12-02 13:43:32,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:43:32,507 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:32,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 163 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:43:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2023-12-02 13:43:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2229. [2023-12-02 13:43:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2133 states have (on average 2.757149554617909) internal successors, (5881), 2228 states have internal predecessors, (5881), 0 states have call successors, (0), 0 states have 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:43:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 5881 transitions. [2023-12-02 13:43:32,597 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 5881 transitions. Word has length 8 [2023-12-02 13:43:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:32,597 INFO L495 AbstractCegarLoop]: Abstraction has 2229 states and 5881 transitions. [2023-12-02 13:43:32,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:43:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 5881 transitions. [2023-12-02 13:43:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:43:32,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:32,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:32,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:43:32,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:32,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2112527856, now seen corresponding path program 1 times [2023-12-02 13:43:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807054632] [2023-12-02 13:43:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:32,978 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:43:32,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:32,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807054632] [2023-12-02 13:43:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807054632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:43:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777287897] [2023-12-02 13:43:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:32,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:43:32,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:32,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:43:32,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:43:32,981 INFO L87 Difference]: Start difference. First operand 2229 states and 5881 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have 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:43:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:33,347 INFO L93 Difference]: Finished difference Result 2409 states and 6390 transitions. [2023-12-02 13:43:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:43:33,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-02 13:43:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:33,368 INFO L225 Difference]: With dead ends: 2409 [2023-12-02 13:43:33,369 INFO L226 Difference]: Without dead ends: 2409 [2023-12-02 13:43:33,369 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:43:33,370 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:33,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 254 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2023-12-02 13:43:33,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2273. [2023-12-02 13:43:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 2177 states have (on average 2.7537896187413873) internal successors, (5995), 2272 states have internal predecessors, (5995), 0 states have call successors, (0), 0 states have 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:43:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 5995 transitions. [2023-12-02 13:43:33,462 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 5995 transitions. Word has length 10 [2023-12-02 13:43:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:33,462 INFO L495 AbstractCegarLoop]: Abstraction has 2273 states and 5995 transitions. [2023-12-02 13:43:33,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have 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:43:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 5995 transitions. [2023-12-02 13:43:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 13:43:33,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:33,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:33,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 13:43:33,465 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:33,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:33,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1123019279, now seen corresponding path program 1 times [2023-12-02 13:43:33,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:33,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360737295] [2023-12-02 13:43:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:33,832 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:43:33,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360737295] [2023-12-02 13:43:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360737295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:33,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:33,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:43:33,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100314259] [2023-12-02 13:43:33,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:33,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:43:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:33,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:43:33,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:43:33,835 INFO L87 Difference]: Start difference. First operand 2273 states and 5995 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:43:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:34,171 INFO L93 Difference]: Finished difference Result 2530 states and 6689 transitions. [2023-12-02 13:43:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:43:34,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:43:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:34,193 INFO L225 Difference]: With dead ends: 2530 [2023-12-02 13:43:34,194 INFO L226 Difference]: Without dead ends: 2530 [2023-12-02 13:43:34,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:43:34,195 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 126 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:34,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 229 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2023-12-02 13:43:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2395. [2023-12-02 13:43:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2299 states have (on average 2.7585906916050456) internal successors, (6342), 2394 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have 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:43:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 6342 transitions. [2023-12-02 13:43:34,290 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 6342 transitions. Word has length 11 [2023-12-02 13:43:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:34,290 INFO L495 AbstractCegarLoop]: Abstraction has 2395 states and 6342 transitions. [2023-12-02 13:43:34,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:43:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 6342 transitions. [2023-12-02 13:43:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 13:43:34,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:34,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:34,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 13:43:34,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:34,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash -800530924, now seen corresponding path program 1 times [2023-12-02 13:43:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136781198] [2023-12-02 13:43:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:34,351 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:43:34,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136781198] [2023-12-02 13:43:34,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136781198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:34,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:43:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006851525] [2023-12-02 13:43:34,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:34,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:43:34,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:34,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:43:34,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:43:34,354 INFO L87 Difference]: Start difference. First operand 2395 states and 6342 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:43:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:34,452 INFO L93 Difference]: Finished difference Result 2293 states and 5932 transitions. [2023-12-02 13:43:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:43:34,453 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:43:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:34,468 INFO L225 Difference]: With dead ends: 2293 [2023-12-02 13:43:34,468 INFO L226 Difference]: Without dead ends: 2293 [2023-12-02 13:43:34,469 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:43:34,470 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:34,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 56 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:43:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2023-12-02 13:43:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2137. [2023-12-02 13:43:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2073 states have (on average 2.743849493487699) internal successors, (5688), 2136 states have internal predecessors, (5688), 0 states have call successors, (0), 0 states have 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:43:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 5688 transitions. [2023-12-02 13:43:34,529 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 5688 transitions. Word has length 11 [2023-12-02 13:43:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:34,530 INFO L495 AbstractCegarLoop]: Abstraction has 2137 states and 5688 transitions. [2023-12-02 13:43:34,530 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:43:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 5688 transitions. [2023-12-02 13:43:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 13:43:34,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:34,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:34,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 13:43:34,532 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:34,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash -511076617, now seen corresponding path program 1 times [2023-12-02 13:43:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:34,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376969752] [2023-12-02 13:43:34,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:34,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:34,589 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:43:34,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376969752] [2023-12-02 13:43:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376969752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:34,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:43:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325229886] [2023-12-02 13:43:34,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:34,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:43:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:43:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:43:34,592 INFO L87 Difference]: Start difference. First operand 2137 states and 5688 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:34,834 INFO L93 Difference]: Finished difference Result 3765 states and 9976 transitions. [2023-12-02 13:43:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:43:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 13:43:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:34,861 INFO L225 Difference]: With dead ends: 3765 [2023-12-02 13:43:34,861 INFO L226 Difference]: Without dead ends: 3765 [2023-12-02 13:43:34,861 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:43:34,862 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 109 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:34,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 137 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:43:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2023-12-02 13:43:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3549. [2023-12-02 13:43:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3549 states, 3485 states have (on average 2.7661406025824964) internal successors, (9640), 3548 states have internal predecessors, (9640), 0 states have call successors, (0), 0 states have 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:43:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 9640 transitions. [2023-12-02 13:43:34,964 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 9640 transitions. Word has length 13 [2023-12-02 13:43:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:34,965 INFO L495 AbstractCegarLoop]: Abstraction has 3549 states and 9640 transitions. [2023-12-02 13:43:34,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 9640 transitions. [2023-12-02 13:43:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 13:43:34,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:34,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:34,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 13:43:34,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:34,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1755949945, now seen corresponding path program 1 times [2023-12-02 13:43:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:34,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2363446] [2023-12-02 13:43:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:35,251 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:43:35,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:35,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2363446] [2023-12-02 13:43:35,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2363446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:35,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:35,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:43:35,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139738014] [2023-12-02 13:43:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:35,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:43:35,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:35,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:43:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:43:35,254 INFO L87 Difference]: Start difference. First operand 3549 states and 9640 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:43:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:35,440 INFO L93 Difference]: Finished difference Result 3590 states and 9741 transitions. [2023-12-02 13:43:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:43:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:43:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:35,462 INFO L225 Difference]: With dead ends: 3590 [2023-12-02 13:43:35,462 INFO L226 Difference]: Without dead ends: 3590 [2023-12-02 13:43:35,463 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:43:35,464 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:35,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 138 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:43:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2023-12-02 13:43:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3590. [2023-12-02 13:43:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3590 states, 3526 states have (on average 2.762620533182076) internal successors, (9741), 3589 states have internal predecessors, (9741), 0 states have call successors, (0), 0 states have 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:43:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 9741 transitions. [2023-12-02 13:43:35,559 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 9741 transitions. Word has length 19 [2023-12-02 13:43:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:35,559 INFO L495 AbstractCegarLoop]: Abstraction has 3590 states and 9741 transitions. [2023-12-02 13:43:35,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:43:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 9741 transitions. [2023-12-02 13:43:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 13:43:35,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:35,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:35,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 13:43:35,561 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:35,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -174799688, now seen corresponding path program 1 times [2023-12-02 13:43:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039256532] [2023-12-02 13:43:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:35,990 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:43:35,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:35,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039256532] [2023-12-02 13:43:35,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039256532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:35,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:35,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:43:35,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282768566] [2023-12-02 13:43:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:35,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:43:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:35,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:43:35,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:43:35,992 INFO L87 Difference]: Start difference. First operand 3590 states and 9741 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:36,207 INFO L93 Difference]: Finished difference Result 3590 states and 9700 transitions. [2023-12-02 13:43:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:43:36,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 13:43:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:36,224 INFO L225 Difference]: With dead ends: 3590 [2023-12-02 13:43:36,224 INFO L226 Difference]: Without dead ends: 3590 [2023-12-02 13:43:36,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:43:36,225 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 85 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:36,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 134 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:43:36,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2023-12-02 13:43:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3549. [2023-12-02 13:43:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3549 states, 3485 states have (on average 2.7540889526542323) internal successors, (9598), 3548 states have internal predecessors, (9598), 0 states have call successors, (0), 0 states have 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:43:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 9598 transitions. [2023-12-02 13:43:36,375 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 9598 transitions. Word has length 20 [2023-12-02 13:43:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:36,376 INFO L495 AbstractCegarLoop]: Abstraction has 3549 states and 9598 transitions. [2023-12-02 13:43:36,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 9598 transitions. [2023-12-02 13:43:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 13:43:36,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:36,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:36,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 13:43:36,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:36,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1965259429, now seen corresponding path program 1 times [2023-12-02 13:43:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680769713] [2023-12-02 13:43:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:37,339 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:43:37,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680769713] [2023-12-02 13:43:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680769713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 13:43:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508144617] [2023-12-02 13:43:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:37,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 13:43:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:37,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 13:43:37,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:43:37,342 INFO L87 Difference]: Start difference. First operand 3549 states and 9598 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:43:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:37,851 INFO L93 Difference]: Finished difference Result 3630 states and 9841 transitions. [2023-12-02 13:43:37,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:43:37,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:43:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:37,864 INFO L225 Difference]: With dead ends: 3630 [2023-12-02 13:43:37,864 INFO L226 Difference]: Without dead ends: 3630 [2023-12-02 13:43:37,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:43:37,865 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 57 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:37,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 300 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:43:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2023-12-02 13:43:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3589. [2023-12-02 13:43:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3525 states have (on average 2.7512056737588653) internal successors, (9698), 3588 states have internal predecessors, (9698), 0 states have call successors, (0), 0 states have 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:43:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 9698 transitions. [2023-12-02 13:43:37,977 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 9698 transitions. Word has length 21 [2023-12-02 13:43:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:37,977 INFO L495 AbstractCegarLoop]: Abstraction has 3589 states and 9698 transitions. [2023-12-02 13:43:37,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:43:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 9698 transitions. [2023-12-02 13:43:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 13:43:37,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:37,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:37,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 13:43:37,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:37,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1258275283, now seen corresponding path program 1 times [2023-12-02 13:43:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714536328] [2023-12-02 13:43:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:43:38,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714536328] [2023-12-02 13:43:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714536328] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:43:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408109262] [2023-12-02 13:43:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:38,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:43:38,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:43:38,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:43:38,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:43:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:38,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:43:38,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:43:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:43:38,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:43:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408109262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:38,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:43:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 13:43:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051434546] [2023-12-02 13:43:38,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:38,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:43:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:38,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:43:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:43:38,270 INFO L87 Difference]: Start difference. First operand 3589 states and 9698 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:43:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:38,690 INFO L93 Difference]: Finished difference Result 3721 states and 9765 transitions. [2023-12-02 13:43:38,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:43:38,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:43:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:38,705 INFO L225 Difference]: With dead ends: 3721 [2023-12-02 13:43:38,705 INFO L226 Difference]: Without dead ends: 3721 [2023-12-02 13:43:38,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:43:38,706 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 218 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:38,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 326 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:43:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2023-12-02 13:43:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3505. [2023-12-02 13:43:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3505 states, 3451 states have (on average 2.7322515212981746) internal successors, (9429), 3504 states have internal predecessors, (9429), 0 states have call successors, (0), 0 states have 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:43:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 9429 transitions. [2023-12-02 13:43:38,836 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 9429 transitions. Word has length 21 [2023-12-02 13:43:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:38,836 INFO L495 AbstractCegarLoop]: Abstraction has 3505 states and 9429 transitions. [2023-12-02 13:43:38,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:43:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 9429 transitions. [2023-12-02 13:43:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:43:38,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:38,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:38,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:43:39,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 13:43:39,039 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:39,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1989784870, now seen corresponding path program 1 times [2023-12-02 13:43:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:39,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132342297] [2023-12-02 13:43:39,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:39,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:39,506 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:43:39,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:39,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132342297] [2023-12-02 13:43:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132342297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:39,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:39,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 13:43:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029666110] [2023-12-02 13:43:39,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:39,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:43:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:39,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:43:39,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:43:39,508 INFO L87 Difference]: Start difference. First operand 3505 states and 9429 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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:43:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:39,875 INFO L93 Difference]: Finished difference Result 6696 states and 18109 transitions. [2023-12-02 13:43:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:43:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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:43:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:39,905 INFO L225 Difference]: With dead ends: 6696 [2023-12-02 13:43:39,905 INFO L226 Difference]: Without dead ends: 6696 [2023-12-02 13:43:39,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:43:39,906 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 374 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:39,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 182 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2023-12-02 13:43:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 5367. [2023-12-02 13:43:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5367 states, 5313 states have (on average 2.897044984001506) internal successors, (15392), 5366 states have internal predecessors, (15392), 0 states have call successors, (0), 0 states have 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:43:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5367 states to 5367 states and 15392 transitions. [2023-12-02 13:43:40,085 INFO L78 Accepts]: Start accepts. Automaton has 5367 states and 15392 transitions. Word has length 22 [2023-12-02 13:43:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:40,085 INFO L495 AbstractCegarLoop]: Abstraction has 5367 states and 15392 transitions. [2023-12-02 13:43:40,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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:43:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5367 states and 15392 transitions. [2023-12-02 13:43:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:43:40,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:40,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:40,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 13:43:40,088 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:40,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1718000670, now seen corresponding path program 2 times [2023-12-02 13:43:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:40,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722976667] [2023-12-02 13:43:40,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:40,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:40,920 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:43:40,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:40,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722976667] [2023-12-02 13:43:40,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722976667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:40,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:40,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998285529] [2023-12-02 13:43:40,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:40,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:40,922 INFO L87 Difference]: Start difference. First operand 5367 states and 15392 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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:43:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:41,466 INFO L93 Difference]: Finished difference Result 6546 states and 18535 transitions. [2023-12-02 13:43:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:43:41,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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:43:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:41,483 INFO L225 Difference]: With dead ends: 6546 [2023-12-02 13:43:41,483 INFO L226 Difference]: Without dead ends: 6546 [2023-12-02 13:43:41,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:43:41,484 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 207 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:41,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 279 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:43:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6546 states. [2023-12-02 13:43:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6546 to 5250. [2023-12-02 13:43:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5250 states, 5196 states have (on average 2.9062740569668977) internal successors, (15101), 5249 states have internal predecessors, (15101), 0 states have call successors, (0), 0 states have 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:43:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5250 states to 5250 states and 15101 transitions. [2023-12-02 13:43:41,640 INFO L78 Accepts]: Start accepts. Automaton has 5250 states and 15101 transitions. Word has length 22 [2023-12-02 13:43:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:41,641 INFO L495 AbstractCegarLoop]: Abstraction has 5250 states and 15101 transitions. [2023-12-02 13:43:41,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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:43:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5250 states and 15101 transitions. [2023-12-02 13:43:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:43:41,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:41,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:41,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 13:43:41,643 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:41,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:41,644 INFO L85 PathProgramCache]: Analyzing trace with hash 302638534, now seen corresponding path program 3 times [2023-12-02 13:43:41,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:41,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499983446] [2023-12-02 13:43:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:41,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:42,460 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:43:42,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:42,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499983446] [2023-12-02 13:43:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499983446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:42,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:42,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:42,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916428608] [2023-12-02 13:43:42,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:42,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:42,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:42,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:42,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:42,462 INFO L87 Difference]: Start difference. First operand 5250 states and 15101 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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:43:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:43,048 INFO L93 Difference]: Finished difference Result 5933 states and 16934 transitions. [2023-12-02 13:43:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:43:43,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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:43:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:43,064 INFO L225 Difference]: With dead ends: 5933 [2023-12-02 13:43:43,064 INFO L226 Difference]: Without dead ends: 5933 [2023-12-02 13:43:43,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:43:43,065 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 163 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:43,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 322 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 13:43:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5933 states. [2023-12-02 13:43:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5933 to 4945. [2023-12-02 13:43:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4945 states, 4891 states have (on average 2.909016561030464) internal successors, (14228), 4944 states have internal predecessors, (14228), 0 states have call successors, (0), 0 states have 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:43:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 14228 transitions. [2023-12-02 13:43:43,199 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 14228 transitions. Word has length 22 [2023-12-02 13:43:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:43,199 INFO L495 AbstractCegarLoop]: Abstraction has 4945 states and 14228 transitions. [2023-12-02 13:43:43,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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:43:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 14228 transitions. [2023-12-02 13:43:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:43:43,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:43,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:43,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 13:43:43,202 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:43,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash -793499335, now seen corresponding path program 1 times [2023-12-02 13:43:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375836216] [2023-12-02 13:43:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:43,779 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:43:43,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:43,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375836216] [2023-12-02 13:43:43,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375836216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:43,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:43,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 13:43:43,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068843966] [2023-12-02 13:43:43,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:43,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 13:43:43,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:43,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 13:43:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:43:43,782 INFO L87 Difference]: Start difference. First operand 4945 states and 14228 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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:43:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:44,187 INFO L93 Difference]: Finished difference Result 5100 states and 14614 transitions. [2023-12-02 13:43:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:43:44,187 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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:43:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:44,198 INFO L225 Difference]: With dead ends: 5100 [2023-12-02 13:43:44,199 INFO L226 Difference]: Without dead ends: 5100 [2023-12-02 13:43:44,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:43:44,200 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 55 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:44,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 235 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2023-12-02 13:43:44,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 5022. [2023-12-02 13:43:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5022 states, 4968 states have (on average 2.9025764895330113) internal successors, (14420), 5021 states have internal predecessors, (14420), 0 states have call successors, (0), 0 states have 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:43:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 14420 transitions. [2023-12-02 13:43:44,307 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 14420 transitions. Word has length 22 [2023-12-02 13:43:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:44,307 INFO L495 AbstractCegarLoop]: Abstraction has 5022 states and 14420 transitions. [2023-12-02 13:43:44,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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:43:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 14420 transitions. [2023-12-02 13:43:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 13:43:44,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:44,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:44,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 13:43:44,310 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:44,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash -351827255, now seen corresponding path program 1 times [2023-12-02 13:43:44,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:44,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572777059] [2023-12-02 13:43:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:43:44,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:44,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572777059] [2023-12-02 13:43:44,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572777059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:44,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:44,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:43:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689141609] [2023-12-02 13:43:44,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:44,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:43:44,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:44,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:43:44,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:43:44,360 INFO L87 Difference]: Start difference. First operand 5022 states and 14420 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:43:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:44,545 INFO L93 Difference]: Finished difference Result 4906 states and 14023 transitions. [2023-12-02 13:43:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:43:44,545 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:43:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:44,566 INFO L225 Difference]: With dead ends: 4906 [2023-12-02 13:43:44,566 INFO L226 Difference]: Without dead ends: 4752 [2023-12-02 13:43:44,566 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:43:44,567 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 106 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:44,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 124 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:43:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4752 states. [2023-12-02 13:43:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4752 to 2964. [2023-12-02 13:43:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2920 states have (on average 2.8147260273972603) internal successors, (8219), 2963 states have internal predecessors, (8219), 0 states have call successors, (0), 0 states have 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:43:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 8219 transitions. [2023-12-02 13:43:44,679 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 8219 transitions. Word has length 22 [2023-12-02 13:43:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:44,679 INFO L495 AbstractCegarLoop]: Abstraction has 2964 states and 8219 transitions. [2023-12-02 13:43:44,679 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:43:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 8219 transitions. [2023-12-02 13:43:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:43:44,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:44,681 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] [2023-12-02 13:43:44,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 13:43:44,681 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:44,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1553788006, now seen corresponding path program 1 times [2023-12-02 13:43:44,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:44,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323113193] [2023-12-02 13:43:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:44,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:45,498 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:43:45,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323113193] [2023-12-02 13:43:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323113193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:45,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:45,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290949951] [2023-12-02 13:43:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:45,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:45,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:45,500 INFO L87 Difference]: Start difference. First operand 2964 states and 8219 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:45,941 INFO L93 Difference]: Finished difference Result 3424 states and 9382 transitions. [2023-12-02 13:43:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:43:45,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:43:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:45,949 INFO L225 Difference]: With dead ends: 3424 [2023-12-02 13:43:45,950 INFO L226 Difference]: Without dead ends: 3424 [2023-12-02 13:43:45,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:43:45,950 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 170 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:45,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 267 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:43:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2023-12-02 13:43:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 3332. [2023-12-02 13:43:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 3288 states have (on average 2.798053527980535) internal successors, (9200), 3331 states have internal predecessors, (9200), 0 states have call successors, (0), 0 states have 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:43:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 9200 transitions. [2023-12-02 13:43:46,010 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 9200 transitions. Word has length 23 [2023-12-02 13:43:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:46,010 INFO L495 AbstractCegarLoop]: Abstraction has 3332 states and 9200 transitions. [2023-12-02 13:43:46,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 9200 transitions. [2023-12-02 13:43:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:43:46,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:46,013 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] [2023-12-02 13:43:46,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 13:43:46,013 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:46,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1718414038, now seen corresponding path program 2 times [2023-12-02 13:43:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:46,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630080690] [2023-12-02 13:43:46,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:46,809 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:43:46,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:46,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630080690] [2023-12-02 13:43:46,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630080690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:46,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641117918] [2023-12-02 13:43:46,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:46,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:46,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:46,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:46,812 INFO L87 Difference]: Start difference. First operand 3332 states and 9200 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:47,252 INFO L93 Difference]: Finished difference Result 3769 states and 10306 transitions. [2023-12-02 13:43:47,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:43:47,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:43:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:47,261 INFO L225 Difference]: With dead ends: 3769 [2023-12-02 13:43:47,262 INFO L226 Difference]: Without dead ends: 3769 [2023-12-02 13:43:47,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:43:47,263 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 190 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:47,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 240 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2023-12-02 13:43:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 3263. [2023-12-02 13:43:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3263 states, 3219 states have (on average 2.8049083566324944) internal successors, (9029), 3262 states have internal predecessors, (9029), 0 states have call successors, (0), 0 states have 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:43:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3263 states to 3263 states and 9029 transitions. [2023-12-02 13:43:47,323 INFO L78 Accepts]: Start accepts. Automaton has 3263 states and 9029 transitions. Word has length 23 [2023-12-02 13:43:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:47,324 INFO L495 AbstractCegarLoop]: Abstraction has 3263 states and 9029 transitions. [2023-12-02 13:43:47,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3263 states and 9029 transitions. [2023-12-02 13:43:47,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:43:47,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:47,325 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] [2023-12-02 13:43:47,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 13:43:47,326 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:47,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:47,326 INFO L85 PathProgramCache]: Analyzing trace with hash 791860782, now seen corresponding path program 3 times [2023-12-02 13:43:47,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:47,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608335734] [2023-12-02 13:43:47,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:47,945 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:43:47,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608335734] [2023-12-02 13:43:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608335734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:47,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086925412] [2023-12-02 13:43:47,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:47,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:47,947 INFO L87 Difference]: Start difference. First operand 3263 states and 9029 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:48,325 INFO L93 Difference]: Finished difference Result 3474 states and 9575 transitions. [2023-12-02 13:43:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:43:48,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:43:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:48,335 INFO L225 Difference]: With dead ends: 3474 [2023-12-02 13:43:48,335 INFO L226 Difference]: Without dead ends: 3474 [2023-12-02 13:43:48,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:43:48,336 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 183 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:48,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 252 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2023-12-02 13:43:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3093. [2023-12-02 13:43:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 3049 states have (on average 2.8196129878648737) internal successors, (8597), 3092 states have internal predecessors, (8597), 0 states have call successors, (0), 0 states have 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:43:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 8597 transitions. [2023-12-02 13:43:48,402 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 8597 transitions. Word has length 23 [2023-12-02 13:43:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:48,402 INFO L495 AbstractCegarLoop]: Abstraction has 3093 states and 8597 transitions. [2023-12-02 13:43:48,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 8597 transitions. [2023-12-02 13:43:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:43:48,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:48,404 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] [2023-12-02 13:43:48,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 13:43:48,405 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:48,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1171293438, now seen corresponding path program 1 times [2023-12-02 13:43:48,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:48,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799626645] [2023-12-02 13:43:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:48,460 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:43:48,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:48,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799626645] [2023-12-02 13:43:48,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799626645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:48,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:48,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:43:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513197871] [2023-12-02 13:43:48,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:48,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:43:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:48,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:43:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:43:48,462 INFO L87 Difference]: Start difference. First operand 3093 states and 8597 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:48,613 INFO L93 Difference]: Finished difference Result 4027 states and 11054 transitions. [2023-12-02 13:43:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:43:48,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:43:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:48,627 INFO L225 Difference]: With dead ends: 4027 [2023-12-02 13:43:48,627 INFO L226 Difference]: Without dead ends: 4027 [2023-12-02 13:43:48,627 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:43:48,628 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 65 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:48,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 90 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:43:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2023-12-02 13:43:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 3979. [2023-12-02 13:43:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3979 states, 3935 states have (on average 2.79135959339263) internal successors, (10984), 3978 states have internal predecessors, (10984), 0 states have call successors, (0), 0 states have 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:43:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 10984 transitions. [2023-12-02 13:43:48,706 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 10984 transitions. Word has length 23 [2023-12-02 13:43:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:48,706 INFO L495 AbstractCegarLoop]: Abstraction has 3979 states and 10984 transitions. [2023-12-02 13:43:48,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 10984 transitions. [2023-12-02 13:43:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 13:43:48,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:48,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:48,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 13:43:48,708 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:48,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:48,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1951344094, now seen corresponding path program 1 times [2023-12-02 13:43:48,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:48,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58215637] [2023-12-02 13:43:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:48,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:49,151 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:43:49,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58215637] [2023-12-02 13:43:49,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58215637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:49,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 13:43:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875357754] [2023-12-02 13:43:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:49,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 13:43:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:49,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 13:43:49,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:43:49,153 INFO L87 Difference]: Start difference. First operand 3979 states and 10984 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:49,603 INFO L93 Difference]: Finished difference Result 5073 states and 13868 transitions. [2023-12-02 13:43:49,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:43:49,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 13:43:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:49,615 INFO L225 Difference]: With dead ends: 5073 [2023-12-02 13:43:49,615 INFO L226 Difference]: Without dead ends: 5073 [2023-12-02 13:43:49,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:43:49,616 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 138 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:49,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 324 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:43:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2023-12-02 13:43:49,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 4737. [2023-12-02 13:43:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4737 states, 4693 states have (on average 2.770083102493075) internal successors, (13000), 4736 states have internal predecessors, (13000), 0 states have call successors, (0), 0 states have 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:43:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 13000 transitions. [2023-12-02 13:43:49,703 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 13000 transitions. Word has length 24 [2023-12-02 13:43:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:49,703 INFO L495 AbstractCegarLoop]: Abstraction has 4737 states and 13000 transitions. [2023-12-02 13:43:49,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 13000 transitions. [2023-12-02 13:43:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 13:43:49,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:49,705 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:43:49,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 13:43:49,706 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:49,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1458371583, now seen corresponding path program 1 times [2023-12-02 13:43:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:49,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548197421] [2023-12-02 13:43:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:50,049 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:43:50,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548197421] [2023-12-02 13:43:50,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548197421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:50,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:50,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 13:43:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191715874] [2023-12-02 13:43:50,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:50,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:43:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:50,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:43:50,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:43:50,051 INFO L87 Difference]: Start difference. First operand 4737 states and 13000 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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:43:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:50,422 INFO L93 Difference]: Finished difference Result 7300 states and 19856 transitions. [2023-12-02 13:43:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:43:50,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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:43:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:50,438 INFO L225 Difference]: With dead ends: 7300 [2023-12-02 13:43:50,438 INFO L226 Difference]: Without dead ends: 7300 [2023-12-02 13:43:50,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:43:50,439 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 366 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:50,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 268 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7300 states. [2023-12-02 13:43:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7300 to 5847. [2023-12-02 13:43:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5847 states, 5803 states have (on average 2.8219886265724625) internal successors, (16376), 5846 states have internal predecessors, (16376), 0 states have call successors, (0), 0 states have 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:43:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5847 states to 5847 states and 16376 transitions. [2023-12-02 13:43:50,585 INFO L78 Accepts]: Start accepts. Automaton has 5847 states and 16376 transitions. Word has length 25 [2023-12-02 13:43:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:50,585 INFO L495 AbstractCegarLoop]: Abstraction has 5847 states and 16376 transitions. [2023-12-02 13:43:50,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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:43:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5847 states and 16376 transitions. [2023-12-02 13:43:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 13:43:50,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:50,588 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:43:50,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 13:43:50,588 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:50,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash 769026451, now seen corresponding path program 2 times [2023-12-02 13:43:50,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:50,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256504979] [2023-12-02 13:43:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:50,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:51,090 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:43:51,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:51,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256504979] [2023-12-02 13:43:51,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256504979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:51,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:51,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:51,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917543342] [2023-12-02 13:43:51,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:51,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:51,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:51,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:51,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:51,093 INFO L87 Difference]: Start difference. First operand 5847 states and 16376 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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:43:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:51,545 INFO L93 Difference]: Finished difference Result 6367 states and 17729 transitions. [2023-12-02 13:43:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 13:43:51,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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:43:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:51,559 INFO L225 Difference]: With dead ends: 6367 [2023-12-02 13:43:51,559 INFO L226 Difference]: Without dead ends: 6367 [2023-12-02 13:43:51,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:43:51,560 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 175 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:51,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 374 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6367 states. [2023-12-02 13:43:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6367 to 5364. [2023-12-02 13:43:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5364 states, 5320 states have (on average 2.835902255639098) internal successors, (15087), 5363 states have internal predecessors, (15087), 0 states have call successors, (0), 0 states have 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:43:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 5364 states and 15087 transitions. [2023-12-02 13:43:51,707 INFO L78 Accepts]: Start accepts. Automaton has 5364 states and 15087 transitions. Word has length 25 [2023-12-02 13:43:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:51,707 INFO L495 AbstractCegarLoop]: Abstraction has 5364 states and 15087 transitions. [2023-12-02 13:43:51,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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:43:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5364 states and 15087 transitions. [2023-12-02 13:43:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 13:43:51,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:51,710 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:43:51,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 13:43:51,710 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:51,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash 362125601, now seen corresponding path program 1 times [2023-12-02 13:43:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:51,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541472819] [2023-12-02 13:43:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:51,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:52,216 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:43:52,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:52,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541472819] [2023-12-02 13:43:52,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541472819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:52,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:52,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 13:43:52,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38000329] [2023-12-02 13:43:52,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:52,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 13:43:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:52,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 13:43:52,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:43:52,218 INFO L87 Difference]: Start difference. First operand 5364 states and 15087 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:43:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:52,571 INFO L93 Difference]: Finished difference Result 6409 states and 17780 transitions. [2023-12-02 13:43:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:43:52,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:43:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:52,583 INFO L225 Difference]: With dead ends: 6409 [2023-12-02 13:43:52,583 INFO L226 Difference]: Without dead ends: 6409 [2023-12-02 13:43:52,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:43:52,584 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 165 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:52,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 254 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6409 states. [2023-12-02 13:43:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6409 to 6186. [2023-12-02 13:43:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6186 states, 6142 states have (on average 2.81048518397916) internal successors, (17262), 6185 states have internal predecessors, (17262), 0 states have call successors, (0), 0 states have 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:43:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6186 states to 6186 states and 17262 transitions. [2023-12-02 13:43:52,706 INFO L78 Accepts]: Start accepts. Automaton has 6186 states and 17262 transitions. Word has length 25 [2023-12-02 13:43:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:52,706 INFO L495 AbstractCegarLoop]: Abstraction has 6186 states and 17262 transitions. [2023-12-02 13:43:52,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:43:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6186 states and 17262 transitions. [2023-12-02 13:43:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 13:43:52,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:52,708 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:43:52,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 13:43:52,708 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:52,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash 362033187, now seen corresponding path program 3 times [2023-12-02 13:43:52,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:52,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216885855] [2023-12-02 13:43:52,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:53,254 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:43:53,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216885855] [2023-12-02 13:43:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216885855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487524306] [2023-12-02 13:43:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:53,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:53,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:53,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:53,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:53,256 INFO L87 Difference]: Start difference. First operand 6186 states and 17262 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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:43:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:53,766 INFO L93 Difference]: Finished difference Result 6638 states and 18384 transitions. [2023-12-02 13:43:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:43:53,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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:43:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:53,777 INFO L225 Difference]: With dead ends: 6638 [2023-12-02 13:43:53,777 INFO L226 Difference]: Without dead ends: 6638 [2023-12-02 13:43:53,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:43:53,778 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 245 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:53,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 290 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:43:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2023-12-02 13:43:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6051. [2023-12-02 13:43:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6051 states, 6007 states have (on average 2.8080572665223906) internal successors, (16868), 6050 states have internal predecessors, (16868), 0 states have call successors, (0), 0 states have 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:43:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6051 states to 6051 states and 16868 transitions. [2023-12-02 13:43:53,907 INFO L78 Accepts]: Start accepts. Automaton has 6051 states and 16868 transitions. Word has length 25 [2023-12-02 13:43:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:53,907 INFO L495 AbstractCegarLoop]: Abstraction has 6051 states and 16868 transitions. [2023-12-02 13:43:53,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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:43:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6051 states and 16868 transitions. [2023-12-02 13:43:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 13:43:53,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:53,909 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:43:53,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 13:43:53,909 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:53,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:53,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2035120352, now seen corresponding path program 1 times [2023-12-02 13:43:53,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:53,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726768204] [2023-12-02 13:43:53,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:54,336 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:43:54,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:54,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726768204] [2023-12-02 13:43:54,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726768204] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:54,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:54,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:54,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639267897] [2023-12-02 13:43:54,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:54,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:54,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:54,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:54,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:54,338 INFO L87 Difference]: Start difference. First operand 6051 states and 16868 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:43:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:54,641 INFO L93 Difference]: Finished difference Result 6987 states and 19291 transitions. [2023-12-02 13:43:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 13:43:54,641 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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:43:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:54,652 INFO L225 Difference]: With dead ends: 6987 [2023-12-02 13:43:54,652 INFO L226 Difference]: Without dead ends: 6987 [2023-12-02 13:43:54,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:43:54,653 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 230 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:54,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 242 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:43:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2023-12-02 13:43:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6005. [2023-12-02 13:43:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6005 states, 5961 states have (on average 2.8106022479449755) internal successors, (16754), 6004 states have internal predecessors, (16754), 0 states have call successors, (0), 0 states have 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:43:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 16754 transitions. [2023-12-02 13:43:54,749 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 16754 transitions. Word has length 26 [2023-12-02 13:43:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:54,749 INFO L495 AbstractCegarLoop]: Abstraction has 6005 states and 16754 transitions. [2023-12-02 13:43:54,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:43:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 16754 transitions. [2023-12-02 13:43:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 13:43:54,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:54,751 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:43:54,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-02 13:43:54,751 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:54,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1929982964, now seen corresponding path program 2 times [2023-12-02 13:43:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:54,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124639161] [2023-12-02 13:43:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:55,334 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:43:55,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124639161] [2023-12-02 13:43:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124639161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:55,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:55,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:55,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564654801] [2023-12-02 13:43:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:55,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:55,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:55,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:55,335 INFO L87 Difference]: Start difference. First operand 6005 states and 16754 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:43:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:55,660 INFO L93 Difference]: Finished difference Result 6448 states and 17874 transitions. [2023-12-02 13:43:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 13:43:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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:43:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:55,674 INFO L225 Difference]: With dead ends: 6448 [2023-12-02 13:43:55,674 INFO L226 Difference]: Without dead ends: 6448 [2023-12-02 13:43:55,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:43:55,675 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 211 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:55,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 243 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:43:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6448 states. [2023-12-02 13:43:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6448 to 5522. [2023-12-02 13:43:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5522 states, 5478 states have (on average 2.8231106243154436) internal successors, (15465), 5521 states have internal predecessors, (15465), 0 states have call successors, (0), 0 states have 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:43:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 15465 transitions. [2023-12-02 13:43:55,775 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 15465 transitions. Word has length 26 [2023-12-02 13:43:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:55,775 INFO L495 AbstractCegarLoop]: Abstraction has 5522 states and 15465 transitions. [2023-12-02 13:43:55,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:43:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 15465 transitions. [2023-12-02 13:43:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 13:43:55,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:55,776 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:43:55,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-02 13:43:55,776 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:55,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1661872260, now seen corresponding path program 3 times [2023-12-02 13:43:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937583577] [2023-12-02 13:43:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:56,437 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:43:56,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937583577] [2023-12-02 13:43:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937583577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:56,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:43:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95143802] [2023-12-02 13:43:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:56,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:56,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:56,438 INFO L87 Difference]: Start difference. First operand 5522 states and 15465 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:43:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:56,858 INFO L93 Difference]: Finished difference Result 5902 states and 16353 transitions. [2023-12-02 13:43:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:43:56,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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:43:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:56,868 INFO L225 Difference]: With dead ends: 5902 [2023-12-02 13:43:56,868 INFO L226 Difference]: Without dead ends: 5902 [2023-12-02 13:43:56,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:43:56,869 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 173 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:56,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 381 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:43:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5902 states. [2023-12-02 13:43:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5902 to 5285. [2023-12-02 13:43:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5285 states, 5241 states have (on average 2.8240793741652355) internal successors, (14801), 5284 states have internal predecessors, (14801), 0 states have call successors, (0), 0 states have 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:43:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5285 states to 5285 states and 14801 transitions. [2023-12-02 13:43:56,963 INFO L78 Accepts]: Start accepts. Automaton has 5285 states and 14801 transitions. Word has length 26 [2023-12-02 13:43:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:56,964 INFO L495 AbstractCegarLoop]: Abstraction has 5285 states and 14801 transitions. [2023-12-02 13:43:56,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:43:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5285 states and 14801 transitions. [2023-12-02 13:43:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:43:56,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:56,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:56,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-02 13:43:56,966 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:56,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash -920033484, now seen corresponding path program 1 times [2023-12-02 13:43:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819469442] [2023-12-02 13:43:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:43:57,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819469442] [2023-12-02 13:43:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819469442] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:43:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637303096] [2023-12-02 13:43:57,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:57,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:43:57,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:43:57,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:43:57,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:43:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:57,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:43:57,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:43:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:43:57,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:43:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637303096] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:57,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:43:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 13:43:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887041597] [2023-12-02 13:43:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:57,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:43:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:57,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:43:57,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:43:57,171 INFO L87 Difference]: Start difference. First operand 5285 states and 14801 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:43:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:57,370 INFO L93 Difference]: Finished difference Result 5153 states and 14199 transitions. [2023-12-02 13:43:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:43:57,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 13:43:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:57,379 INFO L225 Difference]: With dead ends: 5153 [2023-12-02 13:43:57,379 INFO L226 Difference]: Without dead ends: 5153 [2023-12-02 13:43:57,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:43:57,380 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 137 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:57,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 144 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:43:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2023-12-02 13:43:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 5153. [2023-12-02 13:43:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5153 states, 5119 states have (on average 2.7737839421762063) internal successors, (14199), 5152 states have internal predecessors, (14199), 0 states have call successors, (0), 0 states have 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:43:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 14199 transitions. [2023-12-02 13:43:57,458 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 14199 transitions. Word has length 31 [2023-12-02 13:43:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:57,458 INFO L495 AbstractCegarLoop]: Abstraction has 5153 states and 14199 transitions. [2023-12-02 13:43:57,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:43:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 14199 transitions. [2023-12-02 13:43:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 13:43:57,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:57,460 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:57,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 13:43:57,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 13:43:57,660 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:57,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1543733894, now seen corresponding path program 1 times [2023-12-02 13:43:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:57,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75174666] [2023-12-02 13:43:57,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:57,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:43:57,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:57,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75174666] [2023-12-02 13:43:57,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75174666] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:57,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:57,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:43:57,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040460456] [2023-12-02 13:43:57,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:57,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:43:57,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:57,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:43:57,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:43:57,698 INFO L87 Difference]: Start difference. First operand 5153 states and 14199 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:43:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:57,827 INFO L93 Difference]: Finished difference Result 5021 states and 13597 transitions. [2023-12-02 13:43:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:43:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2023-12-02 13:43:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:57,836 INFO L225 Difference]: With dead ends: 5021 [2023-12-02 13:43:57,836 INFO L226 Difference]: Without dead ends: 5021 [2023-12-02 13:43:57,836 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:43:57,837 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 66 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:57,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 73 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:43:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2023-12-02 13:43:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 3942. [2023-12-02 13:43:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3918 states have (on average 2.760847371107708) internal successors, (10817), 3941 states have internal predecessors, (10817), 0 states have call successors, (0), 0 states have 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:43:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 10817 transitions. [2023-12-02 13:43:57,956 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 10817 transitions. Word has length 32 [2023-12-02 13:43:57,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:57,956 INFO L495 AbstractCegarLoop]: Abstraction has 3942 states and 10817 transitions. [2023-12-02 13:43:57,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:43:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 10817 transitions. [2023-12-02 13:43:57,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 13:43:57,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:57,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:57,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-02 13:43:57,958 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:57,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1598932477, now seen corresponding path program 1 times [2023-12-02 13:43:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:57,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597695656] [2023-12-02 13:43:57,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:58,016 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:43:58,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597695656] [2023-12-02 13:43:58,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597695656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:58,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:58,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:43:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688055490] [2023-12-02 13:43:58,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:58,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:43:58,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:43:58,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:43:58,018 INFO L87 Difference]: Start difference. First operand 3942 states and 10817 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:58,096 INFO L93 Difference]: Finished difference Result 2004 states and 5032 transitions. [2023-12-02 13:43:58,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:43:58,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 13:43:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:58,099 INFO L225 Difference]: With dead ends: 2004 [2023-12-02 13:43:58,099 INFO L226 Difference]: Without dead ends: 2004 [2023-12-02 13:43:58,099 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:43:58,100 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:58,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:43:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2023-12-02 13:43:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1744. [2023-12-02 13:43:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1728 states have (on average 2.540509259259259) internal successors, (4390), 1743 states have internal predecessors, (4390), 0 states have call successors, (0), 0 states have 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:43:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 4390 transitions. [2023-12-02 13:43:58,124 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 4390 transitions. Word has length 34 [2023-12-02 13:43:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:58,124 INFO L495 AbstractCegarLoop]: Abstraction has 1744 states and 4390 transitions. [2023-12-02 13:43:58,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:43:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 4390 transitions. [2023-12-02 13:43:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:43:58,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:58,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:58,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-02 13:43:58,126 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:58,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash 332397816, now seen corresponding path program 1 times [2023-12-02 13:43:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:58,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731712567] [2023-12-02 13:43:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:58,642 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:43:58,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731712567] [2023-12-02 13:43:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731712567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:58,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 13:43:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480075542] [2023-12-02 13:43:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:58,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 13:43:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:58,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 13:43:58,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:43:58,644 INFO L87 Difference]: Start difference. First operand 1744 states and 4390 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:43:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:43:59,102 INFO L93 Difference]: Finished difference Result 2936 states and 7302 transitions. [2023-12-02 13:43:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:43:59,102 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-02 13:43:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:43:59,106 INFO L225 Difference]: With dead ends: 2936 [2023-12-02 13:43:59,106 INFO L226 Difference]: Without dead ends: 2936 [2023-12-02 13:43:59,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-12-02 13:43:59,107 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 264 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:43:59,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 324 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:43:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2023-12-02 13:43:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2587. [2023-12-02 13:43:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 2571 states have (on average 2.5834305717619603) internal successors, (6642), 2586 states have internal predecessors, (6642), 0 states have call successors, (0), 0 states have 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:43:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 6642 transitions. [2023-12-02 13:43:59,141 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 6642 transitions. Word has length 35 [2023-12-02 13:43:59,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:43:59,142 INFO L495 AbstractCegarLoop]: Abstraction has 2587 states and 6642 transitions. [2023-12-02 13:43:59,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:43:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 6642 transitions. [2023-12-02 13:43:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:43:59,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:43:59,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:43:59,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-02 13:43:59,144 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:43:59,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:43:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2105222604, now seen corresponding path program 2 times [2023-12-02 13:43:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:43:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18454220] [2023-12-02 13:43:59,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:43:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:43:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:43:59,884 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:43:59,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:43:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18454220] [2023-12-02 13:43:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18454220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:43:59,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:43:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 13:43:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601131387] [2023-12-02 13:43:59,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:43:59,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:43:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:43:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:43:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:43:59,886 INFO L87 Difference]: Start difference. First operand 2587 states and 6642 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:44:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:00,268 INFO L93 Difference]: Finished difference Result 2924 states and 7434 transitions. [2023-12-02 13:44:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 13:44:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-02 13:44:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:00,272 INFO L225 Difference]: With dead ends: 2924 [2023-12-02 13:44:00,272 INFO L226 Difference]: Without dead ends: 2924 [2023-12-02 13:44:00,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:44:00,273 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 97 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:00,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 223 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:44:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2023-12-02 13:44:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2876. [2023-12-02 13:44:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2860 states have (on average 2.5608391608391607) internal successors, (7324), 2875 states have internal predecessors, (7324), 0 states have call successors, (0), 0 states have 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:44:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 7324 transitions. [2023-12-02 13:44:00,313 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 7324 transitions. Word has length 35 [2023-12-02 13:44:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:00,313 INFO L495 AbstractCegarLoop]: Abstraction has 2876 states and 7324 transitions. [2023-12-02 13:44:00,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:44:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 7324 transitions. [2023-12-02 13:44:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:44:00,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:00,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:00,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-02 13:44:00,316 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:00,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1470795160, now seen corresponding path program 3 times [2023-12-02 13:44:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:00,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402425928] [2023-12-02 13:44:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:00,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402425928] [2023-12-02 13:44:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402425928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:00,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:00,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 13:44:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274608559] [2023-12-02 13:44:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:00,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:44:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:00,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:44:00,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:44:00,995 INFO L87 Difference]: Start difference. First operand 2876 states and 7324 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:44:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:01,360 INFO L93 Difference]: Finished difference Result 2890 states and 7337 transitions. [2023-12-02 13:44:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 13:44:01,361 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-02 13:44:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:01,365 INFO L225 Difference]: With dead ends: 2890 [2023-12-02 13:44:01,365 INFO L226 Difference]: Without dead ends: 2890 [2023-12-02 13:44:01,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2023-12-02 13:44:01,366 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 180 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:01,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 183 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:44:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2023-12-02 13:44:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2608. [2023-12-02 13:44:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2592 states have (on average 2.5671296296296298) internal successors, (6654), 2607 states have internal predecessors, (6654), 0 states have call successors, (0), 0 states have 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:44:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 6654 transitions. [2023-12-02 13:44:01,418 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 6654 transitions. Word has length 35 [2023-12-02 13:44:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:01,418 INFO L495 AbstractCegarLoop]: Abstraction has 2608 states and 6654 transitions. [2023-12-02 13:44:01,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:44:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 6654 transitions. [2023-12-02 13:44:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 13:44:01,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:01,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:01,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-02 13:44:01,421 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:01,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:01,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1429013118, now seen corresponding path program 1 times [2023-12-02 13:44:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:01,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810457221] [2023-12-02 13:44:01,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:01,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:02,141 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:44:02,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:02,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810457221] [2023-12-02 13:44:02,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810457221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:02,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:02,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 13:44:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488471774] [2023-12-02 13:44:02,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:02,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 13:44:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:02,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 13:44:02,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:44:02,143 INFO L87 Difference]: Start difference. First operand 2608 states and 6654 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:44:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:02,454 INFO L93 Difference]: Finished difference Result 2608 states and 6647 transitions. [2023-12-02 13:44:02,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:44:02,454 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-02 13:44:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:02,457 INFO L225 Difference]: With dead ends: 2608 [2023-12-02 13:44:02,457 INFO L226 Difference]: Without dead ends: 2608 [2023-12-02 13:44:02,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-12-02 13:44:02,458 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 157 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:02,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 160 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:44:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2023-12-02 13:44:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2587. [2023-12-02 13:44:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 2571 states have (on average 2.567872423181641) internal successors, (6602), 2586 states have internal predecessors, (6602), 0 states have call successors, (0), 0 states have 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:44:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 6602 transitions. [2023-12-02 13:44:02,505 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 6602 transitions. Word has length 36 [2023-12-02 13:44:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:02,505 INFO L495 AbstractCegarLoop]: Abstraction has 2587 states and 6602 transitions. [2023-12-02 13:44:02,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:44:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 6602 transitions. [2023-12-02 13:44:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:44:02,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:02,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:02,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-02 13:44:02,508 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:02,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2085321738, now seen corresponding path program 1 times [2023-12-02 13:44:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:02,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115130706] [2023-12-02 13:44:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:03,343 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:44:03,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:03,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115130706] [2023-12-02 13:44:03,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115130706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:03,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:03,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011799692] [2023-12-02 13:44:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:03,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:03,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:03,345 INFO L87 Difference]: Start difference. First operand 2587 states and 6602 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:44:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:03,978 INFO L93 Difference]: Finished difference Result 3525 states and 8918 transitions. [2023-12-02 13:44:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:44:03,978 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-02 13:44:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:03,986 INFO L225 Difference]: With dead ends: 3525 [2023-12-02 13:44:03,986 INFO L226 Difference]: Without dead ends: 3525 [2023-12-02 13:44:03,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:44:03,987 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 171 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:03,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 380 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 13:44:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2023-12-02 13:44:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 2566. [2023-12-02 13:44:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2550 states have (on average 2.5713725490196078) internal successors, (6557), 2565 states have internal predecessors, (6557), 0 states have call successors, (0), 0 states have 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:44:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 6557 transitions. [2023-12-02 13:44:04,025 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 6557 transitions. Word has length 37 [2023-12-02 13:44:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:04,025 INFO L495 AbstractCegarLoop]: Abstraction has 2566 states and 6557 transitions. [2023-12-02 13:44:04,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:44:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 6557 transitions. [2023-12-02 13:44:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:44:04,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:04,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:04,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-02 13:44:04,028 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:04,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1455528934, now seen corresponding path program 2 times [2023-12-02 13:44:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:04,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917785938] [2023-12-02 13:44:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:04,717 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:44:04,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:04,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917785938] [2023-12-02 13:44:04,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917785938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:04,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:04,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 13:44:04,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647138666] [2023-12-02 13:44:04,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:04,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 13:44:04,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:04,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 13:44:04,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:44:04,719 INFO L87 Difference]: Start difference. First operand 2566 states and 6557 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:44:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:05,092 INFO L93 Difference]: Finished difference Result 3167 states and 8065 transitions. [2023-12-02 13:44:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:44:05,093 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-02 13:44:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:05,098 INFO L225 Difference]: With dead ends: 3167 [2023-12-02 13:44:05,098 INFO L226 Difference]: Without dead ends: 3167 [2023-12-02 13:44:05,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:44:05,099 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 183 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:05,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 229 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:44:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2023-12-02 13:44:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 2292. [2023-12-02 13:44:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2292 states, 2276 states have (on average 2.578207381370826) internal successors, (5868), 2291 states have internal predecessors, (5868), 0 states have call successors, (0), 0 states have 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:44:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 5868 transitions. [2023-12-02 13:44:05,135 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 5868 transitions. Word has length 37 [2023-12-02 13:44:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:05,135 INFO L495 AbstractCegarLoop]: Abstraction has 2292 states and 5868 transitions. [2023-12-02 13:44:05,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:44:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 5868 transitions. [2023-12-02 13:44:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:44:05,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:05,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:05,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-02 13:44:05,138 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:05,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:05,138 INFO L85 PathProgramCache]: Analyzing trace with hash 181815094, now seen corresponding path program 3 times [2023-12-02 13:44:05,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:05,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470456319] [2023-12-02 13:44:05,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:05,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:06,055 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:44:06,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:06,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470456319] [2023-12-02 13:44:06,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470456319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:06,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:06,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185100765] [2023-12-02 13:44:06,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:06,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:06,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:06,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:06,057 INFO L87 Difference]: Start difference. First operand 2292 states and 5868 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:44:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:06,703 INFO L93 Difference]: Finished difference Result 3082 states and 7863 transitions. [2023-12-02 13:44:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:44:06,704 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-02 13:44:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:06,708 INFO L225 Difference]: With dead ends: 3082 [2023-12-02 13:44:06,708 INFO L226 Difference]: Without dead ends: 3082 [2023-12-02 13:44:06,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:44:06,709 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 193 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:06,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 332 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 13:44:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2023-12-02 13:44:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2645. [2023-12-02 13:44:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2629 states have (on average 2.596804868771396) internal successors, (6827), 2644 states have internal predecessors, (6827), 0 states have call successors, (0), 0 states have 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:44:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 6827 transitions. [2023-12-02 13:44:06,743 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 6827 transitions. Word has length 37 [2023-12-02 13:44:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:06,743 INFO L495 AbstractCegarLoop]: Abstraction has 2645 states and 6827 transitions. [2023-12-02 13:44:06,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:44:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 6827 transitions. [2023-12-02 13:44:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:44:06,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:06,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:06,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-02 13:44:06,746 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:06,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:06,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1353681756, now seen corresponding path program 4 times [2023-12-02 13:44:06,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:06,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855265491] [2023-12-02 13:44:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:07,623 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:44:07,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:07,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855265491] [2023-12-02 13:44:07,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855265491] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:07,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:07,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:07,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241469145] [2023-12-02 13:44:07,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:07,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:07,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:07,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:07,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:07,625 INFO L87 Difference]: Start difference. First operand 2645 states and 6827 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:44:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:08,284 INFO L93 Difference]: Finished difference Result 3256 states and 8339 transitions. [2023-12-02 13:44:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:44:08,284 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-02 13:44:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:08,290 INFO L225 Difference]: With dead ends: 3256 [2023-12-02 13:44:08,290 INFO L226 Difference]: Without dead ends: 3256 [2023-12-02 13:44:08,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:44:08,290 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 182 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:08,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 391 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 13:44:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2023-12-02 13:44:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 2657. [2023-12-02 13:44:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2641 states have (on average 2.594471790988262) internal successors, (6852), 2656 states have internal predecessors, (6852), 0 states have call successors, (0), 0 states have 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:44:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 6852 transitions. [2023-12-02 13:44:08,329 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 6852 transitions. Word has length 37 [2023-12-02 13:44:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:08,330 INFO L495 AbstractCegarLoop]: Abstraction has 2657 states and 6852 transitions. [2023-12-02 13:44:08,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:44:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 6852 transitions. [2023-12-02 13:44:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 13:44:08,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:08,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:08,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-02 13:44:08,331 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:08,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:08,332 INFO L85 PathProgramCache]: Analyzing trace with hash -377572138, now seen corresponding path program 1 times [2023-12-02 13:44:08,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:08,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342878853] [2023-12-02 13:44:08,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:08,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:08,556 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:44:08,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:08,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342878853] [2023-12-02 13:44:08,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342878853] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:08,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:44:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004599604] [2023-12-02 13:44:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:08,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:44:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:44:08,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:44:08,557 INFO L87 Difference]: Start difference. First operand 2657 states and 6852 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:44:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:08,758 INFO L93 Difference]: Finished difference Result 3354 states and 8437 transitions. [2023-12-02 13:44:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:44:08,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-02 13:44:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:08,765 INFO L225 Difference]: With dead ends: 3354 [2023-12-02 13:44:08,765 INFO L226 Difference]: Without dead ends: 3354 [2023-12-02 13:44:08,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:44:08,766 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 147 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:08,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 155 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:44:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2023-12-02 13:44:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 2787. [2023-12-02 13:44:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2771 states have (on average 2.5687477444965716) internal successors, (7118), 2786 states have internal predecessors, (7118), 0 states have call successors, (0), 0 states have 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:44:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 7118 transitions. [2023-12-02 13:44:08,806 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 7118 transitions. Word has length 38 [2023-12-02 13:44:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:08,806 INFO L495 AbstractCegarLoop]: Abstraction has 2787 states and 7118 transitions. [2023-12-02 13:44:08,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:44:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 7118 transitions. [2023-12-02 13:44:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 13:44:08,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:08,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:08,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-02 13:44:08,808 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:08,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1341301466, now seen corresponding path program 2 times [2023-12-02 13:44:08,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495290566] [2023-12-02 13:44:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:09,656 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:44:09,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:09,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495290566] [2023-12-02 13:44:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495290566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:09,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:09,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265623028] [2023-12-02 13:44:09,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:09,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:09,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:09,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:09,658 INFO L87 Difference]: Start difference. First operand 2787 states and 7118 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:44:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:10,236 INFO L93 Difference]: Finished difference Result 3722 states and 9444 transitions. [2023-12-02 13:44:10,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:44:10,237 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-02 13:44:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:10,245 INFO L225 Difference]: With dead ends: 3722 [2023-12-02 13:44:10,245 INFO L226 Difference]: Without dead ends: 3722 [2023-12-02 13:44:10,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:44:10,246 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 192 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:10,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 268 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:44:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2023-12-02 13:44:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 2971. [2023-12-02 13:44:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2955 states have (on average 2.5783417935702198) internal successors, (7619), 2970 states have internal predecessors, (7619), 0 states have call successors, (0), 0 states have 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:44:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 7619 transitions. [2023-12-02 13:44:10,307 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 7619 transitions. Word has length 38 [2023-12-02 13:44:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:10,308 INFO L495 AbstractCegarLoop]: Abstraction has 2971 states and 7619 transitions. [2023-12-02 13:44:10,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:44:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 7619 transitions. [2023-12-02 13:44:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 13:44:10,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:10,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:10,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-02 13:44:10,311 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:10,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash -504548989, now seen corresponding path program 1 times [2023-12-02 13:44:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468743621] [2023-12-02 13:44:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:10,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:10,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:10,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468743621] [2023-12-02 13:44:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468743621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:10,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:44:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227427263] [2023-12-02 13:44:10,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:10,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:44:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:44:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:44:10,394 INFO L87 Difference]: Start difference. First operand 2971 states and 7619 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:44:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:10,470 INFO L93 Difference]: Finished difference Result 2262 states and 5601 transitions. [2023-12-02 13:44:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:44:10,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-02 13:44:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:10,475 INFO L225 Difference]: With dead ends: 2262 [2023-12-02 13:44:10,475 INFO L226 Difference]: Without dead ends: 2156 [2023-12-02 13:44:10,475 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:44:10,476 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:10,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 47 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:44:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2023-12-02 13:44:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1879. [2023-12-02 13:44:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1863 states have (on average 2.4605475040257647) internal successors, (4584), 1878 states have internal predecessors, (4584), 0 states have call successors, (0), 0 states have 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:44:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4584 transitions. [2023-12-02 13:44:10,501 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4584 transitions. Word has length 38 [2023-12-02 13:44:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:10,502 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 4584 transitions. [2023-12-02 13:44:10,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:44:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4584 transitions. [2023-12-02 13:44:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 13:44:10,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:10,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:10,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-02 13:44:10,503 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:10,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash -985537676, now seen corresponding path program 3 times [2023-12-02 13:44:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:10,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843714767] [2023-12-02 13:44:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:11,308 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:44:11,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843714767] [2023-12-02 13:44:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843714767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729788534] [2023-12-02 13:44:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:11,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:11,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:11,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:11,309 INFO L87 Difference]: Start difference. First operand 1879 states and 4584 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:44:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:11,743 INFO L93 Difference]: Finished difference Result 2435 states and 5946 transitions. [2023-12-02 13:44:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:44:11,743 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-02 13:44:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:11,747 INFO L225 Difference]: With dead ends: 2435 [2023-12-02 13:44:11,747 INFO L226 Difference]: Without dead ends: 2435 [2023-12-02 13:44:11,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:44:11,747 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 300 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:11,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 206 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:44:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2023-12-02 13:44:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1627. [2023-12-02 13:44:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1613 states have (on average 2.466212027278363) internal successors, (3978), 1626 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have 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:44:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 3978 transitions. [2023-12-02 13:44:11,769 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 3978 transitions. Word has length 38 [2023-12-02 13:44:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:11,770 INFO L495 AbstractCegarLoop]: Abstraction has 1627 states and 3978 transitions. [2023-12-02 13:44:11,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:44:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 3978 transitions. [2023-12-02 13:44:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 13:44:11,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:11,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:11,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-02 13:44:11,771 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:11,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2069544517, now seen corresponding path program 1 times [2023-12-02 13:44:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980120476] [2023-12-02 13:44:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:12,746 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:44:12,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:12,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980120476] [2023-12-02 13:44:12,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980120476] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:12,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:12,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:12,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261612942] [2023-12-02 13:44:12,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:12,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:12,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:12,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:12,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:12,748 INFO L87 Difference]: Start difference. First operand 1627 states and 3978 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:44:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:13,236 INFO L93 Difference]: Finished difference Result 2208 states and 5371 transitions. [2023-12-02 13:44:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:44:13,237 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2023-12-02 13:44:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:13,240 INFO L225 Difference]: With dead ends: 2208 [2023-12-02 13:44:13,240 INFO L226 Difference]: Without dead ends: 2208 [2023-12-02 13:44:13,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:44:13,241 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 183 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:13,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 287 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:44:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-12-02 13:44:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2166. [2023-12-02 13:44:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 2152 states have (on average 2.453531598513011) internal successors, (5280), 2165 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have 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:44:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 5280 transitions. [2023-12-02 13:44:13,268 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 5280 transitions. Word has length 40 [2023-12-02 13:44:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:13,268 INFO L495 AbstractCegarLoop]: Abstraction has 2166 states and 5280 transitions. [2023-12-02 13:44:13,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:44:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 5280 transitions. [2023-12-02 13:44:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 13:44:13,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:13,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:13,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-02 13:44:13,271 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:13,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash -326505457, now seen corresponding path program 2 times [2023-12-02 13:44:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:13,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786094694] [2023-12-02 13:44:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:13,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:14,116 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:44:14,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:14,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786094694] [2023-12-02 13:44:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786094694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:14,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764706841] [2023-12-02 13:44:14,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:14,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:14,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:14,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:14,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:14,117 INFO L87 Difference]: Start difference. First operand 2166 states and 5280 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:44:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:14,584 INFO L93 Difference]: Finished difference Result 2653 states and 6482 transitions. [2023-12-02 13:44:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:44:14,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2023-12-02 13:44:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:14,587 INFO L225 Difference]: With dead ends: 2653 [2023-12-02 13:44:14,587 INFO L226 Difference]: Without dead ends: 2653 [2023-12-02 13:44:14,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-12-02 13:44:14,588 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 166 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:14,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 293 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:44:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2023-12-02 13:44:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2072. [2023-12-02 13:44:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 2058 states have (on average 2.4727891156462585) internal successors, (5089), 2071 states have internal predecessors, (5089), 0 states have call successors, (0), 0 states have 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:44:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 5089 transitions. [2023-12-02 13:44:14,614 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 5089 transitions. Word has length 40 [2023-12-02 13:44:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:14,614 INFO L495 AbstractCegarLoop]: Abstraction has 2072 states and 5089 transitions. [2023-12-02 13:44:14,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:44:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 5089 transitions. [2023-12-02 13:44:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 13:44:14,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:14,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:14,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-02 13:44:14,616 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:14,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash 342672473, now seen corresponding path program 3 times [2023-12-02 13:44:14,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:14,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729992855] [2023-12-02 13:44:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:15,495 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:44:15,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:15,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729992855] [2023-12-02 13:44:15,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729992855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:15,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:15,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423440820] [2023-12-02 13:44:15,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:15,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:15,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:15,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:15,496 INFO L87 Difference]: Start difference. First operand 2072 states and 5089 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:44:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:15,892 INFO L93 Difference]: Finished difference Result 2196 states and 5355 transitions. [2023-12-02 13:44:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:44:15,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2023-12-02 13:44:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:15,895 INFO L225 Difference]: With dead ends: 2196 [2023-12-02 13:44:15,896 INFO L226 Difference]: Without dead ends: 2196 [2023-12-02 13:44:15,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:44:15,896 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 209 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:15,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 229 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:44:15,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2023-12-02 13:44:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1879. [2023-12-02 13:44:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1865 states have (on average 2.464343163538874) internal successors, (4596), 1878 states have internal predecessors, (4596), 0 states have call successors, (0), 0 states have 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:44:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4596 transitions. [2023-12-02 13:44:15,924 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4596 transitions. Word has length 40 [2023-12-02 13:44:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:15,924 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 4596 transitions. [2023-12-02 13:44:15,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:44:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4596 transitions. [2023-12-02 13:44:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 13:44:15,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:15,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:15,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-02 13:44:15,926 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:15,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash 268630272, now seen corresponding path program 1 times [2023-12-02 13:44:15,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:15,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486693346] [2023-12-02 13:44:15,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:15,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:16,748 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:44:16,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486693346] [2023-12-02 13:44:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486693346] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:16,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356366226] [2023-12-02 13:44:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:16,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:16,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:16,750 INFO L87 Difference]: Start difference. First operand 1879 states and 4596 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:44:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:17,167 INFO L93 Difference]: Finished difference Result 2434 states and 5929 transitions. [2023-12-02 13:44:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:44:17,167 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-02 13:44:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:17,170 INFO L225 Difference]: With dead ends: 2434 [2023-12-02 13:44:17,170 INFO L226 Difference]: Without dead ends: 2348 [2023-12-02 13:44:17,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:44:17,171 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 235 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:17,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 186 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:44:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2023-12-02 13:44:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2348. [2023-12-02 13:44:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2334 states have (on average 2.45458440445587) internal successors, (5729), 2347 states have internal predecessors, (5729), 0 states have call successors, (0), 0 states have 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:44:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 5729 transitions. [2023-12-02 13:44:17,197 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 5729 transitions. Word has length 41 [2023-12-02 13:44:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:17,198 INFO L495 AbstractCegarLoop]: Abstraction has 2348 states and 5729 transitions. [2023-12-02 13:44:17,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:44:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 5729 transitions. [2023-12-02 13:44:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 13:44:17,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:17,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:17,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-02 13:44:17,200 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:17,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1531733716, now seen corresponding path program 2 times [2023-12-02 13:44:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:17,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831990771] [2023-12-02 13:44:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:18,058 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:44:18,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831990771] [2023-12-02 13:44:18,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831990771] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:18,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:18,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 13:44:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157542355] [2023-12-02 13:44:18,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:18,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:44:18,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:18,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:44:18,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:44:18,059 INFO L87 Difference]: Start difference. First operand 2348 states and 5729 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:44:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:18,430 INFO L93 Difference]: Finished difference Result 2639 states and 6428 transitions. [2023-12-02 13:44:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:44:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-02 13:44:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:18,433 INFO L225 Difference]: With dead ends: 2639 [2023-12-02 13:44:18,433 INFO L226 Difference]: Without dead ends: 2553 [2023-12-02 13:44:18,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:44:18,434 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 214 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:18,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 218 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:44:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2023-12-02 13:44:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2084. [2023-12-02 13:44:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 2070 states have (on average 2.449275362318841) internal successors, (5070), 2083 states have internal predecessors, (5070), 0 states have call successors, (0), 0 states have 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:44:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 5070 transitions. [2023-12-02 13:44:18,459 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 5070 transitions. Word has length 41 [2023-12-02 13:44:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:18,459 INFO L495 AbstractCegarLoop]: Abstraction has 2084 states and 5070 transitions. [2023-12-02 13:44:18,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:44:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 5070 transitions. [2023-12-02 13:44:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 13:44:18,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:18,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:18,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-12-02 13:44:18,461 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:18,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2032912930, now seen corresponding path program 3 times [2023-12-02 13:44:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604330911] [2023-12-02 13:44:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:19,460 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:44:19,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:19,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604330911] [2023-12-02 13:44:19,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604330911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:19,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:19,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-02 13:44:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029710381] [2023-12-02 13:44:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:19,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 13:44:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 13:44:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:44:19,461 INFO L87 Difference]: Start difference. First operand 2084 states and 5070 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:44:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:19,955 INFO L93 Difference]: Finished difference Result 2110 states and 5124 transitions. [2023-12-02 13:44:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:44:19,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-02 13:44:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:19,959 INFO L225 Difference]: With dead ends: 2110 [2023-12-02 13:44:19,959 INFO L226 Difference]: Without dead ends: 2022 [2023-12-02 13:44:19,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2023-12-02 13:44:19,960 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 208 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:19,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 254 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:44:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2023-12-02 13:44:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1807. [2023-12-02 13:44:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1793 states have (on average 2.45287228109314) internal successors, (4398), 1806 states have internal predecessors, (4398), 0 states have call successors, (0), 0 states have 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:44:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 4398 transitions. [2023-12-02 13:44:19,985 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 4398 transitions. Word has length 41 [2023-12-02 13:44:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:19,985 INFO L495 AbstractCegarLoop]: Abstraction has 1807 states and 4398 transitions. [2023-12-02 13:44:19,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:44:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 4398 transitions. [2023-12-02 13:44:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 13:44:19,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:19,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:19,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-02 13:44:19,987 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:19,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash 676653925, now seen corresponding path program 1 times [2023-12-02 13:44:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:19,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835499640] [2023-12-02 13:44:19,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:19,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:20,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:20,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835499640] [2023-12-02 13:44:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835499640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:44:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:44:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:44:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908418988] [2023-12-02 13:44:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:44:20,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:44:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:44:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:44:20,294 INFO L87 Difference]: Start difference. First operand 1807 states and 4398 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:44:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:20,477 INFO L93 Difference]: Finished difference Result 1855 states and 4508 transitions. [2023-12-02 13:44:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:44:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2023-12-02 13:44:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:20,479 INFO L225 Difference]: With dead ends: 1855 [2023-12-02 13:44:20,479 INFO L226 Difference]: Without dead ends: 1855 [2023-12-02 13:44:20,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:44:20,480 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 76 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:20,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 183 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:44:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2023-12-02 13:44:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1777. [2023-12-02 13:44:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1765 states have (on average 2.459490084985836) internal successors, (4341), 1776 states have internal predecessors, (4341), 0 states have call successors, (0), 0 states have 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:44:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 4341 transitions. [2023-12-02 13:44:20,503 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 4341 transitions. Word has length 49 [2023-12-02 13:44:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:20,503 INFO L495 AbstractCegarLoop]: Abstraction has 1777 states and 4341 transitions. [2023-12-02 13:44:20,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:44:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 4341 transitions. [2023-12-02 13:44:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 13:44:20,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:20,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:20,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-12-02 13:44:20,505 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:20,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash 104692843, now seen corresponding path program 1 times [2023-12-02 13:44:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:20,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788888721] [2023-12-02 13:44:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:20,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:21,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:21,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788888721] [2023-12-02 13:44:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788888721] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:44:21,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865339100] [2023-12-02 13:44:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:21,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:44:21,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:44:21,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:44:21,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 13:44:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:21,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 13:44:21,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:44:21,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:44:21,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 13:44:21,816 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 13:44:21,816 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:44:21,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-12-02 13:44:21,963 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 47 treesize of output 36 [2023-12-02 13:44:22,015 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:44:22,079 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 42 treesize of output 33 [2023-12-02 13:44:22,233 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:44:22,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:44:22,284 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:44:22,371 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:44:22,475 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:44:22,656 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:44:22,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:44:22,861 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 146 treesize of output 113 [2023-12-02 13:44:23,244 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 166 treesize of output 129 [2023-12-02 13:44:23,251 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 20 treesize of output 14 [2023-12-02 13:44:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:23,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:44:35,350 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| Int) (v_ArrVal_1830 Int) (v_ArrVal_1833 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_15| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_15|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1824) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1824) |c_~#queue~0.base| (store (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| 4) |c_~#queue~0.offset| 4) v_ArrVal_1830) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 v_ArrVal_1833)) |c_~#stored_elements~0.base| v_ArrVal_1834) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)))))) is different from false [2023-12-02 13:44:35,404 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1822 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| Int) (v_ArrVal_1830 Int) (v_ArrVal_1833 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_15| Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1822))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_15|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1824) |c_~#queue~0.base|))) (or (not (= 20 (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1824) |c_~#queue~0.base| (store (store (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| 4) |c_~#queue~0.offset| 4) v_ArrVal_1830) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse2 v_ArrVal_1833)) |c_~#stored_elements~0.base| v_ArrVal_1834) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37|))))) is different from false [2023-12-02 13:44:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:35,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865339100] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:44:35,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1620707214] [2023-12-02 13:44:35,414 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:44:35,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:44:35,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 34 [2023-12-02 13:44:35,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717886415] [2023-12-02 13:44:35,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:44:35,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 13:44:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:35,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 13:44:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=793, Unknown=19, NotChecked=126, Total=1190 [2023-12-02 13:44:35,417 INFO L87 Difference]: Start difference. First operand 1777 states and 4341 transitions. Second operand has 35 states, 35 states have (on average 3.742857142857143) internal successors, (131), 34 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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:44:37,931 WARN L539 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:44:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:47,312 INFO L93 Difference]: Finished difference Result 2718 states and 6595 transitions. [2023-12-02 13:44:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 13:44:47,313 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.742857142857143) internal successors, (131), 34 states have internal predecessors, (131), 0 states have call successors, (0), 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 50 [2023-12-02 13:44:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:47,316 INFO L225 Difference]: With dead ends: 2718 [2023-12-02 13:44:47,316 INFO L226 Difference]: Without dead ends: 2718 [2023-12-02 13:44:47,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=491, Invalid=1564, Unknown=23, NotChecked=178, Total=2256 [2023-12-02 13:44:47,317 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 455 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 37 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 513 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:47,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 608 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1213 Invalid, 11 Unknown, 513 Unchecked, 4.2s Time] [2023-12-02 13:44:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2023-12-02 13:44:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2219. [2023-12-02 13:44:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 2207 states have (on average 2.448119619392841) internal successors, (5403), 2218 states have internal predecessors, (5403), 0 states have call successors, (0), 0 states have 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:44:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 5403 transitions. [2023-12-02 13:44:47,349 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 5403 transitions. Word has length 50 [2023-12-02 13:44:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:47,349 INFO L495 AbstractCegarLoop]: Abstraction has 2219 states and 5403 transitions. [2023-12-02 13:44:47,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.742857142857143) internal successors, (131), 34 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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:44:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 5403 transitions. [2023-12-02 13:44:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 13:44:47,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:47,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:47,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 13:44:47,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-12-02 13:44:47,552 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:47,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:47,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1696576065, now seen corresponding path program 2 times [2023-12-02 13:44:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:47,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431935503] [2023-12-02 13:44:47,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:48,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431935503] [2023-12-02 13:44:48,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431935503] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:44:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185033908] [2023-12-02 13:44:48,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:44:48,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:44:48,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:44:48,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:44:48,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 13:44:48,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 13:44:48,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:44:48,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 81 conjunts are in the unsatisfiable core [2023-12-02 13:44:48,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:44:48,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:44:48,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 13:44:49,009 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:44:49,009 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:44:49,057 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 28 treesize of output 21 [2023-12-02 13:44:49,138 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 47 treesize of output 36 [2023-12-02 13:44:49,210 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 42 treesize of output 33 [2023-12-02 13:44:49,333 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:44:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:44:49,415 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:44:49,481 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:44:49,574 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:44:49,658 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:44:49,735 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:44:49,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:44:49,833 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:44:50,007 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 58 treesize of output 42 [2023-12-02 13:44:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:50,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:44:50,075 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1954 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1954) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2023-12-02 13:44:50,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_1949 Int) (v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1947 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_1944 Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1944) .cse8 (+ .cse0 1))))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse4 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1947))) (or (not (= (select (select (store (store (store .cse1 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1948) |c_~#queue~0.base| (store (store (let ((.cse2 (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1948) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1949)) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_1953)) |c_~#stored_elements~0.base| v_ArrVal_1954) |c_~#queue~0.base|) .cse5) 20)) (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (= (select .cse6 .cse3) (select .cse6 .cse5)))))))))) is different from false [2023-12-02 13:44:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185033908] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:44:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069379141] [2023-12-02 13:44:51,289 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:44:51,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:44:51,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 38 [2023-12-02 13:44:51,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356887321] [2023-12-02 13:44:51,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:44:51,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 13:44:51,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:44:51,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 13:44:51,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1009, Unknown=41, NotChecked=142, Total=1482 [2023-12-02 13:44:51,292 INFO L87 Difference]: Start difference. First operand 2219 states and 5403 transitions. Second operand has 39 states, 39 states have (on average 3.358974358974359) internal successors, (131), 38 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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:44:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:44:55,705 INFO L93 Difference]: Finished difference Result 2800 states and 6784 transitions. [2023-12-02 13:44:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 13:44:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.358974358974359) internal successors, (131), 38 states have internal predecessors, (131), 0 states have call successors, (0), 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 50 [2023-12-02 13:44:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:44:55,709 INFO L225 Difference]: With dead ends: 2800 [2023-12-02 13:44:55,709 INFO L226 Difference]: Without dead ends: 2800 [2023-12-02 13:44:55,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=671, Invalid=2259, Unknown=48, NotChecked=214, Total=3192 [2023-12-02 13:44:55,710 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 830 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 87 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 549 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:44:55,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 750 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1560 Invalid, 59 Unknown, 549 Unchecked, 2.8s Time] [2023-12-02 13:44:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2023-12-02 13:44:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 1735. [2023-12-02 13:44:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1723 states have (on average 2.461404526987812) internal successors, (4241), 1734 states have internal predecessors, (4241), 0 states have call successors, (0), 0 states have 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:44:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 4241 transitions. [2023-12-02 13:44:55,734 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 4241 transitions. Word has length 50 [2023-12-02 13:44:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:44:55,734 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 4241 transitions. [2023-12-02 13:44:55,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.358974358974359) internal successors, (131), 38 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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:44:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 4241 transitions. [2023-12-02 13:44:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 13:44:55,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:44:55,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:44:55,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 13:44:55,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2023-12-02 13:44:55,937 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:44:55,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:44:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash -399615543, now seen corresponding path program 3 times [2023-12-02 13:44:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:44:55,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607444538] [2023-12-02 13:44:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:44:55,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:44:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:44:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:44:56,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:44:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607444538] [2023-12-02 13:44:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607444538] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:44:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215165213] [2023-12-02 13:44:56,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:44:56,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:44:56,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:44:56,927 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:44:56,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 13:44:57,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:44:57,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:44:57,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 82 conjunts are in the unsatisfiable core [2023-12-02 13:44:57,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:44:57,177 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:44:57,178 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:44:57,395 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 26 treesize of output 14 [2023-12-02 13:44:57,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:44:57,451 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 17 treesize of output 12 [2023-12-02 13:44:57,545 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 13:44:57,546 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 36 treesize of output 30 [2023-12-02 13:44:57,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 13:44:57,771 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 28 [2023-12-02 13:44:57,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:44:57,854 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 32 treesize of output 23 [2023-12-02 13:44:57,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 32 treesize of output 23 [2023-12-02 13:44:58,121 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 52 treesize of output 28 [2023-12-02 13:44:58,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-12-02 13:44:58,281 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 40 treesize of output 30 [2023-12-02 13:44:58,283 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 40 treesize of output 28 [2023-12-02 13:44:58,310 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:44:58,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:44:58,776 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2069 Int) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25| Int) (v_ArrVal_2071 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2066) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2067) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|)) (+ |c_~#queue~0.offset| 80) v_ArrVal_2069) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2071) .cse1) 2147483647)))) is different from false [2023-12-02 13:44:58,812 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2069 Int) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25| Int) (v_ArrVal_2071 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2067) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|)) (+ |c_~#queue~0.offset| 80) v_ArrVal_2069) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2071) .cse1) 2147483647)))) is different from false [2023-12-02 13:44:58,843 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_2069 Int) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25| Int) (v_ArrVal_2071 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2067) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|)) (+ |c_~#queue~0.offset| 80) v_ArrVal_2069) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2071) .cse1) 2147483647))))) is different from false [2023-12-02 13:44:59,481 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2069 Int) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25| Int) (v_ArrVal_2061 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_2071 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse5 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2060) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2061)))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse5 .cse3))) (let ((.cse1 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse2 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2067) |c_~#queue~0.base|))) (or (= .cse0 20) (< (select (store (store (store .cse1 .cse2 (+ (- 1) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|)) (+ |c_~#queue~0.offset| 80) v_ArrVal_2069) (+ |c_~#queue~0.offset| (* (select .cse1 .cse3) 4)) v_ArrVal_2071) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|) (< 2147483646 |t1Thread1of1ForFork1_enqueue_#t~post38#1|))))))) is different from false [2023-12-02 13:44:59,542 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2069 Int) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25| Int) (v_ArrVal_2061 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_2071 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (let ((.cse5 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2060) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2061)))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse5 .cse3))) (let ((.cse1 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse2 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2067) |c_~#queue~0.base|))) (or (= 20 .cse0) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|) (< (select (store (store (store .cse1 .cse2 (+ (- 1) |v_t2Thread1of1ForFork0_dequeue_#t~post45#1_25|)) (+ |c_~#queue~0.offset| 80) v_ArrVal_2069) (+ |c_~#queue~0.offset| (* (select .cse1 .cse3) 4)) v_ArrVal_2071) .cse2) 2147483647) (< 2147483646 |t1Thread1of1ForFork1_enqueue_#t~post38#1|))))))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 20)) is different from false [2023-12-02 13:44:59,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:44:59,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 594 treesize of output 294 [2023-12-02 13:44:59,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:44:59,575 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 405 treesize of output 395 [2023-12-02 13:44:59,590 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 244 treesize of output 220 [2023-12-02 13:44:59,604 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 83 treesize of output 71 [2023-12-02 13:44:59,617 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:44:59,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 13:44:59,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:44:59,927 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 176 treesize of output 136 [2023-12-02 13:45:00,139 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:45:00,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215165213] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:45:00,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [391845563] [2023-12-02 13:45:00,141 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 13:45:00,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:45:00,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 42 [2023-12-02 13:45:00,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831124174] [2023-12-02 13:45:00,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:45:00,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-02 13:45:00,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:45:00,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-02 13:45:00,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1198, Unknown=21, NotChecked=380, Total=1806 [2023-12-02 13:45:00,145 INFO L87 Difference]: Start difference. First operand 1735 states and 4241 transitions. Second operand has 43 states, 43 states have (on average 3.441860465116279) internal successors, (148), 42 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have 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:45:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:45:02,560 INFO L93 Difference]: Finished difference Result 1723 states and 4193 transitions. [2023-12-02 13:45:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 13:45:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.441860465116279) internal successors, (148), 42 states have internal predecessors, (148), 0 states have call successors, (0), 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 50 [2023-12-02 13:45:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:45:02,562 INFO L225 Difference]: With dead ends: 1723 [2023-12-02 13:45:02,562 INFO L226 Difference]: Without dead ends: 1723 [2023-12-02 13:45:02,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=650, Invalid=2655, Unknown=21, NotChecked=580, Total=3906 [2023-12-02 13:45:02,563 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 907 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1272 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:45:02,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 390 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1137 Invalid, 0 Unknown, 1272 Unchecked, 1.1s Time] [2023-12-02 13:45:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2023-12-02 13:45:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1559. [2023-12-02 13:45:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1549 states have (on average 2.4499677211103936) internal successors, (3795), 1558 states have internal predecessors, (3795), 0 states have call successors, (0), 0 states have 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:45:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 3795 transitions. [2023-12-02 13:45:02,585 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 3795 transitions. Word has length 50 [2023-12-02 13:45:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:45:02,586 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 3795 transitions. [2023-12-02 13:45:02,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.441860465116279) internal successors, (148), 42 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have 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:45:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 3795 transitions. [2023-12-02 13:45:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 13:45:02,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:45:02,587 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:45:02,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 13:45:02,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2023-12-02 13:45:02,788 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:45:02,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:45:02,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1283145650, now seen corresponding path program 1 times [2023-12-02 13:45:02,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:45:02,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024518054] [2023-12-02 13:45:02,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:45:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:03,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:45:03,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024518054] [2023-12-02 13:45:03,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024518054] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:45:03,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711616760] [2023-12-02 13:45:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:03,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:45:03,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:45:03,390 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:45:03,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 13:45:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:03,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-02 13:45:03,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:45:03,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 13:45:03,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:03,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-12-02 13:45:04,013 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 13:45:04,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-12-02 13:45:04,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-12-02 13:45:04,234 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 23 [2023-12-02 13:45:04,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:04,305 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 34 treesize of output 25 [2023-12-02 13:45:04,507 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 41 treesize of output 21 [2023-12-02 13:45:04,566 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 41 treesize of output 21 [2023-12-02 13:45:04,639 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 13:45:04,640 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 53 treesize of output 39 [2023-12-02 13:45:04,704 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 41 treesize of output 21 [2023-12-02 13:45:04,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-12-02 13:45:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:04,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:45:05,233 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2189 Int) (v_ArrVal_2186 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2186) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2189)) .cse1))))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 20)) is different from false [2023-12-02 13:45:05,244 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_2189 Int) (v_ArrVal_2186 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (< 0 (+ 2147483650 (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2186) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2189)) .cse2)))))))) is different from false [2023-12-02 13:45:05,513 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2189 Int) (v_ArrVal_2186 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_2181 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse4 (let ((.cse5 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2180) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2181)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (< 0 (+ (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2186) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2189)) .cse2) 2147483650))))))) is different from false [2023-12-02 13:45:05,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:05,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 421 treesize of output 205 [2023-12-02 13:45:05,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:05,787 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 265 treesize of output 253 [2023-12-02 13:45:05,794 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:45:05,803 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:45:05,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 13:45:05,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:05,857 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 124 treesize of output 92 [2023-12-02 13:45:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 13:45:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711616760] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:45:05,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [311233590] [2023-12-02 13:45:05,918 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:45:05,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:45:05,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 16] total 37 [2023-12-02 13:45:05,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860997694] [2023-12-02 13:45:05,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:45:05,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 13:45:05,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:45:05,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 13:45:05,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1053, Unknown=22, NotChecked=210, Total=1482 [2023-12-02 13:45:05,921 INFO L87 Difference]: Start difference. First operand 1559 states and 3795 transitions. Second operand has 39 states, 38 states have (on average 4.105263157894737) internal successors, (156), 38 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have 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:45:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:45:09,400 INFO L93 Difference]: Finished difference Result 3848 states and 9382 transitions. [2023-12-02 13:45:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 13:45:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.105263157894737) internal successors, (156), 38 states have internal predecessors, (156), 0 states have call successors, (0), 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 54 [2023-12-02 13:45:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:45:09,407 INFO L225 Difference]: With dead ends: 3848 [2023-12-02 13:45:09,408 INFO L226 Difference]: Without dead ends: 3848 [2023-12-02 13:45:09,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=481, Invalid=2161, Unknown=22, NotChecked=306, Total=2970 [2023-12-02 13:45:09,409 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 580 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 3481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1078 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:45:09,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 839 Invalid, 3481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2273 Invalid, 0 Unknown, 1078 Unchecked, 2.5s Time] [2023-12-02 13:45:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2023-12-02 13:45:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 1948. [2023-12-02 13:45:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1938 states have (on average 2.442724458204334) internal successors, (4734), 1947 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have 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:45:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 4734 transitions. [2023-12-02 13:45:09,457 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 4734 transitions. Word has length 54 [2023-12-02 13:45:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:45:09,458 INFO L495 AbstractCegarLoop]: Abstraction has 1948 states and 4734 transitions. [2023-12-02 13:45:09,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.105263157894737) internal successors, (156), 38 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have 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:45:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 4734 transitions. [2023-12-02 13:45:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 13:45:09,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:45:09,460 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:45:09,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 13:45:09,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2023-12-02 13:45:09,661 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:45:09,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:45:09,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2087474796, now seen corresponding path program 2 times [2023-12-02 13:45:09,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:45:09,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403154698] [2023-12-02 13:45:09,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:45:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:10,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:45:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403154698] [2023-12-02 13:45:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403154698] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:45:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500725508] [2023-12-02 13:45:10,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:45:10,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:45:10,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:45:10,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:45:10,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 13:45:10,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 13:45:10,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:45:10,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 13:45:10,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:45:10,672 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:45:10,672 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:45:10,923 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:45:10,960 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:45:11,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:11,029 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:45:11,130 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:45:11,168 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:45:11,216 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-12-02 13:45:11,216 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:45:11,252 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:45:11,259 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:45:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:11,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:45:11,736 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2305 Int)) (or (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2301) |c_~#stored_elements~0.base| v_ArrVal_2302) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2305)) .cse1)))) (< (+ v_ArrVal_2305 2147483648) 0))) is different from false [2023-12-02 13:45:11,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:11,749 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 56 treesize of output 47 [2023-12-02 13:45:11,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:11,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 127 [2023-12-02 13:45:11,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 110 [2023-12-02 13:45:11,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-02 13:45:11,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-12-02 13:45:11,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:11,808 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 64 treesize of output 56 [2023-12-02 13:45:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:12,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500725508] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:45:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1641511213] [2023-12-02 13:45:12,018 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 13:45:12,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:45:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 28 [2023-12-02 13:45:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279193312] [2023-12-02 13:45:12,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:45:12,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 13:45:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:45:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 13:45:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=687, Unknown=5, NotChecked=54, Total=870 [2023-12-02 13:45:12,019 INFO L87 Difference]: Start difference. First operand 1948 states and 4734 transitions. Second operand has 30 states, 29 states have (on average 5.448275862068965) internal successors, (158), 29 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have 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:45:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:45:12,729 INFO L93 Difference]: Finished difference Result 1936 states and 4706 transitions. [2023-12-02 13:45:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:45:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.448275862068965) internal successors, (158), 29 states have internal predecessors, (158), 0 states have call successors, (0), 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 54 [2023-12-02 13:45:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:45:12,732 INFO L225 Difference]: With dead ends: 1936 [2023-12-02 13:45:12,732 INFO L226 Difference]: Without dead ends: 1936 [2023-12-02 13:45:12,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=806, Unknown=5, NotChecked=60, Total=1056 [2023-12-02 13:45:12,733 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 332 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:45:12,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 241 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 637 Invalid, 0 Unknown, 117 Unchecked, 0.6s Time] [2023-12-02 13:45:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2023-12-02 13:45:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1547. [2023-12-02 13:45:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1539 states have (on average 2.4411955815464585) internal successors, (3757), 1546 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states have 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:45:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3757 transitions. [2023-12-02 13:45:12,756 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3757 transitions. Word has length 54 [2023-12-02 13:45:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:45:12,756 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 3757 transitions. [2023-12-02 13:45:12,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.448275862068965) internal successors, (158), 29 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have 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:45:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3757 transitions. [2023-12-02 13:45:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 13:45:12,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:45:12,758 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:45:12,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 13:45:12,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2023-12-02 13:45:12,959 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:45:12,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:45:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1122808655, now seen corresponding path program 1 times [2023-12-02 13:45:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:45:12,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761545020] [2023-12-02 13:45:12,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:12,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:45:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:14,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:45:14,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761545020] [2023-12-02 13:45:14,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761545020] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:45:14,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083763934] [2023-12-02 13:45:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:14,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:45:14,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:45:14,835 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:45:14,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 13:45:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:15,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-02 13:45:15,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:45:15,070 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:45:15,070 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:45:15,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:15,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 13:45:15,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-12-02 13:45:15,206 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 47 treesize of output 36 [2023-12-02 13:45:15,266 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:45:15,324 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 42 treesize of output 33 [2023-12-02 13:45:15,491 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:45:15,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:15,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 13:45:15,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-12-02 13:45:15,704 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:45:15,885 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:45:15,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:15,971 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:45:16,176 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:45:16,251 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:45:16,349 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:45:16,424 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 60 treesize of output 45 [2023-12-02 13:45:16,485 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 52 treesize of output 38 [2023-12-02 13:45:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:16,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:45:16,858 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2433 Int) (v_ArrVal_2430 (Array Int Int))) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2430) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2433)) .cse1)) 2147483647)) is different from false [2023-12-02 13:45:16,984 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2433 Int) (v_ArrVal_2430 (Array Int Int))) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2430) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2433)) .cse1)) 2147483647)) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 20)) is different from false [2023-12-02 13:45:16,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_2433 Int) (v_ArrVal_2430 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2430) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2433)) .cse2)) 2147483647))))) is different from false [2023-12-02 13:45:17,183 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2433 Int) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2426 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2424) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2426)))) (let ((.cse0 (select .cse3 .cse2))) (or (= 20 .cse0) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2430) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2433)) .cse2) 2147483647)))))) is different from false [2023-12-02 13:45:17,210 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2433 Int) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2426 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2424) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2426)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2430) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2433)) .cse1) 2147483647) (= .cse4 20)))))) is different from false [2023-12-02 13:45:17,412 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2421 Int) (v_ArrVal_2433 Int) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2426 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2421) .cse7 (+ .cse8 1))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2424) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2426)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2430) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2433)) .cse1) 2147483647) (= 20 .cse4)))))) (= .cse8 20)))) is different from false [2023-12-02 13:45:17,449 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2421 Int) (v_ArrVal_2420 (Array Int Int)) (v_ArrVal_2433 Int) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2426 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2420))) (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse8 .cse9))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2421) .cse9 (+ .cse5 1))))) (let ((.cse4 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2424) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2426)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2430) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2433)) .cse2) 2147483647) (= .cse5 20))))))))) is different from false [2023-12-02 13:45:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 13:45:17,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083763934] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:45:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1259697894] [2023-12-02 13:45:17,986 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:45:17,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:45:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 50 [2023-12-02 13:45:17,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559243375] [2023-12-02 13:45:17,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:45:17,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 13:45:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:45:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 13:45:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1708, Unknown=16, NotChecked=644, Total=2652 [2023-12-02 13:45:17,988 INFO L87 Difference]: Start difference. First operand 1547 states and 3757 transitions. Second operand has 52 states, 51 states have (on average 3.196078431372549) internal successors, (163), 51 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have 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:45:30,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:45:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:45:30,971 INFO L93 Difference]: Finished difference Result 2771 states and 6744 transitions. [2023-12-02 13:45:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-02 13:45:30,972 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 3.196078431372549) internal successors, (163), 51 states have internal predecessors, (163), 0 states have call successors, (0), 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 55 [2023-12-02 13:45:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:45:30,975 INFO L225 Difference]: With dead ends: 2771 [2023-12-02 13:45:30,976 INFO L226 Difference]: Without dead ends: 2709 [2023-12-02 13:45:30,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 76 SyntacticMatches, 13 SemanticMatches, 81 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=785, Invalid=4888, Unknown=55, NotChecked=1078, Total=6806 [2023-12-02 13:45:30,977 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1298 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 130 mSolverCounterUnsat, 164 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 5733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 164 IncrementalHoareTripleChecker+Unknown, 2826 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:45:30,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 1155 Invalid, 5733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2613 Invalid, 164 Unknown, 2826 Unchecked, 8.4s Time] [2023-12-02 13:45:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2023-12-02 13:45:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2247. [2023-12-02 13:45:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 2239 states have (on average 2.4756587762393925) internal successors, (5543), 2246 states have internal predecessors, (5543), 0 states have call successors, (0), 0 states have 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:45:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 5543 transitions. [2023-12-02 13:45:31,015 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 5543 transitions. Word has length 55 [2023-12-02 13:45:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:45:31,015 INFO L495 AbstractCegarLoop]: Abstraction has 2247 states and 5543 transitions. [2023-12-02 13:45:31,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.196078431372549) internal successors, (163), 51 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have 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:45:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 5543 transitions. [2023-12-02 13:45:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 13:45:31,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:45:31,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:45:31,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 13:45:31,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2023-12-02 13:45:31,218 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:45:31,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:45:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash -250361546, now seen corresponding path program 1 times [2023-12-02 13:45:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:45:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334038658] [2023-12-02 13:45:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:45:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:31,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:45:31,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334038658] [2023-12-02 13:45:31,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334038658] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:45:31,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312455867] [2023-12-02 13:45:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:31,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:45:31,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:45:31,979 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:45:32,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 13:45:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:32,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 13:45:32,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:45:32,534 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:45:32,594 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:45:32,722 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2023-12-02 13:45:32,723 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2023-12-02 13:45:32,895 INFO L349 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2023-12-02 13:45:32,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 64 [2023-12-02 13:45:33,027 INFO L349 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2023-12-02 13:45:33,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 62 [2023-12-02 13:45:33,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:33,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-12-02 13:45:33,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 13:45:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:33,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:45:33,180 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2564 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2564) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483648))) is different from false [2023-12-02 13:45:33,191 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2564 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 1)) |c_~#stored_elements~0.base| v_ArrVal_2564) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483648))) is different from false [2023-12-02 13:45:34,640 INFO L349 Elim1Store]: treesize reduction 725, result has 39.6 percent of original size [2023-12-02 13:45:34,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 1231 treesize of output 1119 [2023-12-02 13:45:34,798 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:45:34,832 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-12-02 13:45:34,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 494 treesize of output 476 [2023-12-02 13:45:34,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:34,942 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 613 treesize of output 603 [2023-12-02 13:45:35,022 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 165 treesize of output 149 [2023-12-02 13:45:35,073 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 23 treesize of output 15 [2023-12-02 13:45:35,248 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 40 treesize of output 32 [2023-12-02 13:45:35,604 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 23 treesize of output 15 [2023-12-02 13:45:35,638 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 23 treesize of output 15 [2023-12-02 13:45:35,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:35,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 112 treesize of output 171 [2023-12-02 13:45:36,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:36,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 138 treesize of output 194 [2023-12-02 13:45:36,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:36,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 270 treesize of output 326 [2023-12-02 13:45:37,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:37,344 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 51 treesize of output 53 [2023-12-02 13:45:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 13:45:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312455867] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:45:37,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1022066557] [2023-12-02 13:45:37,491 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:45:37,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:45:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2023-12-02 13:45:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627611101] [2023-12-02 13:45:37,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:45:37,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 13:45:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:45:37,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 13:45:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=526, Unknown=6, NotChecked=98, Total=756 [2023-12-02 13:45:37,493 INFO L87 Difference]: Start difference. First operand 2247 states and 5543 transitions. Second operand has 28 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have 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:45:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:45:38,629 INFO L93 Difference]: Finished difference Result 2655 states and 6527 transitions. [2023-12-02 13:45:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 13:45:38,629 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 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 65 [2023-12-02 13:45:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:45:38,633 INFO L225 Difference]: With dead ends: 2655 [2023-12-02 13:45:38,633 INFO L226 Difference]: Without dead ends: 2655 [2023-12-02 13:45:38,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 113 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=777, Unknown=6, NotChecked=122, Total=1122 [2023-12-02 13:45:38,633 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 330 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:45:38,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 536 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1048 Invalid, 0 Unknown, 400 Unchecked, 0.9s Time] [2023-12-02 13:45:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2023-12-02 13:45:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1687. [2023-12-02 13:45:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1681 states have (on average 2.451516954193932) internal successors, (4121), 1686 states have internal predecessors, (4121), 0 states have call successors, (0), 0 states have 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:45:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4121 transitions. [2023-12-02 13:45:38,666 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4121 transitions. Word has length 65 [2023-12-02 13:45:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:45:38,666 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 4121 transitions. [2023-12-02 13:45:38,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have 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:45:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4121 transitions. [2023-12-02 13:45:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-02 13:45:38,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:45:38,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:45:38,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 13:45:38,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2023-12-02 13:45:38,869 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:45:38,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:45:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1838218431, now seen corresponding path program 1 times [2023-12-02 13:45:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:45:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633059918] [2023-12-02 13:45:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:45:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:41,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:45:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633059918] [2023-12-02 13:45:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633059918] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:45:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411112063] [2023-12-02 13:45:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:41,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:45:41,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:45:41,043 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:45:41,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 13:45:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:41,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 13:45:41,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:45:41,575 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:45:41,707 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2023-12-02 13:45:41,707 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2023-12-02 13:45:41,898 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-02 13:45:41,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 47 [2023-12-02 13:45:41,955 INFO L349 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2023-12-02 13:45:41,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 55 [2023-12-02 13:45:42,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:42,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-12-02 13:45:42,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-02 13:45:42,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 13:45:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:42,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:45:43,001 INFO L349 Elim1Store]: treesize reduction 264, result has 41.1 percent of original size [2023-12-02 13:45:43,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 255 [2023-12-02 13:45:43,031 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-02 13:45:43,031 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 138 [2023-12-02 13:45:43,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:45:43,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 181 [2023-12-02 13:45:43,138 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 74 treesize of output 66 [2023-12-02 13:45:43,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2023-12-02 13:45:47,059 INFO L349 Elim1Store]: treesize reduction 130, result has 80.3 percent of original size [2023-12-02 13:45:47,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 359 treesize of output 766 [2023-12-02 13:45:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411112063] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:45:50,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [889915058] [2023-12-02 13:45:50,627 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:45:50,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:45:50,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 10] total 37 [2023-12-02 13:45:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205980373] [2023-12-02 13:45:50,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:45:50,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 13:45:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:45:50,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 13:45:50,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1225, Unknown=16, NotChecked=0, Total=1482 [2023-12-02 13:45:50,629 INFO L87 Difference]: Start difference. First operand 1687 states and 4121 transitions. Second operand has 39 states, 38 states have (on average 5.342105263157895) internal successors, (203), 38 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have 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:45:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:45:54,849 INFO L93 Difference]: Finished difference Result 3378 states and 8192 transitions. [2023-12-02 13:45:54,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 13:45:54,850 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 5.342105263157895) internal successors, (203), 38 states have internal predecessors, (203), 0 states have call successors, (0), 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 68 [2023-12-02 13:45:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:45:54,855 INFO L225 Difference]: With dead ends: 3378 [2023-12-02 13:45:54,855 INFO L226 Difference]: Without dead ends: 3378 [2023-12-02 13:45:54,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=917, Invalid=4037, Unknown=16, NotChecked=0, Total=4970 [2023-12-02 13:45:54,856 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 767 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:45:54,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 869 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 13:45:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3378 states. [2023-12-02 13:45:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3378 to 1671. [2023-12-02 13:45:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1667 states have (on average 2.443911217756449) internal successors, (4074), 1670 states have internal predecessors, (4074), 0 states have call successors, (0), 0 states have 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:45:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 4074 transitions. [2023-12-02 13:45:54,897 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 4074 transitions. Word has length 68 [2023-12-02 13:45:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:45:54,897 INFO L495 AbstractCegarLoop]: Abstraction has 1671 states and 4074 transitions. [2023-12-02 13:45:54,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 5.342105263157895) internal successors, (203), 38 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have 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:45:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 4074 transitions. [2023-12-02 13:45:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 13:45:54,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:45:54,900 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:45:54,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-02 13:45:55,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2023-12-02 13:45:55,101 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:45:55,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:45:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1150197372, now seen corresponding path program 1 times [2023-12-02 13:45:55,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:45:55,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323100773] [2023-12-02 13:45:55,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:55,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:45:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:45:56,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:45:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323100773] [2023-12-02 13:45:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323100773] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:45:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502054325] [2023-12-02 13:45:56,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:45:56,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:45:56,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:45:56,763 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:45:56,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 13:45:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:45:57,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 80 conjunts are in the unsatisfiable core [2023-12-02 13:45:57,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:45:57,078 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:45:57,078 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:45:57,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:57,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 13:45:57,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-12-02 13:45:57,229 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 47 treesize of output 36 [2023-12-02 13:45:57,286 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:45:57,358 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 42 treesize of output 33 [2023-12-02 13:45:57,547 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:45:57,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:57,616 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:45:57,739 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:45:57,869 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:45:58,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 64 [2023-12-02 13:45:58,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:45:58,348 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 193 treesize of output 150 [2023-12-02 13:45:58,944 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 200 treesize of output 157 [2023-12-02 13:45:59,233 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 200 treesize of output 157 [2023-12-02 13:45:59,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 448 treesize of output 355 [2023-12-02 13:46:00,372 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 2027 treesize of output 1644 [2023-12-02 13:46:00,383 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 20 treesize of output 14 [2023-12-02 13:46:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:46:00,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:46:01,808 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork0_dequeue_#t~post48#1| Int) (v_ArrVal_2840 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (v_ArrVal_2844 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store (store (store .cse0 (+ 88 |c_~#queue~0.offset|) (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork0_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2844)) .cse1)) 20)) is different from false [2023-12-02 13:46:01,832 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2838 Int) (|t2Thread1of1ForFork0_dequeue_#t~post48#1| Int) (v_ArrVal_2840 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (v_ArrVal_2844 Int)) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_2838) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2838)) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store (store (store .cse0 (+ 88 |c_~#queue~0.offset|) (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork0_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2844)) .cse1)) 20))) is different from false [2023-12-02 13:46:01,860 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2838 Int) (|t2Thread1of1ForFork0_dequeue_#t~post48#1| Int) (v_ArrVal_2840 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (v_ArrVal_2844 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2838) (< (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2838)) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store (store (store .cse2 (+ 88 |c_~#queue~0.offset|) (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork0_dequeue_#t~post48#1| 1)) (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2844)) .cse3)) 20)))) is different from false [2023-12-02 13:46:01,877 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2838 Int) (|t2Thread1of1ForFork0_dequeue_#t~post48#1| Int) (v_ArrVal_2840 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (v_ArrVal_2844 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_2838)) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store (store (store .cse0 (+ 88 |c_~#queue~0.offset|) (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork0_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2844)) .cse1)) 20) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2838)))) is different from false [2023-12-02 13:46:04,472 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2838 Int) (v_ArrVal_2834 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post48#1| Int) (v_ArrVal_2840 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_117| Int) (v_ArrVal_2844 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_2835 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_117| 1))))) (let ((.cse2 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2834) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2835)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_117|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2838) (< (select (let ((.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_2838)) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store (store (store .cse4 .cse5 (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork0_dequeue_#t~post48#1| 1)) (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2844))) .cse3) 20)))))) is different from false [2023-12-02 13:46:04,498 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2838 Int) (v_ArrVal_2834 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post48#1| Int) (v_ArrVal_2840 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_117| Int) (v_ArrVal_2831 Int) (v_ArrVal_2844 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_2835 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2831) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_117| 1))))) (let ((.cse2 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2834) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2835)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_117|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2838) (< (select (let ((.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_2838)) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store (store (store .cse4 .cse5 (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork0_dequeue_#t~post48#1| 1)) (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2844))) .cse3) 20)))))) is different from false [2023-12-02 13:46:04,549 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2838 Int) (v_ArrVal_2834 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post48#1| Int) (v_ArrVal_2830 (Array Int Int)) (v_ArrVal_2840 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_117| Int) (v_ArrVal_2831 Int) (v_ArrVal_2844 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_2835 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2830))) (let ((.cse5 (select .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2831) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_117| 1))))) (let ((.cse4 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2834) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2835)))) (or (< (select (let ((.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse1 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse2 v_ArrVal_2838)) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) (+ |c_~#queue~0.offset| 80) (+ |t2Thread1of1ForFork0_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2844))) .cse2) 20) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_117|) (< (+ (select .cse4 .cse2) 1) v_ArrVal_2838))))))) is different from false [2023-12-02 13:46:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 13:46:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502054325] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:46:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [974061473] [2023-12-02 13:46:05,202 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 13:46:05,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:46:05,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 19] total 46 [2023-12-02 13:46:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97971809] [2023-12-02 13:46:05,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:46:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-02 13:46:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:46:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-02 13:46:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1231, Unknown=24, NotChecked=574, Total=2162 [2023-12-02 13:46:05,204 INFO L87 Difference]: Start difference. First operand 1671 states and 4074 transitions. Second operand has 47 states, 47 states have (on average 3.893617021276596) internal successors, (183), 46 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:46:17,640 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2838 Int) (v_ArrVal_2834 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post48#1| Int) (v_ArrVal_2840 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (v_ArrVal_2844 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_2835 Int)) (let ((.cse4 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2834) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2835)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse1 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_2838)) |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) .cse2 (+ |t2Thread1of1ForFork0_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse3))) v_ArrVal_2844)) .cse3) 20) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2838)))) (forall ((|t2Thread1of1ForFork0_dequeue_#t~post48#1| Int) (v_ArrVal_2840 (Array Int Int)) (|t2Thread1of1ForFork0_dequeue_#t~post45#1| Int) (v_ArrVal_2844 Int)) (< (select (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2840) |c_~#queue~0.base|))) (store (store (store .cse6 .cse1 (+ (- 1) |t2Thread1of1ForFork0_dequeue_#t~post45#1|)) .cse2 (+ |t2Thread1of1ForFork0_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse6 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2844)) .cse3) 20)))) is different from false [2023-12-02 13:46:20,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:46:22,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:46:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:46:25,032 INFO L93 Difference]: Finished difference Result 2291 states and 5532 transitions. [2023-12-02 13:46:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 13:46:25,032 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.893617021276596) internal successors, (183), 46 states have internal predecessors, (183), 0 states have call successors, (0), 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 69 [2023-12-02 13:46:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:46:25,036 INFO L225 Difference]: With dead ends: 2291 [2023-12-02 13:46:25,036 INFO L226 Difference]: Without dead ends: 2291 [2023-12-02 13:46:25,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 106 SyntacticMatches, 16 SemanticMatches, 66 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=784, Invalid=2762, Unknown=26, NotChecked=984, Total=4556 [2023-12-02 13:46:25,037 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 646 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 91 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 4316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 2822 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:46:25,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 691 Invalid, 4316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1393 Invalid, 10 Unknown, 2822 Unchecked, 12.0s Time] [2023-12-02 13:46:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2023-12-02 13:46:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2053. [2023-12-02 13:46:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2049 states have (on average 2.4572962420693023) internal successors, (5035), 2052 states have internal predecessors, (5035), 0 states have call successors, (0), 0 states have 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:46:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 5035 transitions. [2023-12-02 13:46:25,078 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 5035 transitions. Word has length 69 [2023-12-02 13:46:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:46:25,078 INFO L495 AbstractCegarLoop]: Abstraction has 2053 states and 5035 transitions. [2023-12-02 13:46:25,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.893617021276596) internal successors, (183), 46 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:46:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 5035 transitions. [2023-12-02 13:46:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 13:46:25,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:46:25,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:46:25,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 13:46:25,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2023-12-02 13:46:25,282 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-12-02 13:46:25,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:46:25,282 INFO L85 PathProgramCache]: Analyzing trace with hash -167764290, now seen corresponding path program 1 times [2023-12-02 13:46:25,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:46:25,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569831698] [2023-12-02 13:46:25,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:46:25,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:46:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:46:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:46:27,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:46:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569831698] [2023-12-02 13:46:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569831698] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:46:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227220337] [2023-12-02 13:46:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:46:27,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:46:27,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:46:27,119 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:46:27,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34823443-f954-42a9-a525-7dc455bf0324/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 13:46:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:46:27,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 92 conjunts are in the unsatisfiable core [2023-12-02 13:46:27,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:46:27,388 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 13:46:27,389 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:46:27,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:46:27,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 13:46:27,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-12-02 13:46:27,519 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 47 treesize of output 36 [2023-12-02 13:46:27,578 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:46:27,640 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 42 treesize of output 33 [2023-12-02 13:46:27,789 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:46:27,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:46:27,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2023-12-02 13:46:27,945 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:46:28,043 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:46:28,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 64 [2023-12-02 13:46:28,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:46:28,453 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 193 treesize of output 150 [2023-12-02 13:46:28,860 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 200 treesize of output 157 [2023-12-02 13:46:29,242 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 213 treesize of output 168 [2023-12-02 13:46:29,880 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 491 treesize of output 388 [2023-12-02 13:46:30,614 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 2238 treesize of output 1813 [2023-12-02 13:46:34,546 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 10527 treesize of output 8452 [2023-12-02 13:46:40,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:46:40,643 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 38475 treesize of output 30788 [2023-12-02 13:46:49,221 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 38482 treesize of output 30795 [2023-12-02 13:46:54,479 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 132948 treesize of output 105430 [2023-12-02 13:46:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:46:54,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:47:20,460 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2991 Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2995 Int) (v_ArrVal_2987 Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2987)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2988) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| 1)) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2991) (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_2995))) |c_~#stored_elements~0.base| v_ArrVal_2996) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_2987) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65|))))) is different from false [2023-12-02 13:47:49,846 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2991 Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2995 Int) (v_ArrVal_2983 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| Int) (v_ArrVal_2987 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse2 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2982) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2983))) (.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_2987)) |c_~#stored_elements~0.base| v_ArrVal_2988) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2987) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2991) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| 1)) .cse3 v_ArrVal_2995)) |c_~#stored_elements~0.base| v_ArrVal_2996) |c_~#queue~0.base|) .cse1) 2147483647)))))) is different from false [2023-12-02 13:47:49,964 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2991 Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2995 Int) (v_ArrVal_2983 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| Int) (v_ArrVal_2987 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| 1))))) (let ((.cse7 (let ((.cse8 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2982) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse3))) v_ArrVal_2983))) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse7 .cse4 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_2987)) |c_~#stored_elements~0.base| v_ArrVal_2988) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| 1)) (+ |c_~#queue~0.offset| (* (select .cse1 .cse3) 4)) v_ArrVal_2991) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| 1)) .cse3 v_ArrVal_2995)) |c_~#stored_elements~0.base| v_ArrVal_2996) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65|) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129|) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2987))))))) is different from false [2023-12-02 13:47:50,000 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| Int) (v_ArrVal_2991 Int) (v_ArrVal_2995 Int) (v_ArrVal_2983 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2979) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| 1))))) (let ((.cse0 (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2982) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_2983))) (.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 v_ArrVal_2987)) |c_~#stored_elements~0.base| v_ArrVal_2988) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2987) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| 1)) (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2991) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| 1)) .cse1 v_ArrVal_2995)) |c_~#stored_elements~0.base| v_ArrVal_2996) |c_~#queue~0.base|) .cse4) 2147483647) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129|))))))) is different from false [2023-12-02 13:47:50,066 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| Int) (v_ArrVal_2991 Int) (v_ArrVal_2995 Int) (v_ArrVal_2983 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2978))) (let ((.cse5 (select .cse9 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store .cse9 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2979) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| 1))))) (let ((.cse7 (let ((.cse8 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2982) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) v_ArrVal_2983))) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse7 .cse4 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_2987)) |c_~#stored_elements~0.base| v_ArrVal_2988) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| 1)) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2991) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| 1)) .cse3 v_ArrVal_2995)) |c_~#stored_elements~0.base| v_ArrVal_2996) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129|) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2987) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65|)))))))) is different from false [2023-12-02 13:47:50,103 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2996 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_73| Int) (v_ArrVal_2982 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| Int) (v_ArrVal_2991 Int) (v_ArrVal_2995 Int) (v_ArrVal_2983 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2978)) (.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_73|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2978) |c_~#queue~0.base|)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_2979) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_2982) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2983)))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 v_ArrVal_2987)) |c_~#stored_elements~0.base| v_ArrVal_2988) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2987) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse1))) v_ArrVal_2991) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| 1)) .cse1 v_ArrVal_2995)) |c_~#stored_elements~0.base| v_ArrVal_2996) |c_~#queue~0.base|) .cse3) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129|))))))) is different from false [2023-12-02 13:47:50,217 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2996 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_73| Int) (v_ArrVal_2982 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| Int) (v_ArrVal_2991 Int) (v_ArrVal_2995 Int) (v_ArrVal_2983 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2976))) (let ((.cse3 (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2978)) (.cse2 (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_73|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2978) |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse7 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2979) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129| 1))) |c_~#stored_elements~0.base| v_ArrVal_2982) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) v_ArrVal_2983)))) (let ((.cse4 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse6 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 v_ArrVal_2987)) |c_~#stored_elements~0.base| v_ArrVal_2988) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2987) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_129|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65| 1)) (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_2991) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_101| 1)) .cse1 v_ArrVal_2995)) |c_~#stored_elements~0.base| v_ArrVal_2996) |c_~#queue~0.base|) .cse5) 2147483647) (< (select .cse4 .cse5) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_65|))))))) is different from false [2023-12-02 13:47:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 13:47:50,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227220337] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:47:50,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [956329736] [2023-12-02 13:47:50,222 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:47:50,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:47:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 23] total 59 [2023-12-02 13:47:50,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533080205] [2023-12-02 13:47:50,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:47:50,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-12-02 13:47:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:47:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-12-02 13:47:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=2163, Unknown=93, NotChecked=770, Total=3660 [2023-12-02 13:47:50,224 INFO L87 Difference]: Start difference. First operand 2053 states and 5035 transitions. Second operand has 61 states, 60 states have (on average 3.5166666666666666) internal successors, (211), 60 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have 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:47:55,189 WARN L539 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:48:05,330 WARN L293 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 577 DAG size of output: 505 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:48:08,505 WARN L539 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:48:10,518 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:48:12,544 WARN L539 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:48:14,561 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:48:16,573 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:48:18,593 WARN L539 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:48:20,606 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:48:22,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:48:31,375 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:48:33,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:48:34,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:48:36,181 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:48:38,683 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:48:40,699 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:48:56,349 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:48:58,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 [0] [2023-12-02 13:49:01,069 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:49:03,080 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:49:05,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] [2023-12-02 13:49:07,107 WARN L539 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:49:09,120 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:49:11,144 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:49:13,682 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:49:14,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:49:16,947 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:49:18,960 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:49:20,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 [0] [2023-12-02 13:49:23,017 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:49:25,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 [0] [2023-12-02 13:49:35,984 WARN L539 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:49:37,996 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:49:40,004 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:49:42,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] [2023-12-02 13:49:44,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:49:46,807 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:50:06,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:50:08,476 WARN L539 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:50:10,668 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:50:12,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:50:14,788 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:50:16,796 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:50:18,810 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:50:20,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:50:22,232 WARN L539 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:50:24,378 WARN L539 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:50:25,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:50:27,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 [0] [2023-12-02 13:50:29,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 [0] [2023-12-02 13:50:32,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:50:43,871 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:50:45,886 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:50:48,566 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:50:52,444 WARN L539 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:50:55,225 WARN L539 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:51:08,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:51:21,633 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:51:23,768 WARN L539 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:51:25,782 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:51:27,911 WARN L539 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:51:30,044 WARN L539 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:51:32,485 WARN L539 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:51:34,525 WARN L539 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:51:36,540 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:51:38,554 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:51:40,568 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:51:42,586 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:51:44,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:51:59,905 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:52:02,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] [2023-12-02 13:52:04,072 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:52:23,261 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:52:26,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:52:37,780 WARN L539 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:52:49,175 WARN L539 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:52:51,259 WARN L539 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:52:53,317 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:52:55,391 WARN L539 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:52:57,473 WARN L539 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:52:59,542 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:53:01,713 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:53:03,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 [0, 1] [2023-12-02 13:53:05,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 [0, 1] [2023-12-02 13:53:15,630 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:53:17,657 WARN L539 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:53:19,733 WARN L539 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:53:32,558 WARN L539 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:53:33,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:53:35,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 [0, 1] [2023-12-02 13:53:54,597 WARN L539 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:53:56,890 WARN L539 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:53:58,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:54:00,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:54:10,652 WARN L539 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:54:12,666 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:54:15,851 WARN L539 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:54:18,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 [0, 1] [2023-12-02 13:54:20,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 [0] [2023-12-02 13:54:22,597 WARN L539 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:54:24,723 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:54:26,850 WARN L539 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:54:35,993 WARN L539 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:54:38,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 [0] [2023-12-02 13:54:40,448 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:54:42,508 WARN L539 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:54:44,657 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:54:47,313 WARN L539 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:54:49,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 [0, 1] [2023-12-02 13:55:10,134 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:55:12,141 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:55:15,027 WARN L539 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:55:17,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:55:20,069 WARN L539 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:55:23,444 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:55:25,483 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:55:53,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:55:55,324 WARN L539 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:55:57,506 WARN L539 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:55:59,635 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:56:01,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 [0, 1] [2023-12-02 13:56:03,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:56:08,313 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:56:24,467 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:56:26,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 [0] [2023-12-02 13:56:48,093 WARN L539 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:56:50,102 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:56:52,391 WARN L854 $PredicateComparison]: unable to prove that (and (< (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 80)) 2147483647) (forall ((v_ArrVal_2996 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2996) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 2147483647))) is different from false [2023-12-02 13:56:54,410 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:56:55,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:56:57,542 WARN L539 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:56:59,670 WARN L539 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:57:03,020 WARN L539 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:57:05,622 WARN L539 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:57:07,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:57:09,671 WARN L539 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:57:11,854 WARN L539 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:57:13,859 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:57:15,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 [0] [2023-12-02 13:57:18,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 [0] [2023-12-02 13:57:20,276 WARN L539 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:57:25,350 WARN L539 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:57:27,546 WARN L539 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:57:29,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:57:36,044 WARN L539 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]