./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_15x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_15x0-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:57:45,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:57:45,179 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 02:57:45,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:57:45,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:57:45,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:57:45,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:57:45,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:57:45,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:57:45,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:57:45,246 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:57:45,246 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:57:45,246 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:57:45,246 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:57:45,246 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:57:45,246 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:57:45,246 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:57:45,246 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:57:45,247 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:57:45,247 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:57:45,247 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:57:45,247 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:57:45,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:57:45,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 02:57:45,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:57:45,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:57:45,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:57:45,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:57:45,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 02:57:45,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:57:45,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 02:57:45,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:57:45,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:57:45,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 02:57:45,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:57:45,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:57:45,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:57:45,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:57:45,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:57:45,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:57:45,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:57:45,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 02:57:45,253 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:57:45,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:57:45,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:57:45,254 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:57:45,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:57:45,254 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c [2024-11-14 02:57:45,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:57:45,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:57:45,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:57:45,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:57:45,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:57:45,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/recursive-simple/sum_15x0-2.c Unable to find full path for "g++" [2024-11-14 02:57:47,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:57:47,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:57:48,012 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-11-14 02:57:48,021 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/data/35e2511c4/83df4c293ec745e68b1063f9b97d8edf/FLAGe30775b4a [2024-11-14 02:57:48,039 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/data/35e2511c4/83df4c293ec745e68b1063f9b97d8edf [2024-11-14 02:57:48,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:57:48,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:57:48,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:57:48,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:57:48,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:57:48,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6da7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48, skipping insertion in model container [2024-11-14 02:57:48,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:57:48,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-11-14 02:57:48,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:57:48,303 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:57:48,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-11-14 02:57:48,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:57:48,338 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:57:48,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48 WrapperNode [2024-11-14 02:57:48,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:57:48,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:57:48,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:57:48,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:57:48,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,374 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-14 02:57:48,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:57:48,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:57:48,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:57:48,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:57:48,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:57:48,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:57:48,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:57:48,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:57:48,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (1/1) ... [2024-11-14 02:57:48,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:57:48,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:57:48,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:57:48,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:57:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:57:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:57:48,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:57:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-14 02:57:48,466 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-14 02:57:48,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 02:57:48,545 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:57:48,548 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:57:48,664 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-14 02:57:48,665 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:57:48,688 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:57:48,689 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 02:57:48,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:57:48 BoogieIcfgContainer [2024-11-14 02:57:48,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:57:48,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:57:48,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:57:48,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:57:48,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:57:48" (1/3) ... [2024-11-14 02:57:48,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eebbbc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:57:48, skipping insertion in model container [2024-11-14 02:57:48,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:57:48" (2/3) ... [2024-11-14 02:57:48,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eebbbc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:57:48, skipping insertion in model container [2024-11-14 02:57:48,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:57:48" (3/3) ... [2024-11-14 02:57:48,702 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2024-11-14 02:57:48,720 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:57:48,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sum_15x0-2.c that has 2 procedures, 14 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-14 02:57:48,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:57:48,825 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;@63f40cdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:57:48,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 02:57:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 02:57:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 02:57:48,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:57:48,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:57:48,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:57:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:57:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2024-11-14 02:57:48,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:57:48,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310504076] [2024-11-14 02:57:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:57:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:49,146 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-14 02:57:49,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:57:49,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310504076] [2024-11-14 02:57:49,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310504076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:57:49,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:57:49,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:57:49,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282407071] [2024-11-14 02:57:49,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:57:49,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:57:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:57:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:57:49,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:57:49,181 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 02:57:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:57:49,319 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-11-14 02:57:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:57:49,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-11-14 02:57:49,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:57:49,330 INFO L225 Difference]: With dead ends: 22 [2024-11-14 02:57:49,331 INFO L226 Difference]: Without dead ends: 14 [2024-11-14 02:57:49,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:57:49,338 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:57:49,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:57:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-14 02:57:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-14 02:57:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 02:57:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-14 02:57:49,378 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2024-11-14 02:57:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:57:49,378 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-14 02:57:49,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 02:57:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-14 02:57:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 02:57:49,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:57:49,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:57:49,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 02:57:49,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:57:49,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:57:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2024-11-14 02:57:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:57:49,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366224191] [2024-11-14 02:57:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:57:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 02:57:49,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:57:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366224191] [2024-11-14 02:57:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366224191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:57:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371429960] [2024-11-14 02:57:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:49,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:57:49,559 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:57:49,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 02:57:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:49,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 02:57:49,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:57:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 02:57:49,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:57:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:57:50,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371429960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:57:50,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1085138506] [2024-11-14 02:57:50,108 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:57:50,109 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:57:50,114 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:57:50,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:57:50,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2024-11-14 02:57:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823074248] [2024-11-14 02:57:50,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:57:50,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 02:57:50,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:57:50,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 02:57:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:57:50,121 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 02:57:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:57:50,197 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-14 02:57:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 02:57:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2024-11-14 02:57:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:57:50,198 INFO L225 Difference]: With dead ends: 21 [2024-11-14 02:57:50,198 INFO L226 Difference]: Without dead ends: 17 [2024-11-14 02:57:50,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-14 02:57:50,200 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:57:50,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:57:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-14 02:57:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-14 02:57:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 02:57:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-14 02:57:50,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2024-11-14 02:57:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:57:50,207 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-14 02:57:50,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 02:57:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-14 02:57:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 02:57:50,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:57:50,208 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:57:50,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 02:57:50,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:50,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:57:50,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:57:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2024-11-14 02:57:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:57:50,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612137797] [2024-11-14 02:57:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:57:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 02:57:50,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:57:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612137797] [2024-11-14 02:57:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612137797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:57:50,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718900747] [2024-11-14 02:57:50,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:57:50,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:50,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:57:50,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:57:50,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 02:57:50,710 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 02:57:50,710 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:57:50,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 02:57:50,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:57:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 02:57:50,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:57:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 02:57:51,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718900747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:57:51,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1340431080] [2024-11-14 02:57:51,244 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:57:51,244 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:57:51,245 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:57:51,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:57:51,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2024-11-14 02:57:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078246937] [2024-11-14 02:57:51,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:57:51,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 02:57:51,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:57:51,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 02:57:51,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:57:51,249 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 02:57:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:57:51,329 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-11-14 02:57:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:57:51,330 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 21 [2024-11-14 02:57:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:57:51,331 INFO L225 Difference]: With dead ends: 24 [2024-11-14 02:57:51,331 INFO L226 Difference]: Without dead ends: 20 [2024-11-14 02:57:51,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-14 02:57:51,332 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:57:51,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:57:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-14 02:57:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-14 02:57:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 02:57:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-11-14 02:57:51,338 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2024-11-14 02:57:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:57:51,339 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-14 02:57:51,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 02:57:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-11-14 02:57:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 02:57:51,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:57:51,340 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:57:51,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 02:57:51,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:51,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:57:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:57:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2024-11-14 02:57:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:57:51,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313022356] [2024-11-14 02:57:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:57:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 02:57:51,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:57:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313022356] [2024-11-14 02:57:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313022356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:57:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871666453] [2024-11-14 02:57:51,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 02:57:51,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:57:51,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:57:51,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 02:57:51,923 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 02:57:51,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:57:51,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 02:57:51,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:57:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 02:57:51,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:57:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 02:57:52,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871666453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:57:52,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1395072197] [2024-11-14 02:57:52,835 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:57:52,835 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:57:52,835 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:57:52,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:57:52,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2024-11-14 02:57:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129953950] [2024-11-14 02:57:52,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:57:52,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 02:57:52,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:57:52,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 02:57:52,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-14 02:57:52,842 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-14 02:57:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:57:52,948 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-14 02:57:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 02:57:52,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 27 [2024-11-14 02:57:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:57:52,950 INFO L225 Difference]: With dead ends: 27 [2024-11-14 02:57:52,950 INFO L226 Difference]: Without dead ends: 23 [2024-11-14 02:57:52,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-14 02:57:52,951 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:57:52,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:57:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-14 02:57:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-14 02:57:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 02:57:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-14 02:57:52,958 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2024-11-14 02:57:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:57:52,958 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-14 02:57:52,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-14 02:57:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-14 02:57:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 02:57:52,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:57:52,959 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:57:52,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 02:57:53,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:53,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:57:53,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:57:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2024-11-14 02:57:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:57:53,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297004374] [2024-11-14 02:57:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:57:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 02:57:53,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:57:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297004374] [2024-11-14 02:57:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297004374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:57:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064547902] [2024-11-14 02:57:53,367 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 02:57:53,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:53,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:57:53,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:57:53,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 02:57:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:53,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 02:57:53,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:57:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 02:57:53,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:57:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 02:57:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064547902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:57:54,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [8842732] [2024-11-14 02:57:54,677 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:57:54,678 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:57:54,678 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:57:54,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:57:54,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2024-11-14 02:57:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637057090] [2024-11-14 02:57:54,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:57:54,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 02:57:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:57:54,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 02:57:54,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-14 02:57:54,684 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-14 02:57:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:57:54,812 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-11-14 02:57:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 02:57:54,813 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 33 [2024-11-14 02:57:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:57:54,814 INFO L225 Difference]: With dead ends: 30 [2024-11-14 02:57:54,814 INFO L226 Difference]: Without dead ends: 26 [2024-11-14 02:57:54,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2024-11-14 02:57:54,815 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:57:54,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 41 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:57:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-14 02:57:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-14 02:57:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 02:57:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-14 02:57:54,829 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2024-11-14 02:57:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:57:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-14 02:57:54,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-14 02:57:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-11-14 02:57:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:57:54,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:57:54,832 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:57:54,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 02:57:55,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:55,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:57:55,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:57:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2024-11-14 02:57:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:57:55,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974048662] [2024-11-14 02:57:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:57:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 02:57:55,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:57:55,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974048662] [2024-11-14 02:57:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974048662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:57:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598386956] [2024-11-14 02:57:55,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:57:55,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:55,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:57:55,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:57:55,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 02:57:55,444 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 02:57:55,444 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:57:55,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 02:57:55,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:57:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 02:57:55,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:57:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 02:57:56,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598386956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:57:56,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1450672865] [2024-11-14 02:57:57,000 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:57:57,001 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:57:57,001 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:57:57,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:57:57,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2024-11-14 02:57:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19664423] [2024-11-14 02:57:57,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:57:57,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 02:57:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:57:57,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 02:57:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-14 02:57:57,004 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-14 02:57:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:57:57,131 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-14 02:57:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 02:57:57,132 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) Word has length 39 [2024-11-14 02:57:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:57:57,134 INFO L225 Difference]: With dead ends: 33 [2024-11-14 02:57:57,134 INFO L226 Difference]: Without dead ends: 29 [2024-11-14 02:57:57,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2024-11-14 02:57:57,136 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:57:57,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 43 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:57:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-14 02:57:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-14 02:57:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 02:57:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-14 02:57:57,144 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2024-11-14 02:57:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:57:57,144 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-14 02:57:57,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-14 02:57:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-14 02:57:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 02:57:57,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:57:57,146 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:57:57,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 02:57:57,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:57,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:57:57,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:57:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2024-11-14 02:57:57,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:57:57,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895894445] [2024-11-14 02:57:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:57,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:57:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-14 02:57:57,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:57:57,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895894445] [2024-11-14 02:57:57,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895894445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:57:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603386435] [2024-11-14 02:57:57,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 02:57:57,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:57,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:57:57,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:57:57,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 02:57:57,687 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 02:57:57,688 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:57:57,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 02:57:57,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:57:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-14 02:57:57,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:57:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 02:57:59,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603386435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:57:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [215260309] [2024-11-14 02:57:59,793 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:57:59,793 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:57:59,793 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:57:59,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:57:59,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2024-11-14 02:57:59,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139147626] [2024-11-14 02:57:59,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:57:59,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 02:57:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:57:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 02:57:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-14 02:57:59,797 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-14 02:57:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:57:59,972 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-14 02:57:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 02:57:59,973 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 45 [2024-11-14 02:57:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:57:59,974 INFO L225 Difference]: With dead ends: 36 [2024-11-14 02:57:59,974 INFO L226 Difference]: Without dead ends: 32 [2024-11-14 02:57:59,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2024-11-14 02:57:59,976 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:57:59,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 51 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:57:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-14 02:57:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-14 02:57:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-14 02:57:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-14 02:57:59,986 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2024-11-14 02:57:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:57:59,986 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-14 02:57:59,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-14 02:57:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-14 02:57:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 02:57:59,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:57:59,988 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:00,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 02:58:00,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:00,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:00,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2024-11-14 02:58:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92355614] [2024-11-14 02:58:00,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-14 02:58:00,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:00,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92355614] [2024-11-14 02:58:00,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92355614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:00,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357068570] [2024-11-14 02:58:00,480 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 02:58:00,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:00,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:00,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:00,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 02:58:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:00,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 02:58:00,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-14 02:58:00,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-14 02:58:03,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357068570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:03,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1894931517] [2024-11-14 02:58:03,471 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:58:03,471 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:03,472 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:58:03,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2024-11-14 02:58:03,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128461274] [2024-11-14 02:58:03,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:03,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 02:58:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:03,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 02:58:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-11-14 02:58:03,476 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-14 02:58:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:03,622 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-14 02:58:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 02:58:03,623 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) Word has length 51 [2024-11-14 02:58:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:03,625 INFO L225 Difference]: With dead ends: 39 [2024-11-14 02:58:03,625 INFO L226 Difference]: Without dead ends: 35 [2024-11-14 02:58:03,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2024-11-14 02:58:03,627 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:03,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 55 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:58:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-14 02:58:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-14 02:58:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-14 02:58:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-14 02:58:03,635 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2024-11-14 02:58:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:03,635 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-14 02:58:03,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-14 02:58:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-14 02:58:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-14 02:58:03,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:03,637 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:03,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 02:58:03,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:03,837 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:03,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2024-11-14 02:58:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:03,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173205191] [2024-11-14 02:58:03,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-14 02:58:04,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173205191] [2024-11-14 02:58:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173205191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079912697] [2024-11-14 02:58:04,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:58:04,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:04,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:04,163 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:04,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 02:58:04,345 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-14 02:58:04,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:58:04,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 02:58:04,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-14 02:58:04,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-14 02:58:08,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079912697] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:08,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1634845302] [2024-11-14 02:58:08,048 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:58:08,048 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:08,048 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:58:08,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:08,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2024-11-14 02:58:08,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133323326] [2024-11-14 02:58:08,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:08,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 02:58:08,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:08,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 02:58:08,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-14 02:58:08,051 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 23 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-14 02:58:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:08,231 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-14 02:58:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 02:58:08,232 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) Word has length 57 [2024-11-14 02:58:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:08,233 INFO L225 Difference]: With dead ends: 42 [2024-11-14 02:58:08,233 INFO L226 Difference]: Without dead ends: 38 [2024-11-14 02:58:08,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=636, Unknown=0, NotChecked=0, Total=930 [2024-11-14 02:58:08,234 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 85 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:08,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 59 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:58:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-14 02:58:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-14 02:58:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-14 02:58:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-14 02:58:08,241 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2024-11-14 02:58:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:08,241 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-14 02:58:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-14 02:58:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-14 02:58:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 02:58:08,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:08,243 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:08,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 02:58:08,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:08,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:08,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2024-11-14 02:58:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:08,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283957954] [2024-11-14 02:58:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:08,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-14 02:58:08,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283957954] [2024-11-14 02:58:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283957954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17474237] [2024-11-14 02:58:08,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 02:58:08,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:08,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:08,770 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:08,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 02:58:08,978 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 02:58:08,978 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:58:08,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 02:58:08,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-14 02:58:09,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-14 02:58:14,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17474237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:14,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [862902928] [2024-11-14 02:58:14,032 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:58:14,032 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:14,032 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:58:14,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:14,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2024-11-14 02:58:14,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536872597] [2024-11-14 02:58:14,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:14,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 02:58:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 02:58:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2024-11-14 02:58:14,036 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-14 02:58:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:14,309 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-14 02:58:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 02:58:14,310 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) Word has length 63 [2024-11-14 02:58:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:14,311 INFO L225 Difference]: With dead ends: 45 [2024-11-14 02:58:14,311 INFO L226 Difference]: Without dead ends: 41 [2024-11-14 02:58:14,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 114 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 02:58:14,312 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 114 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:14,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 59 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:58:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-14 02:58:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-14 02:58:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 02:58:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-14 02:58:14,319 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2024-11-14 02:58:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:14,319 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-14 02:58:14,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-14 02:58:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-14 02:58:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-14 02:58:14,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:14,320 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:14,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-14 02:58:14,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 02:58:14,524 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:14,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2024-11-14 02:58:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923207507] [2024-11-14 02:58:14,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:14,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-14 02:58:14,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:14,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923207507] [2024-11-14 02:58:14,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923207507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:14,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633356876] [2024-11-14 02:58:14,919 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 02:58:14,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:14,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:14,921 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:14,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 02:58:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:15,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 02:58:15,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-14 02:58:15,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 02:58:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633356876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [248839714] [2024-11-14 02:58:21,717 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:58:21,717 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:21,718 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:58:21,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:21,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2024-11-14 02:58:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698833065] [2024-11-14 02:58:21,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:21,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 02:58:21,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:21,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 02:58:21,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2024-11-14 02:58:21,720 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2024-11-14 02:58:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:21,993 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-11-14 02:58:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 02:58:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) Word has length 69 [2024-11-14 02:58:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:21,995 INFO L225 Difference]: With dead ends: 48 [2024-11-14 02:58:21,995 INFO L226 Difference]: Without dead ends: 44 [2024-11-14 02:58:21,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 125 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=424, Invalid=908, Unknown=0, NotChecked=0, Total=1332 [2024-11-14 02:58:21,996 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 70 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:21,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 61 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:58:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-14 02:58:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-14 02:58:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-14 02:58:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2024-11-14 02:58:22,003 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2024-11-14 02:58:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:22,003 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2024-11-14 02:58:22,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2024-11-14 02:58:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2024-11-14 02:58:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 02:58:22,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:22,005 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:22,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 02:58:22,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 02:58:22,205 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:22,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash -776930930, now seen corresponding path program 11 times [2024-11-14 02:58:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958387931] [2024-11-14 02:58:22,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-14 02:58:22,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:22,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958387931] [2024-11-14 02:58:22,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958387931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:22,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472912174] [2024-11-14 02:58:22,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:58:22,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:22,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:22,589 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:22,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 02:58:22,959 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-14 02:58:22,959 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:58:22,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 02:58:22,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-14 02:58:23,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-14 02:58:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472912174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [79703405] [2024-11-14 02:58:31,243 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:58:31,243 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:31,243 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:58:31,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:31,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2024-11-14 02:58:31,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487145405] [2024-11-14 02:58:31,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:31,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 02:58:31,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:31,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 02:58:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2024-11-14 02:58:31,246 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (24), 12 states have call predecessors, (24), 14 states have call successors, (24) [2024-11-14 02:58:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:31,565 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2024-11-14 02:58:31,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 02:58:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (24), 12 states have call predecessors, (24), 14 states have call successors, (24) Word has length 75 [2024-11-14 02:58:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:31,567 INFO L225 Difference]: With dead ends: 51 [2024-11-14 02:58:31,567 INFO L226 Difference]: Without dead ends: 47 [2024-11-14 02:58:31,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 12 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=1062, Unknown=0, NotChecked=0, Total=1560 [2024-11-14 02:58:31,568 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 157 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:31,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 71 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:58:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-14 02:58:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-14 02:58:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-14 02:58:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-11-14 02:58:31,576 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2024-11-14 02:58:31,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:31,576 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-11-14 02:58:31,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (24), 12 states have call predecessors, (24), 14 states have call successors, (24) [2024-11-14 02:58:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-11-14 02:58:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-14 02:58:31,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:31,578 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:31,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 02:58:31,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 02:58:31,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:31,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1158839228, now seen corresponding path program 12 times [2024-11-14 02:58:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328927360] [2024-11-14 02:58:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-14 02:58:32,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328927360] [2024-11-14 02:58:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328927360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855209354] [2024-11-14 02:58:32,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 02:58:32,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:32,229 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:32,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 02:58:32,686 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 02:58:32,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:58:32,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 02:58:32,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-14 02:58:32,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-14 02:58:43,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855209354] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:43,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1886829866] [2024-11-14 02:58:43,263 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:58:43,263 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:43,263 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:58:43,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:43,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2024-11-14 02:58:43,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423143926] [2024-11-14 02:58:43,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:43,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 02:58:43,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:43,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 02:58:43,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2024-11-14 02:58:43,267 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-14 02:58:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:43,525 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2024-11-14 02:58:43,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 02:58:43,525 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 81 [2024-11-14 02:58:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:43,526 INFO L225 Difference]: With dead ends: 54 [2024-11-14 02:58:43,526 INFO L226 Difference]: Without dead ends: 50 [2024-11-14 02:58:43,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 147 SyntacticMatches, 13 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=578, Invalid=1228, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 02:58:43,528 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 159 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:43,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 77 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:58:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-14 02:58:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-14 02:58:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-14 02:58:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2024-11-14 02:58:43,534 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2024-11-14 02:58:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:43,535 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-11-14 02:58:43,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-14 02:58:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2024-11-14 02:58:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-14 02:58:43,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:43,537 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:43,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 02:58:43,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 02:58:43,737 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:43,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1570097358, now seen corresponding path program 13 times [2024-11-14 02:58:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077765817] [2024-11-14 02:58:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-14 02:58:44,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077765817] [2024-11-14 02:58:44,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077765817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603291033] [2024-11-14 02:58:44,161 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 02:58:44,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:44,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:44,163 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:44,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 02:58:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:44,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 02:58:44,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-14 02:58:44,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-14 02:58:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603291033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1734359309] [2024-11-14 02:58:57,603 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:58:57,603 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:57,604 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:58:57,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:57,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2024-11-14 02:58:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843837395] [2024-11-14 02:58:57,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:57,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 02:58:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:57,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 02:58:57,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 02:58:57,607 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2024-11-14 02:58:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:57,889 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2024-11-14 02:58:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 02:58:57,889 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) Word has length 87 [2024-11-14 02:58:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:57,890 INFO L225 Difference]: With dead ends: 57 [2024-11-14 02:58:57,890 INFO L226 Difference]: Without dead ends: 53 [2024-11-14 02:58:57,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 14 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=664, Invalid=1406, Unknown=0, NotChecked=0, Total=2070 [2024-11-14 02:58:57,892 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 177 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:57,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 83 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:58:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-14 02:58:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-14 02:58:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-14 02:58:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-11-14 02:58:57,899 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2024-11-14 02:58:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:57,899 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-11-14 02:58:57,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2024-11-14 02:58:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-11-14 02:58:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-14 02:58:57,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:57,901 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:57,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 02:58:58,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 02:58:58,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:58,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1407069436, now seen corresponding path program 14 times [2024-11-14 02:58:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268659404] [2024-11-14 02:58:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-14 02:58:58,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268659404] [2024-11-14 02:58:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268659404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400673718] [2024-11-14 02:58:58,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:58:58,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:58,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:58,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:58,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 02:58:59,247 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-14 02:58:59,248 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:58:59,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 02:58:59,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-14 02:58:59,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:59:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-14 02:59:15,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400673718] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:59:15,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1633597400] [2024-11-14 02:59:15,158 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:59:15,158 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:59:15,158 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 02:59:15,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:59:15,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 34 [2024-11-14 02:59:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293683250] [2024-11-14 02:59:15,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:59:15,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 02:59:15,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:15,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 02:59:15,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 02:59:15,162 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 34 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 16 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (29), 15 states have call predecessors, (29), 16 states have call successors, (29) [2024-11-14 02:59:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:15,498 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2024-11-14 02:59:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 02:59:15,499 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 16 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (29), 15 states have call predecessors, (29), 16 states have call successors, (29) Word has length 93 [2024-11-14 02:59:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:15,504 INFO L225 Difference]: With dead ends: 60 [2024-11-14 02:59:15,504 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 02:59:15,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 169 SyntacticMatches, 16 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=753, Invalid=1503, Unknown=0, NotChecked=0, Total=2256 [2024-11-14 02:59:15,505 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 141 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:15,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 77 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:59:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 02:59:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-14 02:59:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-14 02:59:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-11-14 02:59:15,517 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2024-11-14 02:59:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:15,517 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-11-14 02:59:15,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 16 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (29), 15 states have call predecessors, (29), 16 states have call successors, (29) [2024-11-14 02:59:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-11-14 02:59:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-14 02:59:15,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:15,523 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:59:15,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 02:59:15,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 02:59:15,723 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:59:15,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 15 times [2024-11-14 02:59:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:15,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058620988] [2024-11-14 02:59:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:15,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:59:15,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 02:59:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:59:15,827 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 02:59:15,827 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 02:59:15,828 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 02:59:15,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 02:59:15,835 INFO L407 BasicCegarLoop]: Path program histogram: [15, 1] [2024-11-14 02:59:15,893 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 02:59:15,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 02:59:15 BoogieIcfgContainer [2024-11-14 02:59:15,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 02:59:15,899 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 02:59:15,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 02:59:15,900 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 02:59:15,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:57:48" (3/4) ... [2024-11-14 02:59:15,902 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 02:59:15,966 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 02:59:15,969 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 02:59:15,970 INFO L158 Benchmark]: Toolchain (without parser) took 87927.94ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 93.8MB in the beginning and 231.5MB in the end (delta: -137.7MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. [2024-11-14 02:59:15,970 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:59:15,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.01ms. Allocated memory is still 117.4MB. Free memory was 93.8MB in the beginning and 83.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 02:59:15,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.34ms. Allocated memory is still 117.4MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 997.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:59:15,972 INFO L158 Benchmark]: Boogie Preprocessor took 16.78ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 81.4MB in the end (delta: 688.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:59:15,972 INFO L158 Benchmark]: RCFGBuilder took 296.49ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 71.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 02:59:15,973 INFO L158 Benchmark]: TraceAbstraction took 87205.87ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 71.0MB in the beginning and 235.7MB in the end (delta: -164.7MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2024-11-14 02:59:15,974 INFO L158 Benchmark]: Witness Printer took 69.85ms. Allocated memory is still 394.3MB. Free memory was 235.7MB in the beginning and 231.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:59:15,975 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.75ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.01ms. Allocated memory is still 117.4MB. Free memory was 93.8MB in the beginning and 83.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.34ms. Allocated memory is still 117.4MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 997.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.78ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 81.4MB in the end (delta: 688.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 296.49ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 71.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 87205.87ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 71.0MB in the beginning and 235.7MB in the end (delta: -164.7MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. * Witness Printer took 69.85ms. Allocated memory is still 394.3MB. Free memory was 235.7MB in the beginning and 231.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 15; [L15] int b = 0; VAL [a=15, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=15, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 87.1s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1211 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1061 mSDsluCounter, 785 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 665 mSDsCounter, 470 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1154 IncrementalHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 470 mSolverCounterUnsat, 120 mSDtfsCounter, 1154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1874 GetRequests, 1367 SyntacticMatches, 120 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3449 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 76.9s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 2234 ConstructedInterpolants, 0 QuantifiedInterpolants, 6624 SizeOfPredicates, 105 NumberOfNonLiveVariables, 2562 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 3710/9450 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 02:59:16,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c13311-6537-4a5f-8250-e2d7a9c34ee1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE