/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/recursive/recHanoi01.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:01:17,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:01:17,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:01:17,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:01:17,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:01:17,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:01:17,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:01:17,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:01:17,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:01:17,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:01:17,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:01:17,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:01:17,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:01:17,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:01:17,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:01:17,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:01:17,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:01:17,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:01:17,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:01:17,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:01:17,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:01:17,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:01:17,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:01:17,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:01:17,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:01:17,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:01:17,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:01:17,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:01:17,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:01:17,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:01:17,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:01:17,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:01:17,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:01:17,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:01:17,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:01:17,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:01:17,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:01:17,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:01:17,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:01:17,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:01:17,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:01:17,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 00:01:17,635 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:01:17,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:01:17,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:01:17,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:01:17,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:01:17,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:01:17,637 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:01:17,637 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:01:17,637 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:01:17,637 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:01:17,638 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:01:17,638 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:01:17,638 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:01:17,638 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:01:17,638 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:01:17,638 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:01:17,638 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:01:17,639 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:01:17,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:01:17,639 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:01:17,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:01:17,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:01:17,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:01:17,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:01:17,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:01:17,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:01:17,640 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:01:17,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:01:17,641 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:01:17,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:01:17,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:01:17,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:01:17,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:17,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:01:17,641 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:01:17,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:01:17,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:01:17,642 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:01:17,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:01:17,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:01:17,642 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:01:17,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> IntervalDomain [2023-04-01 00:01:17,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:01:17,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:01:17,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:01:17,931 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:01:17,932 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:01:17,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi01.c [2023-04-01 00:01:19,391 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:01:19,591 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:01:19,592 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi01.c [2023-04-01 00:01:19,597 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d6342d9e/703cdcb273f047bfa20a24aef57fadeb/FLAG3ede47721 [2023-04-01 00:01:19,615 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d6342d9e/703cdcb273f047bfa20a24aef57fadeb [2023-04-01 00:01:19,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:01:19,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:01:19,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:19,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:01:19,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:01:19,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58869f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19, skipping insertion in model container [2023-04-01 00:01:19,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:01:19,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:01:19,815 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi01.c[1213,1226] [2023-04-01 00:01:19,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:19,828 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:01:19,845 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi01.c[1213,1226] [2023-04-01 00:01:19,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:19,859 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:01:19,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19 WrapperNode [2023-04-01 00:01:19,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:19,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:01:19,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:01:19,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:01:19,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,889 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:01:19,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:01:19,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:01:19,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:01:19,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (1/1) ... [2023-04-01 00:01:19,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:19,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 00:01:19,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 00:01:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:01:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:01:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:01:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-04-01 00:01:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure applyHanoi [2023-04-01 00:01:19,970 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:01:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:01:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:01:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:01:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:01:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:01:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-04-01 00:01:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure applyHanoi [2023-04-01 00:01:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:01:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:01:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:01:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:01:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:01:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:01:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:01:20,045 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:01:20,047 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:01:20,253 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:01:20,281 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:01:20,281 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 00:01:20,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:20 BoogieIcfgContainer [2023-04-01 00:01:20,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:01:20,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:01:20,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:01:20,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:01:20,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:01:19" (1/3) ... [2023-04-01 00:01:20,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4760de2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:20, skipping insertion in model container [2023-04-01 00:01:20,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:19" (2/3) ... [2023-04-01 00:01:20,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4760de2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:20, skipping insertion in model container [2023-04-01 00:01:20,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:20" (3/3) ... [2023-04-01 00:01:20,317 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi01.c [2023-04-01 00:01:20,347 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:01:20,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:01:20,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:01:20,439 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@6fa229ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:01:20,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:01:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 00:01:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 00:01:20,453 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:20,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:20,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:20,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2113157996, now seen corresponding path program 1 times [2023-04-01 00:01:20,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:20,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115228586] [2023-04-01 00:01:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:20,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:01:20,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:20,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115228586] [2023-04-01 00:01:20,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115228586] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:20,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:20,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:01:20,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871066466] [2023-04-01 00:01:20,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:20,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:20,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:20,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:20,799 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 00:01:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:20,909 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2023-04-01 00:01:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:20,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-04-01 00:01:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:20,917 INFO L225 Difference]: With dead ends: 47 [2023-04-01 00:01:20,918 INFO L226 Difference]: Without dead ends: 26 [2023-04-01 00:01:20,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:20,923 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:20,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 92 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-04-01 00:01:20,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-04-01 00:01:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-01 00:01:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-04-01 00:01:20,958 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2023-04-01 00:01:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:20,958 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-04-01 00:01:20,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 00:01:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-04-01 00:01:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-01 00:01:20,960 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:20,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:20,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:01:20,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:20,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1699220345, now seen corresponding path program 1 times [2023-04-01 00:01:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331003595] [2023-04-01 00:01:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:01:21,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:21,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331003595] [2023-04-01 00:01:21,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331003595] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:21,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882096302] [2023-04-01 00:01:21,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:21,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:21,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:21,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:21,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 00:01:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:21,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2023-04-01 00:01:21,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-01 00:01:21,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:01:22,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882096302] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:22,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1427852580] [2023-04-01 00:01:22,043 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-01 00:01:22,044 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:22,047 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:22,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:22,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2023-04-01 00:01:22,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100825845] [2023-04-01 00:01:22,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:22,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 00:01:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:22,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 00:01:22,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:01:22,053 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-01 00:01:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:22,457 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2023-04-01 00:01:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 00:01:22,457 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 29 [2023-04-01 00:01:22,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:22,460 INFO L225 Difference]: With dead ends: 77 [2023-04-01 00:01:22,460 INFO L226 Difference]: Without dead ends: 71 [2023-04-01 00:01:22,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2023-04-01 00:01:22,462 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:22,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 124 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:01:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-01 00:01:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2023-04-01 00:01:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 34 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 12 states have return successors, (34), 17 states have call predecessors, (34), 15 states have call successors, (34) [2023-04-01 00:01:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2023-04-01 00:01:22,493 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 29 [2023-04-01 00:01:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:22,494 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2023-04-01 00:01:22,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-01 00:01:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2023-04-01 00:01:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 00:01:22,496 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:22,496 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:22,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-01 00:01:22,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:22,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:22,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1993519074, now seen corresponding path program 2 times [2023-04-01 00:01:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54997555] [2023-04-01 00:01:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 00:01:22,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:22,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54997555] [2023-04-01 00:01:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54997555] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:22,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121704063] [2023-04-01 00:01:22,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:22,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:22,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:22,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:22,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 00:01:22,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 00:01:22,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:22,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:01:22,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-01 00:01:23,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 00:01:23,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121704063] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:23,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [793509889] [2023-04-01 00:01:23,448 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-01 00:01:23,448 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:23,448 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:23,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:23,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 16 [2023-04-01 00:01:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835488355] [2023-04-01 00:01:23,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:23,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 00:01:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:23,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 00:01:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-04-01 00:01:23,452 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-04-01 00:01:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:23,715 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2023-04-01 00:01:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 00:01:23,716 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) Word has length 39 [2023-04-01 00:01:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:23,722 INFO L225 Difference]: With dead ends: 111 [2023-04-01 00:01:23,722 INFO L226 Difference]: Without dead ends: 77 [2023-04-01 00:01:23,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2023-04-01 00:01:23,724 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:23,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-04-01 00:01:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2023-04-01 00:01:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 33 states have internal predecessors, (38), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (21), 13 states have call predecessors, (21), 12 states have call successors, (21) [2023-04-01 00:01:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-04-01 00:01:23,743 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 39 [2023-04-01 00:01:23,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:23,744 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-04-01 00:01:23,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-04-01 00:01:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-04-01 00:01:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-04-01 00:01:23,750 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:23,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:23,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:23,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-01 00:01:23,959 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:23,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 317444017, now seen corresponding path program 1 times [2023-04-01 00:01:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:23,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146604043] [2023-04-01 00:01:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:24,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146604043] [2023-04-01 00:01:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146604043] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511580575] [2023-04-01 00:01:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:24,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:24,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:24,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:24,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 00:01:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:24,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:01:24,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:24,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:01:24,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511580575] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:24,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65816019] [2023-04-01 00:01:24,452 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-01 00:01:24,452 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:24,452 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:24,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:24,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 13 [2023-04-01 00:01:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205027688] [2023-04-01 00:01:24,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:24,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 00:01:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 00:01:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-01 00:01:24,468 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-01 00:01:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:24,624 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2023-04-01 00:01:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:01:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2023-04-01 00:01:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:24,630 INFO L225 Difference]: With dead ends: 65 [2023-04-01 00:01:24,631 INFO L226 Difference]: Without dead ends: 53 [2023-04-01 00:01:24,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:01:24,634 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:24,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 126 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-04-01 00:01:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2023-04-01 00:01:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-04-01 00:01:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-04-01 00:01:24,659 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 35 [2023-04-01 00:01:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:24,659 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-04-01 00:01:24,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-01 00:01:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-04-01 00:01:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 00:01:24,660 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:24,660 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:24,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:24,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:24,888 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:24,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1894273327, now seen corresponding path program 2 times [2023-04-01 00:01:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:24,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762457382] [2023-04-01 00:01:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 13 proven. 37 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-04-01 00:01:25,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:25,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762457382] [2023-04-01 00:01:25,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762457382] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:25,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164025211] [2023-04-01 00:01:25,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:25,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:25,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:25,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:25,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 00:01:25,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-01 00:01:25,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:25,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 47 conjunts are in the unsatisfiable core [2023-04-01 00:01:25,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-04-01 00:01:25,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-01 00:01:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164025211] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [271557973] [2023-04-01 00:01:26,264 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-01 00:01:26,265 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:26,265 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:26,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 18] total 32 [2023-04-01 00:01:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875335806] [2023-04-01 00:01:26,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:26,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-04-01 00:01:26,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-04-01 00:01:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2023-04-01 00:01:26,270 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 32 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (22), 8 states have call predecessors, (22), 15 states have return successors, (22), 14 states have call predecessors, (22), 10 states have call successors, (22) [2023-04-01 00:01:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:27,311 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2023-04-01 00:01:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-04-01 00:01:27,312 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (22), 8 states have call predecessors, (22), 15 states have return successors, (22), 14 states have call predecessors, (22), 10 states have call successors, (22) Word has length 55 [2023-04-01 00:01:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:27,313 INFO L225 Difference]: With dead ends: 104 [2023-04-01 00:01:27,314 INFO L226 Difference]: Without dead ends: 100 [2023-04-01 00:01:27,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 96 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=478, Invalid=2828, Unknown=0, NotChecked=0, Total=3306 [2023-04-01 00:01:27,316 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 164 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:27,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 159 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:01:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-04-01 00:01:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 83. [2023-04-01 00:01:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 20 states have call successors, (20), 12 states have call predecessors, (20), 17 states have return successors, (45), 25 states have call predecessors, (45), 19 states have call successors, (45) [2023-04-01 00:01:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2023-04-01 00:01:27,343 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 55 [2023-04-01 00:01:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:27,344 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2023-04-01 00:01:27,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (22), 8 states have call predecessors, (22), 15 states have return successors, (22), 14 states have call predecessors, (22), 10 states have call successors, (22) [2023-04-01 00:01:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2023-04-01 00:01:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-04-01 00:01:27,354 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:27,354 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:27,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:27,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:27,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:27,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1176359335, now seen corresponding path program 3 times [2023-04-01 00:01:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:27,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744812721] [2023-04-01 00:01:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:27,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 43 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-04-01 00:01:27,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744812721] [2023-04-01 00:01:27,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744812721] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464752986] [2023-04-01 00:01:27,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:27,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:27,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:27,749 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:27,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 00:01:27,841 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:27,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:27,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:01:27,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 37 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-04-01 00:01:27,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-04-01 00:01:28,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464752986] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:28,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1819481947] [2023-04-01 00:01:28,361 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-01 00:01:28,361 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:28,361 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:28,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 19 [2023-04-01 00:01:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900669512] [2023-04-01 00:01:28,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:28,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 00:01:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 00:01:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-04-01 00:01:28,363 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (17), 7 states have call predecessors, (17), 12 states have call successors, (17) [2023-04-01 00:01:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:28,534 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2023-04-01 00:01:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 00:01:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (17), 7 states have call predecessors, (17), 12 states have call successors, (17) Word has length 61 [2023-04-01 00:01:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:28,540 INFO L225 Difference]: With dead ends: 129 [2023-04-01 00:01:28,540 INFO L226 Difference]: Without dead ends: 111 [2023-04-01 00:01:28,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 112 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2023-04-01 00:01:28,541 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:28,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 119 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-04-01 00:01:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2023-04-01 00:01:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 28 states have call successors, (28), 14 states have call predecessors, (28), 20 states have return successors, (63), 35 states have call predecessors, (63), 27 states have call successors, (63) [2023-04-01 00:01:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2023-04-01 00:01:28,566 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 61 [2023-04-01 00:01:28,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:28,566 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2023-04-01 00:01:28,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (17), 7 states have call predecessors, (17), 12 states have call successors, (17) [2023-04-01 00:01:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2023-04-01 00:01:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-04-01 00:01:28,569 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:28,569 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:28,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:28,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:28,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:28,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash 92646097, now seen corresponding path program 4 times [2023-04-01 00:01:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115409113] [2023-04-01 00:01:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 48 proven. 125 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2023-04-01 00:01:28,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:28,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115409113] [2023-04-01 00:01:28,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115409113] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:28,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611099229] [2023-04-01 00:01:28,940 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:01:28,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:28,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:28,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:28,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 00:01:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:29,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:01:29,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 48 proven. 125 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2023-04-01 00:01:29,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 48 proven. 135 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2023-04-01 00:01:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611099229] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:29,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [574250493] [2023-04-01 00:01:29,689 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-01 00:01:29,689 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:29,689 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:29,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:29,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 17 [2023-04-01 00:01:29,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038792246] [2023-04-01 00:01:29,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:29,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 00:01:29,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:29,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 00:01:29,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:01:29,692 INFO L87 Difference]: Start difference. First operand 100 states and 146 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 11 states have call successors, (16) [2023-04-01 00:01:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:29,871 INFO L93 Difference]: Finished difference Result 113 states and 167 transitions. [2023-04-01 00:01:29,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 00:01:29,872 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 11 states have call successors, (16) Word has length 95 [2023-04-01 00:01:29,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:29,873 INFO L225 Difference]: With dead ends: 113 [2023-04-01 00:01:29,873 INFO L226 Difference]: Without dead ends: 90 [2023-04-01 00:01:29,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-04-01 00:01:29,874 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:29,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-04-01 00:01:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-04-01 00:01:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 22 states have call successors, (22), 12 states have call predecessors, (22), 14 states have return successors, (41), 25 states have call predecessors, (41), 21 states have call successors, (41) [2023-04-01 00:01:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2023-04-01 00:01:29,886 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 95 [2023-04-01 00:01:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:29,886 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2023-04-01 00:01:29,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 11 states have call successors, (16) [2023-04-01 00:01:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2023-04-01 00:01:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-04-01 00:01:29,887 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:29,887 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:29,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-04-01 00:01:30,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:30,094 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:30,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1931269543, now seen corresponding path program 5 times [2023-04-01 00:01:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:30,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088853695] [2023-04-01 00:01:30,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:30,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 34 proven. 161 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2023-04-01 00:01:30,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:30,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088853695] [2023-04-01 00:01:30,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088853695] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:30,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080621792] [2023-04-01 00:01:30,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:30,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:30,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:30,973 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:31,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 00:01:31,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-04-01 00:01:31,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:31,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 91 conjunts are in the unsatisfiable core [2023-04-01 00:01:31,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2023-04-01 00:01:31,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 00:01:33,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080621792] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:33,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1579712884] [2023-04-01 00:01:33,298 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-01 00:01:33,298 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:33,298 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:33,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:33,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 32] total 51 [2023-04-01 00:01:33,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890906034] [2023-04-01 00:01:33,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:33,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-04-01 00:01:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:33,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-04-01 00:01:33,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2365, Unknown=0, NotChecked=0, Total=2550 [2023-04-01 00:01:33,302 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 51 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 38 states have internal predecessors, (69), 16 states have call successors, (29), 12 states have call predecessors, (29), 25 states have return successors, (34), 25 states have call predecessors, (34), 16 states have call successors, (34) [2023-04-01 00:01:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:38,624 INFO L93 Difference]: Finished difference Result 341 states and 595 transitions. [2023-04-01 00:01:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-04-01 00:01:38,637 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 38 states have internal predecessors, (69), 16 states have call successors, (29), 12 states have call predecessors, (29), 25 states have return successors, (34), 25 states have call predecessors, (34), 16 states have call successors, (34) Word has length 101 [2023-04-01 00:01:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:38,641 INFO L225 Difference]: With dead ends: 341 [2023-04-01 00:01:38,641 INFO L226 Difference]: Without dead ends: 337 [2023-04-01 00:01:38,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 187 SyntacticMatches, 14 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3872 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1893, Invalid=12149, Unknown=0, NotChecked=0, Total=14042 [2023-04-01 00:01:38,648 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 511 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 945 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 945 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:38,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 345 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [945 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-04-01 00:01:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-04-01 00:01:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 245. [2023-04-01 00:01:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 123 states have (on average 1.089430894308943) internal successors, (134), 118 states have internal predecessors, (134), 70 states have call successors, (70), 33 states have call predecessors, (70), 51 states have return successors, (209), 93 states have call predecessors, (209), 69 states have call successors, (209) [2023-04-01 00:01:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 413 transitions. [2023-04-01 00:01:38,726 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 413 transitions. Word has length 101 [2023-04-01 00:01:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:38,726 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 413 transitions. [2023-04-01 00:01:38,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 38 states have internal predecessors, (69), 16 states have call successors, (29), 12 states have call predecessors, (29), 25 states have return successors, (34), 25 states have call predecessors, (34), 16 states have call successors, (34) [2023-04-01 00:01:38,726 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 413 transitions. [2023-04-01 00:01:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-04-01 00:01:38,729 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:38,729 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:38,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:38,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:38,938 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:38,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash 422544529, now seen corresponding path program 6 times [2023-04-01 00:01:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16718232] [2023-04-01 00:01:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 48 proven. 148 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-04-01 00:01:39,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16718232] [2023-04-01 00:01:39,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16718232] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426987873] [2023-04-01 00:01:39,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:39,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:39,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:39,177 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:39,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 00:01:39,294 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:39,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:39,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 00:01:39,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 48 proven. 138 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-04-01 00:01:39,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 48 proven. 156 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-04-01 00:01:40,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426987873] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:40,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [792333337] [2023-04-01 00:01:40,178 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-01 00:01:40,178 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:40,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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:40,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:40,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 23 [2023-04-01 00:01:40,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443553262] [2023-04-01 00:01:40,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:40,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 00:01:40,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:40,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 00:01:40,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-04-01 00:01:40,181 INFO L87 Difference]: Start difference. First operand 245 states and 413 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 9 states have call predecessors, (22), 15 states have call successors, (22) [2023-04-01 00:01:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:40,445 INFO L93 Difference]: Finished difference Result 370 states and 698 transitions. [2023-04-01 00:01:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 00:01:40,446 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 9 states have call predecessors, (22), 15 states have call successors, (22) Word has length 107 [2023-04-01 00:01:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:40,451 INFO L225 Difference]: With dead ends: 370 [2023-04-01 00:01:40,452 INFO L226 Difference]: Without dead ends: 349 [2023-04-01 00:01:40,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 202 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2023-04-01 00:01:40,456 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:40,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 187 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-04-01 00:01:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 329. [2023-04-01 00:01:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 154 states have (on average 1.0974025974025974) internal successors, (169), 149 states have internal predecessors, (169), 106 states have call successors, (106), 41 states have call predecessors, (106), 68 states have return successors, (358), 138 states have call predecessors, (358), 105 states have call successors, (358) [2023-04-01 00:01:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 633 transitions. [2023-04-01 00:01:40,516 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 633 transitions. Word has length 107 [2023-04-01 00:01:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:40,516 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 633 transitions. [2023-04-01 00:01:40,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 9 states have call predecessors, (22), 15 states have call successors, (22) [2023-04-01 00:01:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 633 transitions. [2023-04-01 00:01:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-04-01 00:01:40,520 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:40,520 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 10, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:40,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:40,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-04-01 00:01:40,727 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:40,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash 432147001, now seen corresponding path program 7 times [2023-04-01 00:01:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:40,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364684900] [2023-04-01 00:01:40,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 103 proven. 231 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2023-04-01 00:01:40,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:40,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364684900] [2023-04-01 00:01:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364684900] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820328397] [2023-04-01 00:01:40,866 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:01:40,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:40,881 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:40,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 00:01:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:41,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 00:01:41,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 430 proven. 88 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-04-01 00:01:41,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 103 proven. 236 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2023-04-01 00:01:41,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820328397] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:41,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913173676] [2023-04-01 00:01:41,830 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-01 00:01:41,830 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:41,831 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:41,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:41,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2023-04-01 00:01:41,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843886175] [2023-04-01 00:01:41,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:41,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 00:01:41,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:41,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 00:01:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-04-01 00:01:41,833 INFO L87 Difference]: Start difference. First operand 329 states and 633 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (23), 6 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-01 00:01:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:42,034 INFO L93 Difference]: Finished difference Result 512 states and 1057 transitions. [2023-04-01 00:01:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 00:01:42,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (23), 6 states have call predecessors, (23), 11 states have call successors, (23) Word has length 121 [2023-04-01 00:01:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:42,038 INFO L225 Difference]: With dead ends: 512 [2023-04-01 00:01:42,038 INFO L226 Difference]: Without dead ends: 285 [2023-04-01 00:01:42,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 235 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2023-04-01 00:01:42,040 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:42,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 169 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-04-01 00:01:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2023-04-01 00:01:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 127 states have (on average 1.0866141732283465) internal successors, (138), 125 states have internal predecessors, (138), 81 states have call successors, (81), 34 states have call predecessors, (81), 55 states have return successors, (254), 104 states have call predecessors, (254), 80 states have call successors, (254) [2023-04-01 00:01:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 473 transitions. [2023-04-01 00:01:42,075 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 473 transitions. Word has length 121 [2023-04-01 00:01:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:42,076 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 473 transitions. [2023-04-01 00:01:42,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (23), 6 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-01 00:01:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 473 transitions. [2023-04-01 00:01:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-04-01 00:01:42,081 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:42,081 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 10, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:42,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-04-01 00:01:42,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 00:01:42,287 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:42,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1106151801, now seen corresponding path program 8 times [2023-04-01 00:01:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:42,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554440143] [2023-04-01 00:01:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 121 proven. 213 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2023-04-01 00:01:42,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:42,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554440143] [2023-04-01 00:01:42,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554440143] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:42,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875847666] [2023-04-01 00:01:42,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:42,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:42,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:42,557 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:42,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 00:01:42,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-04-01 00:01:42,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:42,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-01 00:01:42,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 63 proven. 185 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2023-04-01 00:01:42,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 63 proven. 198 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2023-04-01 00:01:43,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875847666] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:43,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2433463] [2023-04-01 00:01:43,483 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-01 00:01:43,483 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:43,484 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:43,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:43,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 17] total 27 [2023-04-01 00:01:43,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828411277] [2023-04-01 00:01:43,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:43,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 00:01:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:43,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 00:01:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2023-04-01 00:01:43,486 INFO L87 Difference]: Start difference. First operand 264 states and 473 transitions. Second operand has 27 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 20 states have call successors, (27), 1 states have call predecessors, (27), 14 states have return successors, (33), 13 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-01 00:01:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:44,050 INFO L93 Difference]: Finished difference Result 474 states and 904 transitions. [2023-04-01 00:01:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-01 00:01:44,050 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 20 states have call successors, (27), 1 states have call predecessors, (27), 14 states have return successors, (33), 13 states have call predecessors, (33), 20 states have call successors, (33) Word has length 121 [2023-04-01 00:01:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:44,076 INFO L225 Difference]: With dead ends: 474 [2023-04-01 00:01:44,077 INFO L226 Difference]: Without dead ends: 255 [2023-04-01 00:01:44,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1637, Unknown=0, NotChecked=0, Total=1980 [2023-04-01 00:01:44,079 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:44,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 284 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 00:01:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-04-01 00:01:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 224. [2023-04-01 00:01:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 113 states have (on average 1.0530973451327434) internal successors, (119), 112 states have internal predecessors, (119), 69 states have call successors, (69), 34 states have call predecessors, (69), 41 states have return successors, (152), 77 states have call predecessors, (152), 68 states have call successors, (152) [2023-04-01 00:01:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 340 transitions. [2023-04-01 00:01:44,123 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 340 transitions. Word has length 121 [2023-04-01 00:01:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:44,123 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 340 transitions. [2023-04-01 00:01:44,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 20 states have call successors, (27), 1 states have call predecessors, (27), 14 states have return successors, (33), 13 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-01 00:01:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 340 transitions. [2023-04-01 00:01:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-04-01 00:01:44,127 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:44,127 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 16, 15, 15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:44,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:44,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-01 00:01:44,340 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:44,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash 925222033, now seen corresponding path program 9 times [2023-04-01 00:01:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:44,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197828565] [2023-04-01 00:01:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2100 backedges. 74 proven. 705 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2023-04-01 00:01:46,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197828565] [2023-04-01 00:01:46,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197828565] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943789412] [2023-04-01 00:01:46,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:46,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:46,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:46,075 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:46,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 00:01:46,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:46,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:46,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 175 conjunts are in the unsatisfiable core [2023-04-01 00:01:46,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2100 backedges. 0 proven. 705 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2023-04-01 00:01:46,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2100 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-04-01 00:01:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943789412] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1303593897] [2023-04-01 00:01:50,869 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-01 00:01:50,869 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:50,869 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:50,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:50,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 58] total 83 [2023-04-01 00:01:50,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235967122] [2023-04-01 00:01:50,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:50,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2023-04-01 00:01:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2023-04-01 00:01:50,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=6505, Unknown=0, NotChecked=0, Total=6806 [2023-04-01 00:01:50,874 INFO L87 Difference]: Start difference. First operand 224 states and 340 transitions. Second operand has 83 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 62 states have internal predecessors, (108), 29 states have call successors, (46), 20 states have call predecessors, (46), 41 states have return successors, (55), 42 states have call predecessors, (55), 29 states have call successors, (55)