./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4fc63b2a 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_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2 --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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 11:22:31,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 11:22:31,664 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-02 11:22:31,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 11:22:31,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 11:22:31,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 11:22:31,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 11:22:31,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 11:22:31,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 11:22:31,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 11:22:31,701 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 11:22:31,702 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 11:22:31,702 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 11:22:31,702 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 11:22:31,703 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 11:22:31,703 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 11:22:31,704 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 11:22:31,704 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 11:22:31,705 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 11:22:31,705 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 11:22:31,706 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 11:22:31,710 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 11:22:31,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 11:22:31,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 11:22:31,711 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 11:22:31,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 11:22:31,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 11:22:31,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 11:22:31,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 11:22:31,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 11:22:31,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 11:22:31,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 11:22:31,723 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-02 11:22:31,723 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 11:22:31,724 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 11:22:31,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 11:22:31,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 11:22:31,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 11:22:31,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 11:22:31,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 11:22:31,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:22:31,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 11:22:31,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 11:22:31,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 11:22:31,729 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 11:22:31,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 11:22:31,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 11:22:31,730 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 11:22:31,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 11:22:31,730 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_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/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_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2024-11-02 11:22:32,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 11:22:32,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 11:22:32,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 11:22:32,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 11:22:32,231 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 11:22:32,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/pthread/queue_ok.i Unable to find full path for "g++" [2024-11-02 11:22:34,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 11:22:35,158 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 11:22:35,158 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/sv-benchmarks/c/pthread/queue_ok.i [2024-11-02 11:22:35,175 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/data/e6766a3bd/14bf01b6402c49c882470d46fb979d90/FLAG4e67a5ddd [2024-11-02 11:22:35,191 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/data/e6766a3bd/14bf01b6402c49c882470d46fb979d90 [2024-11-02 11:22:35,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 11:22:35,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 11:22:35,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 11:22:35,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 11:22:35,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 11:22:35,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:22:35" (1/1) ... [2024-11-02 11:22:35,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f90a2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:35, skipping insertion in model container [2024-11-02 11:22:35,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:22:35" (1/1) ... [2024-11-02 11:22:35,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 11:22:35,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:22:35,974 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 11:22:36,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:22:36,121 INFO L204 MainTranslator]: Completed translation [2024-11-02 11:22:36,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36 WrapperNode [2024-11-02 11:22:36,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 11:22:36,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 11:22:36,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 11:22:36,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 11:22:36,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,241 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 253 [2024-11-02 11:22:36,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 11:22:36,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 11:22:36,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 11:22:36,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 11:22:36,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 11:22:36,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 11:22:36,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 11:22:36,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 11:22:36,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (1/1) ... [2024-11-02 11:22:36,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:22:36,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:22:36,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 11:22:36,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 11:22:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-02 11:22:36,469 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-02 11:22:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-02 11:22:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-02 11:22:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-02 11:22:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-02 11:22:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-02 11:22:36,473 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-02 11:22:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 11:22:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 11:22:36,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 11:22:36,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 11:22:36,476 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-02 11:22:36,700 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 11:22:36,703 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 11:22:37,260 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-02 11:22:37,260 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 11:22:37,953 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 11:22:37,955 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-02 11:22:37,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:22:37 BoogieIcfgContainer [2024-11-02 11:22:37,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 11:22:37,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 11:22:37,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 11:22:37,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 11:22:37,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:22:35" (1/3) ... [2024-11-02 11:22:37,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f4f854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:22:37, skipping insertion in model container [2024-11-02 11:22:37,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:22:36" (2/3) ... [2024-11-02 11:22:37,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f4f854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:22:37, skipping insertion in model container [2024-11-02 11:22:37,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:22:37" (3/3) ... [2024-11-02 11:22:37,968 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-11-02 11:22:37,998 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 11:22:37,998 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-02 11:22:37,999 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-02 11:22:38,151 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-02 11:22:38,192 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 61 transitions, 136 flow [2024-11-02 11:22:38,325 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1105 states, 1057 states have (on average 2.7899716177861875) internal successors, (2949), 1104 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:38,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 11:22:38,388 INFO L333 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, 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;@195267bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 11:22:38,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-02 11:22:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 1105 states, 1057 states have (on average 2.7899716177861875) internal successors, (2949), 1104 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 11:22:38,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:22:38,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:22:38,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:22:38,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:22:38,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2091656933, now seen corresponding path program 1 times [2024-11-02 11:22:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:22:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227155575] [2024-11-02 11:22:38,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:38,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:22:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:39,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:22:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227155575] [2024-11-02 11:22:39,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227155575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:22:39,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:22:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:22:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989661037] [2024-11-02 11:22:39,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:22:39,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:22:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:22:39,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:22:39,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:22:39,874 INFO L87 Difference]: Start difference. First operand has 1105 states, 1057 states have (on average 2.7899716177861875) internal successors, (2949), 1104 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:22:40,284 INFO L93 Difference]: Finished difference Result 1622 states and 4351 transitions. [2024-11-02 11:22:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:22:40,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-02 11:22:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:22:40,324 INFO L225 Difference]: With dead ends: 1622 [2024-11-02 11:22:40,324 INFO L226 Difference]: Without dead ends: 1522 [2024-11-02 11:22:40,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:22:40,336 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 76 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:22:40,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 87 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:22:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2024-11-02 11:22:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1355. [2024-11-02 11:22:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1307 states have (on average 2.7918898240244836) internal successors, (3649), 1354 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 3649 transitions. [2024-11-02 11:22:40,526 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 3649 transitions. Word has length 8 [2024-11-02 11:22:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:22:40,526 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 3649 transitions. [2024-11-02 11:22:40,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 3649 transitions. [2024-11-02 11:22:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-02 11:22:40,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:22:40,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:22:40,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 11:22:40,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:22:40,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:22:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash 995765135, now seen corresponding path program 1 times [2024-11-02 11:22:40,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:22:40,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587483042] [2024-11-02 11:22:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:22:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:40,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:22:40,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587483042] [2024-11-02 11:22:40,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587483042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:22:40,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:22:40,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:22:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548470672] [2024-11-02 11:22:40,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:22:40,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:22:40,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:22:40,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:22:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:22:40,709 INFO L87 Difference]: Start difference. First operand 1355 states and 3649 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) [2024-11-02 11:22:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:22:40,994 INFO L93 Difference]: Finished difference Result 1640 states and 4280 transitions. [2024-11-02 11:22:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:22:40,996 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 [2024-11-02 11:22:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:22:41,002 INFO L225 Difference]: With dead ends: 1640 [2024-11-02 11:22:41,002 INFO L226 Difference]: Without dead ends: 507 [2024-11-02 11:22:41,010 INFO L431 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 [2024-11-02 11:22:41,011 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:22:41,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:22:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-02 11:22:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2024-11-02 11:22:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 495 states have (on average 2.4060606060606062) internal successors, (1191), 506 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1191 transitions. [2024-11-02 11:22:41,038 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1191 transitions. Word has length 11 [2024-11-02 11:22:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:22:41,038 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 1191 transitions. [2024-11-02 11:22:41,038 INFO L472 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) [2024-11-02 11:22:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1191 transitions. [2024-11-02 11:22:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-02 11:22:41,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:22:41,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:22:41,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 11:22:41,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:22:41,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:22:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1166859742, now seen corresponding path program 1 times [2024-11-02 11:22:41,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:22:41,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358897461] [2024-11-02 11:22:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:22:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:41,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:22:41,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358897461] [2024-11-02 11:22:41,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358897461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:22:41,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:22:41,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 11:22:41,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748268592] [2024-11-02 11:22:41,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:22:41,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:22:41,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:22:41,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:22:41,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:22:41,613 INFO L87 Difference]: Start difference. First operand 507 states and 1191 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:22:41,905 INFO L93 Difference]: Finished difference Result 698 states and 1634 transitions. [2024-11-02 11:22:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 11:22:41,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-02 11:22:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:22:41,911 INFO L225 Difference]: With dead ends: 698 [2024-11-02 11:22:41,912 INFO L226 Difference]: Without dead ends: 666 [2024-11-02 11:22:41,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-02 11:22:41,914 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:22:41,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 90 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:22:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-02 11:22:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 555. [2024-11-02 11:22:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 543 states have (on average 2.427255985267035) internal successors, (1318), 554 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1318 transitions. [2024-11-02 11:22:41,941 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1318 transitions. Word has length 11 [2024-11-02 11:22:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:22:41,941 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 1318 transitions. [2024-11-02 11:22:41,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1318 transitions. [2024-11-02 11:22:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 11:22:41,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:22:41,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:22:41,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 11:22:41,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:22:41,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:22:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1812915339, now seen corresponding path program 1 times [2024-11-02 11:22:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:22:41,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305956727] [2024-11-02 11:22:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:41,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:22:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:42,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:22:42,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305956727] [2024-11-02 11:22:42,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305956727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:22:42,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:22:42,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 11:22:42,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172145293] [2024-11-02 11:22:42,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:22:42,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:22:42,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:22:42,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:22:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:22:42,025 INFO L87 Difference]: Start difference. First operand 555 states and 1318 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:22:42,190 INFO L93 Difference]: Finished difference Result 788 states and 1842 transitions. [2024-11-02 11:22:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:22:42,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-02 11:22:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:22:42,195 INFO L225 Difference]: With dead ends: 788 [2024-11-02 11:22:42,196 INFO L226 Difference]: Without dead ends: 603 [2024-11-02 11:22:42,197 INFO L431 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 [2024-11-02 11:22:42,198 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:22:42,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 68 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:22:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-02 11:22:42,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2024-11-02 11:22:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 591 states have (on average 2.401015228426396) internal successors, (1419), 602 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1419 transitions. [2024-11-02 11:22:42,222 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1419 transitions. Word has length 12 [2024-11-02 11:22:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:22:42,222 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 1419 transitions. [2024-11-02 11:22:42,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1419 transitions. [2024-11-02 11:22:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 11:22:42,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:22:42,224 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:22:42,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 11:22:42,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:22:42,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:22:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash -652173596, now seen corresponding path program 1 times [2024-11-02 11:22:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:22:42,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496838327] [2024-11-02 11:22:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:22:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:42,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:22:42,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496838327] [2024-11-02 11:22:42,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496838327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:22:42,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:22:42,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:22:42,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888098164] [2024-11-02 11:22:42,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:22:42,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:22:42,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:22:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:22:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:22:42,711 INFO L87 Difference]: Start difference. First operand 603 states and 1419 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:22:42,905 INFO L93 Difference]: Finished difference Result 1044 states and 2450 transitions. [2024-11-02 11:22:42,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:22:42,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-02 11:22:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:22:42,910 INFO L225 Difference]: With dead ends: 1044 [2024-11-02 11:22:42,910 INFO L226 Difference]: Without dead ends: 603 [2024-11-02 11:22:42,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:22:42,913 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:22:42,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 74 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:22:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-02 11:22:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2024-11-02 11:22:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 591 states have (on average 2.3739424703891707) internal successors, (1403), 602 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1403 transitions. [2024-11-02 11:22:42,940 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1403 transitions. Word has length 15 [2024-11-02 11:22:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:22:42,941 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 1403 transitions. [2024-11-02 11:22:42,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1403 transitions. [2024-11-02 11:22:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-02 11:22:42,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:22:42,942 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:22:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 11:22:42,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:22:42,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:22:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1928735010, now seen corresponding path program 1 times [2024-11-02 11:22:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:22:42,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757316528] [2024-11-02 11:22:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:22:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:43,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:22:43,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757316528] [2024-11-02 11:22:43,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757316528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:22:43,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206178153] [2024-11-02 11:22:43,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:43,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:22:43,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:22:43,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:22:43,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 11:22:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:43,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-02 11:22:43,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:22:44,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-11-02 11:22:44,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 11:22:44,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:44,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:44,269 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-02 11:22:44,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-02 11:22:44,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:44,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:44,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 11:22:44,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-11-02 11:22:44,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:22:44,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 28 [2024-11-02 11:22:44,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:44,562 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 27 treesize of output 20 [2024-11-02 11:22:44,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2024-11-02 11:22:44,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:22:44,645 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 43 treesize of output 23 [2024-11-02 11:22:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:44,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:22:44,888 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_7| Int) (v_ArrVal_107 (Array Int Int)) (v_ArrVal_106 Int)) (or (< 0 (+ 2147483650 (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_106)) |c_~#stored_elements~0.base| v_ArrVal_107) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_7|)) (+ 88 |c_~#queue~0.offset|)))) (< (+ |v_t1Thread1of1ForFork1_enqueue_~x#1_7| 2147483648) 0))) is different from false [2024-11-02 11:22:44,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_7| Int) (v_ArrVal_107 (Array Int Int)) (v_ArrVal_106 Int)) (or (< v_ArrVal_104 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) (< (+ |v_t1Thread1of1ForFork1_enqueue_~x#1_7| 2147483648) 0) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_104) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_106)) |c_~#stored_elements~0.base| v_ArrVal_107) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_7|)) (+ 88 |c_~#queue~0.offset|)))))) is different from false [2024-11-02 11:22:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-02 11:22:45,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206178153] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 11:22:45,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [249700447] [2024-11-02 11:22:45,246 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-02 11:22:45,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 11:22:45,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2024-11-02 11:22:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121519736] [2024-11-02 11:22:45,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 11:22:45,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-02 11:22:45,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:22:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-02 11:22:45,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=200, Unknown=5, NotChecked=62, Total=342 [2024-11-02 11:22:45,252 INFO L87 Difference]: Start difference. First operand 603 states and 1403 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:45,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_7| Int) (v_ArrVal_107 (Array Int Int))) (or (< 0 (+ 2147483650 (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_107) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_7|)) .cse2))) (< (+ |v_t1Thread1of1ForFork1_enqueue_~x#1_7| 2147483648) 0))) (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_7| Int)) (or (< (+ |v_t1Thread1of1ForFork1_enqueue_~x#1_7| 2147483648) 0) (< 0 (+ (select (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_7|)) .cse2) 2147483650)))) (<= 0 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 2147483648)))) is different from false [2024-11-02 11:22:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:22:45,967 INFO L93 Difference]: Finished difference Result 778 states and 1819 transitions. [2024-11-02 11:22:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 11:22:45,968 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-02 11:22:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:22:45,973 INFO L225 Difference]: With dead ends: 778 [2024-11-02 11:22:45,973 INFO L226 Difference]: Without dead ends: 762 [2024-11-02 11:22:45,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=250, Unknown=6, NotChecked=108, Total=462 [2024-11-02 11:22:45,975 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 160 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 11:22:45,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 250 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 404 Invalid, 0 Unknown, 430 Unchecked, 0.5s Time] [2024-11-02 11:22:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-02 11:22:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 635. [2024-11-02 11:22:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 623 states have (on average 2.3868378812199036) internal successors, (1487), 634 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1487 transitions. [2024-11-02 11:22:46,003 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1487 transitions. Word has length 17 [2024-11-02 11:22:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:22:46,003 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 1487 transitions. [2024-11-02 11:22:46,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1487 transitions. [2024-11-02 11:22:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-02 11:22:46,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:22:46,005 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:22:46,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-02 11:22:46,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:22:46,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:22:46,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:22:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash -338756130, now seen corresponding path program 1 times [2024-11-02 11:22:46,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:22:46,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067639083] [2024-11-02 11:22:46,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:46,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:22:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:47,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:22:47,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067639083] [2024-11-02 11:22:47,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067639083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:22:47,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976957753] [2024-11-02 11:22:47,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:47,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:22:47,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:22:47,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:22:47,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 11:22:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:47,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-02 11:22:47,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:22:47,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-11-02 11:22:47,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 11:22:47,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:47,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:47,780 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-02 11:22:47,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-02 11:22:47,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:47,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:47,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:47,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 11:22:47,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-11-02 11:22:48,056 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2024-11-02 11:22:48,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:48,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-02 11:22:48,185 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 50 treesize of output 40 [2024-11-02 11:22:48,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:22:48,192 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 50 treesize of output 26 [2024-11-02 11:22:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:48,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:22:48,360 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int)) (v_ArrVal_150 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_11| Int)) (or (< (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_150)) |c_~#stored_elements~0.base| v_ArrVal_151) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_11|)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_150))) is different from false [2024-11-02 11:22:48,468 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_147 Int) (v_ArrVal_151 (Array Int Int)) (v_ArrVal_150 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_11| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1) v_ArrVal_147) (< (+ (select .cse0 .cse1) 1) v_ArrVal_150) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_147) .cse1 v_ArrVal_150)) |c_~#stored_elements~0.base| v_ArrVal_151) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_11|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2024-11-02 11:22:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-02 11:22:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976957753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 11:22:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [979342707] [2024-11-02 11:22:54,919 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-02 11:22:54,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 11:22:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2024-11-02 11:22:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530138258] [2024-11-02 11:22:54,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 11:22:54,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-02 11:22:54,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:22:54,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-02 11:22:54,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=261, Unknown=14, NotChecked=74, Total=462 [2024-11-02 11:22:54,932 INFO L87 Difference]: Start difference. First operand 635 states and 1487 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:57,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_11| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_151) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_11|)) .cse2) 2147483647)) (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_11| Int)) (< (select (store .cse3 .cse4 |v_t1Thread1of1ForFork1_enqueue_~x#1_11|) .cse2) 2147483647)) (forall ((v_ArrVal_151 (Array Int Int)) (v_ArrVal_150 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_11| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_150)) |c_~#stored_elements~0.base| v_ArrVal_151) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_11|)) .cse2) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_150)))) (forall ((v_ArrVal_147 Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_13| Int) (v_ArrVal_150 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_11| Int)) (let ((.cse9 (store .cse3 .cse4 |v_t1Thread1of1ForFork1_enqueue_~x#1_13|))) (or (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_147) .cse1 v_ArrVal_150)) |c_~#stored_elements~0.base| v_ArrVal_151) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_11|)) .cse2) 2147483647) (< (+ (select .cse9 .cse1) 1) v_ArrVal_150) (< (+ (select .cse9 .cse2) 1) v_ArrVal_147))))))) is different from false [2024-11-02 11:22:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:22:58,678 INFO L93 Difference]: Finished difference Result 1095 states and 2612 transitions. [2024-11-02 11:22:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-02 11:22:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-02 11:22:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:22:58,692 INFO L225 Difference]: With dead ends: 1095 [2024-11-02 11:22:58,692 INFO L226 Difference]: Without dead ends: 1079 [2024-11-02 11:22:58,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=161, Invalid=342, Unknown=15, NotChecked=132, Total=650 [2024-11-02 11:22:58,696 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 231 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 9 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 861 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-02 11:22:58,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 393 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 678 Invalid, 40 Unknown, 861 Unchecked, 1.4s Time] [2024-11-02 11:22:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-11-02 11:22:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 810. [2024-11-02 11:22:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 798 states have (on average 2.5225563909774436) internal successors, (2013), 809 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 2013 transitions. [2024-11-02 11:22:58,743 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 2013 transitions. Word has length 18 [2024-11-02 11:22:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:22:58,747 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 2013 transitions. [2024-11-02 11:22:58,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:22:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 2013 transitions. [2024-11-02 11:22:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-02 11:22:58,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:22:58,749 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:22:58,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-02 11:22:58,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:22:58,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:22:58,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:22:58,953 INFO L85 PathProgramCache]: Analyzing trace with hash -338757000, now seen corresponding path program 1 times [2024-11-02 11:22:58,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:22:58,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985823461] [2024-11-02 11:22:58,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:22:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:22:59,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:22:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985823461] [2024-11-02 11:22:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985823461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:22:59,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275515393] [2024-11-02 11:22:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:22:59,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:22:59,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:22:59,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:22:59,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-02 11:22:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:22:59,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-02 11:22:59,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:22:59,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-11-02 11:22:59,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 11:22:59,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:59,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:22:59,938 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-02 11:22:59,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-02 11:23:00,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:23:00,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:23:00,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:23:00,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 11:23:00,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-11-02 11:23:00,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:23:00,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 28 [2024-11-02 11:23:00,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:23:00,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-02 11:23:00,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2024-11-02 11:23:00,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:23:00,296 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 43 treesize of output 23 [2024-11-02 11:23:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:23:00,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:23:00,414 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_15| Int)) (or (< (+ |v_t1Thread1of1ForFork1_enqueue_~x#1_15| 2147483648) 0) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_195) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_15|)) (+ 88 |c_~#queue~0.offset|)))))) is different from false [2024-11-02 11:23:00,433 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_15| Int)) (or (< (+ |v_t1Thread1of1ForFork1_enqueue_~x#1_15| 2147483648) 0) (< 0 (+ 2147483650 (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_194)) |c_~#stored_elements~0.base| v_ArrVal_195) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_15|)) (+ 88 |c_~#queue~0.offset|)))))) is different from false [2024-11-02 11:23:00,488 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int)) (v_ArrVal_194 Int) (v_ArrVal_192 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_15| Int)) (or (< (+ |v_t1Thread1of1ForFork1_enqueue_~x#1_15| 2147483648) 0) (< v_ArrVal_192 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) (< 0 (+ (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_192) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_194)) |c_~#stored_elements~0.base| v_ArrVal_195) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_15|)) (+ 88 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2024-11-02 11:23:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-02 11:23:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275515393] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 11:23:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1048090883] [2024-11-02 11:23:00,695 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-02 11:23:00,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 11:23:00,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2024-11-02 11:23:00,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241175197] [2024-11-02 11:23:00,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 11:23:00,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-02 11:23:00,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:23:00,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-02 11:23:00,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=181, Unknown=3, NotChecked=90, Total=342 [2024-11-02 11:23:00,699 INFO L87 Difference]: Start difference. First operand 810 states and 2013 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:23:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:23:01,431 INFO L93 Difference]: Finished difference Result 936 states and 2275 transitions. [2024-11-02 11:23:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 11:23:01,432 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-02 11:23:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:23:01,438 INFO L225 Difference]: With dead ends: 936 [2024-11-02 11:23:01,438 INFO L226 Difference]: Without dead ends: 921 [2024-11-02 11:23:01,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=257, Unknown=3, NotChecked=108, Total=462 [2024-11-02 11:23:01,440 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 194 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 11:23:01,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 218 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 319 Invalid, 0 Unknown, 404 Unchecked, 0.5s Time] [2024-11-02 11:23:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-02 11:23:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 795. [2024-11-02 11:23:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 783 states have (on average 2.5070242656449553) internal successors, (1963), 794 states have internal predecessors, (1963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:23:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1963 transitions. [2024-11-02 11:23:01,475 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1963 transitions. Word has length 18 [2024-11-02 11:23:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:23:01,475 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1963 transitions. [2024-11-02 11:23:01,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:23:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1963 transitions. [2024-11-02 11:23:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-02 11:23:01,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:23:01,477 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:23:01,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-02 11:23:01,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:23:01,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:23:01,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:23:01,683 INFO L85 PathProgramCache]: Analyzing trace with hash 872896129, now seen corresponding path program 1 times [2024-11-02 11:23:01,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:23:01,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760053993] [2024-11-02 11:23:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:23:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:23:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:23:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:23:03,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:23:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760053993] [2024-11-02 11:23:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760053993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:23:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246213202] [2024-11-02 11:23:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:23:03,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:23:03,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:23:03,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:23:03,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-02 11:23:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:23:03,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-02 11:23:03,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:23:03,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-11-02 11:23:03,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 11:23:03,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:23:03,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:23:03,566 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-02 11:23:03,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-02 11:23:03,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:23:03,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:23:03,663 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 11:23:03,664 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-02 11:23:03,855 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 38 treesize of output 16 [2024-11-02 11:23:03,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:23:03,909 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 38 treesize of output 29 [2024-11-02 11:23:04,003 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-02 11:23:04,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 52 [2024-11-02 11:23:04,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:23:04,059 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 1 case distinctions, treesize of input 49 treesize of output 30 [2024-11-02 11:23:04,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:23:04,075 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 39 treesize of output 15 [2024-11-02 11:23:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:23:04,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:23:04,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_19| Int) (v_ArrVal_243 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_243) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_19|)) .cse1))))) is different from false [2024-11-02 11:23:04,206 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_19| Int) (v_ArrVal_243 (Array Int Int))) (< 0 (+ (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|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_243) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_19|)) .cse1)) 2147483650))) is different from false [2024-11-02 11:23:04,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_19| Int) (v_ArrVal_243 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| 2147483649) 0) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37|) (< 0 (+ 2147483650 (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_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| 1))) |c_~#stored_elements~0.base| v_ArrVal_243) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_19|)) .cse3))))))) is different from false [2024-11-02 11:23:04,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_19| Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| 2147483649) 0) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37|) (< 0 (+ 2147483650 (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_240) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| 1))) |c_~#stored_elements~0.base| v_ArrVal_243) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_19|)) .cse3))))))) is different from false [2024-11-02 11:23:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-02 11:23:04,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246213202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 11:23:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [95520103] [2024-11-02 11:23:04,559 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-02 11:23:04,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 11:23:04,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2024-11-02 11:23:04,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504696353] [2024-11-02 11:23:04,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 11:23:04,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-02 11:23:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:23:04,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-02 11:23:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=400, Unknown=4, NotChecked=180, Total=702 [2024-11-02 11:23:04,562 INFO L87 Difference]: Start difference. First operand 795 states and 1963 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:23:05,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|))) (and (< 0 (+ 2147483650 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_21| Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int))) (let ((.cse2 (store .cse3 .cse4 |v_t1Thread1of1ForFork1_enqueue_~x#1_21|))) (or (< (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| 2147483649) 0) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) v_ArrVal_240) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37| 1))) |c_~#stored_elements~0.base| v_ArrVal_243) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_19|)) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_37|)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_19| Int)) (< 0 (+ (select (store .cse3 .cse4 |v_t1Thread1of1ForFork1_enqueue_~x#1_19|) .cse1) 2147483650))) (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_19| Int) (v_ArrVal_243 (Array Int Int))) (< 0 (+ 2147483650 (select (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_243) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_19|)) .cse1))))))) is different from false [2024-11-02 11:23:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:23:06,381 INFO L93 Difference]: Finished difference Result 1849 states and 4603 transitions. [2024-11-02 11:23:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-02 11:23:06,382 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-02 11:23:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:23:06,393 INFO L225 Difference]: With dead ends: 1849 [2024-11-02 11:23:06,393 INFO L226 Difference]: Without dead ends: 1817 [2024-11-02 11:23:06,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=945, Unknown=5, NotChecked=350, Total=1560 [2024-11-02 11:23:06,395 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 524 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1598 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:23:06,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 466 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 848 Invalid, 0 Unknown, 1598 Unchecked, 1.1s Time] [2024-11-02 11:23:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2024-11-02 11:23:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1232. [2024-11-02 11:23:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1220 states have (on average 2.642622950819672) internal successors, (3224), 1231 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:23:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 3224 transitions. [2024-11-02 11:23:06,462 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 3224 transitions. Word has length 20 [2024-11-02 11:23:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:23:06,462 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 3224 transitions. [2024-11-02 11:23:06,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:23:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 3224 transitions. [2024-11-02 11:23:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-02 11:23:06,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:23:06,463 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:23:06,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-02 11:23:06,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:23:06,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-02 11:23:06,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:23:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1289977928, now seen corresponding path program 1 times [2024-11-02 11:23:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:23:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931061538] [2024-11-02 11:23:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:23:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:23:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:23:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:23:06,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:23:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931061538] [2024-11-02 11:23:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931061538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:23:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701769057] [2024-11-02 11:23:06,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:23:06,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:23:06,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:23:06,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:23:06,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5d81854-9e8f-450b-923d-828302d76eeb/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-02 11:23:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:23:06,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 11:23:06,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:23:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:23:06,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 11:23:06,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701769057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:23:06,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 11:23:06,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-02 11:23:06,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98214690] [2024-11-02 11:23:06,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:23:06,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:23:06,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:23:06,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:23:06,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:23:06,973 INFO L87 Difference]: Start difference. First operand 1232 states and 3224 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)