./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_10x0-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_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/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_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_10x0-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/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_c6fc2152-f320-4ab7-9237-8aacce2d96bf/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 2b1e7360b510ceea1b4f190c67c2656c6deb0030b7718750b71696817135287b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:42:01,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:42:01,300 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 02:42:01,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:42:01,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:42:01,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:42:01,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:42:01,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:42:01,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:42:01,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:42:01,334 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:42:01,334 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:42:01,334 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:42:01,334 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:42:01,335 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:42:01,335 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:42:01,335 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:42:01,335 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:42:01,335 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:42:01,335 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:42:01,335 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:42:01,336 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:42:01,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:42:01,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 02:42:01,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:42:01,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:42:01,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:42:01,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:42:01,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 02:42:01,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:42:01,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 02:42:01,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:42:01,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:42:01,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 02:42:01,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:42:01,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:42:01,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:42:01,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:42:01,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:42:01,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:42:01,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:42:01,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 02:42:01,339 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:42:01,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:42:01,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:42:01,339 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:42:01,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:42:01,339 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_c6fc2152-f320-4ab7-9237-8aacce2d96bf/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 -> 2b1e7360b510ceea1b4f190c67c2656c6deb0030b7718750b71696817135287b [2024-11-14 02:42:01,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:42:01,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:42:01,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:42:01,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:42:01,758 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:42:01,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/recursive-simple/sum_10x0-2.c Unable to find full path for "g++" [2024-11-14 02:42:03,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:42:04,073 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:42:04,074 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/sv-benchmarks/c/recursive-simple/sum_10x0-2.c [2024-11-14 02:42:04,092 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/data/629308a83/fe991ead42fa4c82b39caf7fe74b8889/FLAGcb0e842f1 [2024-11-14 02:42:04,112 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/data/629308a83/fe991ead42fa4c82b39caf7fe74b8889 [2024-11-14 02:42:04,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:42:04,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:42:04,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:42:04,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:42:04,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:42:04,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e42b376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04, skipping insertion in model container [2024-11-14 02:42:04,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:42:04,311 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_c6fc2152-f320-4ab7-9237-8aacce2d96bf/sv-benchmarks/c/recursive-simple/sum_10x0-2.c[481,494] [2024-11-14 02:42:04,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:42:04,324 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:42:04,336 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_c6fc2152-f320-4ab7-9237-8aacce2d96bf/sv-benchmarks/c/recursive-simple/sum_10x0-2.c[481,494] [2024-11-14 02:42:04,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:42:04,348 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:42:04,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04 WrapperNode [2024-11-14 02:42:04,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:42:04,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:42:04,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:42:04,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:42:04,356 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:42:04" (1/1) ... [2024-11-14 02:42:04,362 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:42:04" (1/1) ... [2024-11-14 02:42:04,380 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-14 02:42:04,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:42:04,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:42:04,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:42:04,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:42:04,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:42:04,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:42:04,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:42:04,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:42:04,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (1/1) ... [2024-11-14 02:42:04,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:42:04,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:04,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/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:42:04,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/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:42:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:42:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:42:04,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:42:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-14 02:42:04,469 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-14 02:42:04,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 02:42:04,526 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:42:04,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:42:04,641 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-14 02:42:04,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:42:04,665 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:42:04,665 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 02:42:04,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:42:04 BoogieIcfgContainer [2024-11-14 02:42:04,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:42:04,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:42:04,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:42:04,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:42:04,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:42:04" (1/3) ... [2024-11-14 02:42:04,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb31d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:42:04, skipping insertion in model container [2024-11-14 02:42:04,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:04" (2/3) ... [2024-11-14 02:42:04,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb31d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:42:04, skipping insertion in model container [2024-11-14 02:42:04,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:42:04" (3/3) ... [2024-11-14 02:42:04,675 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0-2.c [2024-11-14 02:42:04,692 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:42:04,694 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sum_10x0-2.c that has 2 procedures, 14 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-14 02:42:04,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:42:04,774 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;@9f8f814, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:42:04,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 02:42:04,781 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:42:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 02:42:04,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:04,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:04,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:04,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:04,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2024-11-14 02:42:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:04,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738580827] [2024-11-14 02:42:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:04,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:05,074 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:42:05,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:05,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738580827] [2024-11-14 02:42:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738580827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:05,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:05,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:42:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449608046] [2024-11-14 02:42:05,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:05,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:42:05,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:05,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:42:05,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:42:05,107 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:42:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:05,200 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-11-14 02:42:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:42:05,205 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:42:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:05,213 INFO L225 Difference]: With dead ends: 22 [2024-11-14 02:42:05,213 INFO L226 Difference]: Without dead ends: 14 [2024-11-14 02:42:05,215 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:42:05,223 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:42:05,223 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:42:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-14 02:42:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-14 02:42:05,258 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:42:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-14 02:42:05,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2024-11-14 02:42:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:05,267 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-14 02:42:05,267 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:42:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-14 02:42:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 02:42:05,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:05,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:05,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 02:42:05,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:05,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2024-11-14 02:42:05,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:05,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171658789] [2024-11-14 02:42:05,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:05,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:05,471 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:42:05,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:05,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171658789] [2024-11-14 02:42:05,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171658789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:05,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44054625] [2024-11-14 02:42:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:05,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:05,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:05,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:05,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 02:42:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:05,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 02:42:05,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:05,680 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:42:05,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:05,962 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:42:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44054625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:42:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [453691939] [2024-11-14 02:42:05,990 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:42:05,990 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:05,994 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:42:05,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:42:05,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2024-11-14 02:42:06,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467363721] [2024-11-14 02:42:06,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:06,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 02:42:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 02:42:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:42:06,002 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:42:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:06,083 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-14 02:42:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 02:42:06,084 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:42:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:06,085 INFO L225 Difference]: With dead ends: 21 [2024-11-14 02:42:06,085 INFO L226 Difference]: Without dead ends: 17 [2024-11-14 02:42:06,085 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:42:06,086 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:42:06,086 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:42:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-14 02:42:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-14 02:42:06,094 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:42:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-14 02:42:06,095 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2024-11-14 02:42:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:06,096 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-14 02:42:06,097 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:42:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-14 02:42:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 02:42:06,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:06,099 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:06,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 02:42:06,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-14 02:42:06,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:06,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2024-11-14 02:42:06,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:06,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132441245] [2024-11-14 02:42:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:06,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:06,520 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:42:06,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132441245] [2024-11-14 02:42:06,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132441245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272771374] [2024-11-14 02:42:06,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:42:06,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:06,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:06,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:06,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 02:42:06,580 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 02:42:06,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:42:06,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 02:42:06,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:06,642 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:42:06,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:07,102 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:42:07,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272771374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:42:07,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860196968] [2024-11-14 02:42:07,104 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:42:07,105 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:07,105 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:42:07,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:42:07,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2024-11-14 02:42:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369153440] [2024-11-14 02:42:07,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:07,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 02:42:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:07,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 02:42:07,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:42:07,110 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:42:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:07,198 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-11-14 02:42:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:42:07,198 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:42:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:07,199 INFO L225 Difference]: With dead ends: 24 [2024-11-14 02:42:07,199 INFO L226 Difference]: Without dead ends: 20 [2024-11-14 02:42:07,200 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:42:07,200 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:42:07,201 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:42:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-14 02:42:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-14 02:42:07,206 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:42:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-11-14 02:42:07,207 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2024-11-14 02:42:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:07,207 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-14 02:42:07,207 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:42:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-11-14 02:42:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 02:42:07,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:07,208 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:07,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 02:42:07,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:07,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:07,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2024-11-14 02:42:07,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:07,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116084428] [2024-11-14 02:42:07,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:07,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:07,615 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:42:07,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:07,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116084428] [2024-11-14 02:42:07,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116084428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:07,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420390619] [2024-11-14 02:42:07,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 02:42:07,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:07,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:07,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:07,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 02:42:07,682 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 02:42:07,683 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:42:07,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 02:42:07,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:07,753 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:42:07,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:08,506 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:42:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420390619] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:42:08,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913272561] [2024-11-14 02:42:08,509 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:42:08,509 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:08,509 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:42:08,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:42:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2024-11-14 02:42:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000511630] [2024-11-14 02:42:08,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:08,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 02:42:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 02:42:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-14 02:42:08,513 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:42:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:08,612 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-14 02:42:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 02:42:08,613 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:42:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:08,614 INFO L225 Difference]: With dead ends: 27 [2024-11-14 02:42:08,614 INFO L226 Difference]: Without dead ends: 23 [2024-11-14 02:42:08,615 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:42:08,615 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:42:08,616 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:42:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-14 02:42:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-14 02:42:08,624 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:42:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-14 02:42:08,625 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2024-11-14 02:42:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:08,626 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-14 02:42:08,626 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:42:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-14 02:42:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 02:42:08,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:08,629 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:08,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 02:42:08,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:08,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:08,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:08,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2024-11-14 02:42:08,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:08,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009863940] [2024-11-14 02:42:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:08,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:09,040 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:42:09,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:09,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009863940] [2024-11-14 02:42:09,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009863940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:09,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032652073] [2024-11-14 02:42:09,040 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 02:42:09,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:09,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:09,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 02:42:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:09,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 02:42:09,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:09,210 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:42:09,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:10,631 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:42:10,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032652073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:42:10,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1991848655] [2024-11-14 02:42:10,634 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:42:10,635 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:10,635 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:42:10,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:42:10,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2024-11-14 02:42:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773618893] [2024-11-14 02:42:10,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:10,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 02:42:10,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 02:42:10,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-14 02:42:10,639 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:42:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:10,755 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-11-14 02:42:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 02:42:10,755 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:42:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:10,756 INFO L225 Difference]: With dead ends: 30 [2024-11-14 02:42:10,756 INFO L226 Difference]: Without dead ends: 26 [2024-11-14 02:42:10,757 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:42:10,758 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:42:10,758 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:42:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-14 02:42:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-14 02:42:10,767 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:42:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-14 02:42:10,769 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2024-11-14 02:42:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:10,770 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-14 02:42:10,770 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:42:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-11-14 02:42:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:42:10,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:10,772 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:10,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 02:42:10,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:10,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2024-11-14 02:42:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:10,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303781594] [2024-11-14 02:42:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:11,217 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:42:11,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303781594] [2024-11-14 02:42:11,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303781594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987267318] [2024-11-14 02:42:11,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:42:11,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:11,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:11,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:11,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 02:42:11,304 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-14 02:42:11,304 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:42:11,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 02:42:11,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:11,386 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:42:11,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:12,947 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:42:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987267318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:42:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [107729664] [2024-11-14 02:42:12,953 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:42:12,953 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:12,953 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:42:12,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:42:12,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2024-11-14 02:42:12,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300817723] [2024-11-14 02:42:12,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:12,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 02:42:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:12,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 02:42:12,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-14 02:42:12,956 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:42:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:13,097 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-14 02:42:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 02:42:13,099 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:42:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:13,100 INFO L225 Difference]: With dead ends: 33 [2024-11-14 02:42:13,100 INFO L226 Difference]: Without dead ends: 29 [2024-11-14 02:42:13,100 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:42:13,101 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:42:13,101 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:42:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-14 02:42:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-14 02:42:13,111 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:42:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-14 02:42:13,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2024-11-14 02:42:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:13,112 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-14 02:42:13,112 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:42:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-14 02:42:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 02:42:13,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:13,114 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:13,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 02:42:13,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 02:42:13,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:13,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2024-11-14 02:42:13,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:13,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751096737] [2024-11-14 02:42:13,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:13,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:13,568 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:42:13,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751096737] [2024-11-14 02:42:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751096737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953463189] [2024-11-14 02:42:13,569 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 02:42:13,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:13,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:13,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:13,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 02:42:13,668 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 02:42:13,668 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:42:13,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 02:42:13,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:13,747 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:42:13,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:15,736 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:42:15,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953463189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:42:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [607746182] [2024-11-14 02:42:15,739 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:42:15,739 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:15,739 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:42:15,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:42:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2024-11-14 02:42:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348851221] [2024-11-14 02:42:15,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:15,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 02:42:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:15,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 02:42:15,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-14 02:42:15,742 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:42:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:15,921 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-14 02:42:15,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 02:42:15,922 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:42:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:15,923 INFO L225 Difference]: With dead ends: 36 [2024-11-14 02:42:15,923 INFO L226 Difference]: Without dead ends: 32 [2024-11-14 02:42:15,924 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:42:15,924 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:42:15,925 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:42:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-14 02:42:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-14 02:42:15,930 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:42:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-14 02:42:15,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2024-11-14 02:42:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:15,931 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-14 02:42:15,932 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:42:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-14 02:42:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 02:42:15,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:15,933 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:15,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 02:42:16,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:16,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:16,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:16,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2024-11-14 02:42:16,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:16,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149523247] [2024-11-14 02:42:16,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:16,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:16,423 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:42:16,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149523247] [2024-11-14 02:42:16,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149523247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:16,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325279903] [2024-11-14 02:42:16,424 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 02:42:16,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:16,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:16,426 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:16,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 02:42:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:16,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 02:42:16,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:16,629 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:42:16,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:19,397 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:42:19,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325279903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:42:19,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069852847] [2024-11-14 02:42:19,400 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:42:19,400 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:19,400 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:42:19,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:42:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2024-11-14 02:42:19,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807334799] [2024-11-14 02:42:19,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:19,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 02:42:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 02:42:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-11-14 02:42:19,402 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:42:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:19,542 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-14 02:42:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 02:42:19,543 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:42:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:19,544 INFO L225 Difference]: With dead ends: 39 [2024-11-14 02:42:19,544 INFO L226 Difference]: Without dead ends: 35 [2024-11-14 02:42:19,544 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:42:19,545 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:42:19,545 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:42:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-14 02:42:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-14 02:42:19,551 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:42:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-14 02:42:19,552 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2024-11-14 02:42:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:19,553 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-14 02:42:19,553 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:42:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-14 02:42:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-14 02:42:19,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:19,554 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:19,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 02:42:19,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 02:42:19,756 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:19,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2024-11-14 02:42:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:19,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837103256] [2024-11-14 02:42:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:20,182 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:42:20,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:20,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837103256] [2024-11-14 02:42:20,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837103256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:20,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993266856] [2024-11-14 02:42:20,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:42:20,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:20,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:20,186 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:20,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 02:42:20,349 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-14 02:42:20,349 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:42:20,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 02:42:20,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:20,443 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:42:20,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:24,176 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:42:24,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993266856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:42:24,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [330788049] [2024-11-14 02:42:24,178 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:42:24,178 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:24,178 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:42:24,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:42:24,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2024-11-14 02:42:24,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130078030] [2024-11-14 02:42:24,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:24,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 02:42:24,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:24,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 02:42:24,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-14 02:42:24,181 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:42:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:24,368 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-14 02:42:24,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 02:42:24,370 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:42:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:24,371 INFO L225 Difference]: With dead ends: 42 [2024-11-14 02:42:24,371 INFO L226 Difference]: Without dead ends: 38 [2024-11-14 02:42:24,372 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:42:24,373 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:42:24,373 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:42:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-14 02:42:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-14 02:42:24,385 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:42:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-14 02:42:24,386 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2024-11-14 02:42:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:24,386 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-14 02:42:24,387 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:42:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-14 02:42:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 02:42:24,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:24,388 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:24,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 02:42:24,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-14 02:42:24,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:24,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2024-11-14 02:42:24,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:24,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983487175] [2024-11-14 02:42:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:24,925 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:42:24,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983487175] [2024-11-14 02:42:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983487175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057807840] [2024-11-14 02:42:24,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 02:42:24,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:24,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:24,928 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:24,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 02:42:25,119 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 02:42:25,119 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:42:25,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 02:42:25,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:25,218 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:42:25,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:30,017 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:42:30,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057807840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:42:30,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [514976802] [2024-11-14 02:42:30,019 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:42:30,019 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:30,019 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:42:30,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:42:30,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 24 [2024-11-14 02:42:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834205523] [2024-11-14 02:42:30,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:30,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 02:42:30,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:30,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 02:42:30,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-14 02:42:30,022 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (19), 10 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-14 02:42:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:30,223 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-14 02:42:30,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 02:42:30,224 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (19), 10 states have call predecessors, (19), 11 states have call successors, (19) Word has length 63 [2024-11-14 02:42:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:30,225 INFO L225 Difference]: With dead ends: 45 [2024-11-14 02:42:30,225 INFO L226 Difference]: Without dead ends: 41 [2024-11-14 02:42:30,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 114 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 02:42:30,226 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 79 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:42:30,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 59 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:42:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-14 02:42:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-14 02:42:30,231 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:42:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-14 02:42:30,232 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2024-11-14 02:42:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:30,232 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-14 02:42:30,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (19), 10 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-14 02:42:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-14 02:42:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-14 02:42:30,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:30,234 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:30,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 02:42:30,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 02:42:30,435 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:30,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2024-11-14 02:42:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:30,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63259213] [2024-11-14 02:42:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:42:30,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 02:42:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:42:30,533 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 02:42:30,534 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 02:42:30,535 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 02:42:30,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 02:42:30,540 INFO L407 BasicCegarLoop]: Path program histogram: [10, 1] [2024-11-14 02:42:30,593 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 02:42:30,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 02:42:30 BoogieIcfgContainer [2024-11-14 02:42:30,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 02:42:30,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 02:42:30,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 02:42:30,599 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 02:42:30,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:42:04" (3/4) ... [2024-11-14 02:42:30,601 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 02:42:30,649 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 02:42:30,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 02:42:30,650 INFO L158 Benchmark]: Toolchain (without parser) took 26534.96ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 94.5MB in the beginning and 131.5MB in the end (delta: -37.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 02:42:30,650 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:42:30,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.20ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 83.8MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 02:42:30,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.68ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 82.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:42:30,651 INFO L158 Benchmark]: Boogie Preprocessor took 14.79ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 82.0MB in the end (delta: 680.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:42:30,651 INFO L158 Benchmark]: RCFGBuilder took 267.06ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 72.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 02:42:30,652 INFO L158 Benchmark]: TraceAbstraction took 25930.06ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 71.9MB in the beginning and 135.1MB in the end (delta: -63.2MB). Peak memory consumption was 34.6kB. Max. memory is 16.1GB. [2024-11-14 02:42:30,652 INFO L158 Benchmark]: Witness Printer took 50.53ms. Allocated memory is still 176.2MB. Free memory was 135.1MB in the beginning and 131.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:42:30,654 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.20ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 83.8MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.68ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 82.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.79ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 82.0MB in the end (delta: 680.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.06ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 72.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25930.06ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 71.9MB in the beginning and 135.1MB in the end (delta: -63.2MB). Peak memory consumption was 34.6kB. Max. memory is 16.1GB. * Witness Printer took 50.53ms. Allocated memory is still 176.2MB. Free memory was 135.1MB in the beginning and 131.5MB in the end (delta: 3.6MB). 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 = 10; [L15] int b = 0; VAL [a=10, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=10, 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: 25.8s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 80 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 869 GetRequests, 632 SyntacticMatches, 55 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, InterpolantAutomatonStates: 95, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1034 ConstructedInterpolants, 0 QuantifiedInterpolants, 3004 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1242 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 1065/2700 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:42:30,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6fc2152-f320-4ab7-9237-8aacce2d96bf/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