./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:21:44,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:21:44,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:21:44,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:21:44,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:21:44,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:21:44,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:21:44,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:21:44,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:21:44,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:21:44,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:21:44,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:21:44,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:21:44,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:21:44,756 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:21:44,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:21:44,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:21:44,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:21:44,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:21:44,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:21:44,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:21:44,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:21:44,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:21:44,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:21:44,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:21:44,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:21:44,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:21:44,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:21:44,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:21:44,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:21:44,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:21:44,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:21:44,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:21:44,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:21:44,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:21:44,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:21:44,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:21:44,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:21:44,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:21:44,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:21:44,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:21:44,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:21:44,765 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f [2024-11-09 23:21:44,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:21:44,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:21:44,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:21:44,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:21:44,977 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:21:44,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c [2024-11-09 23:21:46,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:21:46,313 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:21:46,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c [2024-11-09 23:21:46,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0799b204/00551d604cfe4a589bd2ed06d12abbf0/FLAG7931031a1 [2024-11-09 23:21:46,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0799b204/00551d604cfe4a589bd2ed06d12abbf0 [2024-11-09 23:21:46,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:21:46,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:21:46,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:21:46,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:21:46,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:21:46,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:46,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c545b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46, skipping insertion in model container [2024-11-09 23:21:46,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:46,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:21:46,916 WARN L250 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-simple/fibo_2calls_4-2.c[946,959] [2024-11-09 23:21:46,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:21:46,936 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:21:46,950 WARN L250 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-simple/fibo_2calls_4-2.c[946,959] [2024-11-09 23:21:46,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:21:46,965 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:21:46,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46 WrapperNode [2024-11-09 23:21:46,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:21:46,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:21:46,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:21:46,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:21:46,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:46,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:46,993 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-09 23:21:46,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:21:46,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:21:46,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:21:46,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:21:47,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,021 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 23:21:47,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:21:47,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:21:47,028 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:21:47,028 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:21:47,029 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (1/1) ... [2024-11-09 23:21:47,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:21:47,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:21:47,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:21:47,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:21:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:21:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:21:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-09 23:21:47,095 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-09 23:21:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-09 23:21:47,095 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-09 23:21:47,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:21:47,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:21:47,160 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:21:47,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:21:47,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2024-11-09 23:21:47,272 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2024-11-09 23:21:47,286 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 23:21:47,286 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:21:47,299 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:21:47,299 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:21:47,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:21:47 BoogieIcfgContainer [2024-11-09 23:21:47,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:21:47,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:21:47,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:21:47,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:21:47,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:21:46" (1/3) ... [2024-11-09 23:21:47,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c364728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:21:47, skipping insertion in model container [2024-11-09 23:21:47,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:21:46" (2/3) ... [2024-11-09 23:21:47,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c364728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:21:47, skipping insertion in model container [2024-11-09 23:21:47,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:21:47" (3/3) ... [2024-11-09 23:21:47,310 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2024-11-09 23:21:47,329 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:21:47,329 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:21:47,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:21:47,389 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@635632f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:21:47,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:21:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 23:21:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 23:21:47,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:47,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:21:47,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:47,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:47,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1889766502, now seen corresponding path program 1 times [2024-11-09 23:21:47,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:47,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197197461] [2024-11-09 23:21:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:47,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:47,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:21:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:21:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:21:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197197461] [2024-11-09 23:21:47,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197197461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:21:47,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:21:47,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:21:47,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217646617] [2024-11-09 23:21:47,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:21:47,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:21:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:21:47,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:21:47,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:21:47,714 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:21:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:21:47,752 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-09 23:21:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:21:47,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 23:21:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:21:47,761 INFO L225 Difference]: With dead ends: 42 [2024-11-09 23:21:47,761 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 23:21:47,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:21:47,767 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:21:47,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:21:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 23:21:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 23:21:47,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 23:21:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-09 23:21:47,801 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2024-11-09 23:21:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:21:47,801 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 23:21:47,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:21:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-09 23:21:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 23:21:47,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:47,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:21:47,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:21:47,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:47,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1119543594, now seen corresponding path program 1 times [2024-11-09 23:21:47,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:47,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557775529] [2024-11-09 23:21:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:47,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:21:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:21:47,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:21:47,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557775529] [2024-11-09 23:21:47,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557775529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:21:47,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:21:47,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:21:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622755413] [2024-11-09 23:21:47,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:21:47,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:21:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:21:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:21:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:21:47,896 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:21:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:21:47,919 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-09 23:21:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:21:47,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 23:21:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:21:47,921 INFO L225 Difference]: With dead ends: 35 [2024-11-09 23:21:47,921 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 23:21:47,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:21:47,923 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:21:47,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:21:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 23:21:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-09 23:21:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 23:21:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-09 23:21:47,929 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 12 [2024-11-09 23:21:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:21:47,930 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 23:21:47,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:21:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-09 23:21:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 23:21:47,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:47,931 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:21:47,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:21:47,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:47,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2127390698, now seen corresponding path program 1 times [2024-11-09 23:21:47,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:47,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681233685] [2024-11-09 23:21:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:47,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:21:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:48,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 23:21:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:21:48,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:21:48,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681233685] [2024-11-09 23:21:48,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681233685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:21:48,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746318349] [2024-11-09 23:21:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:48,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:48,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:21:48,100 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) [2024-11-09 23:21:48,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:21:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:48,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:21:48,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:21:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:21:48,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:21:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:21:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746318349] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:21:48,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:21:48,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-09 23:21:48,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112726840] [2024-11-09 23:21:48,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:21:48,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:21:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:21:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:21:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:21:48,499 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 10 states have (on average 3.3) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 23:21:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:21:48,647 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-11-09 23:21:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:21:48,648 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 24 [2024-11-09 23:21:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:21:48,648 INFO L225 Difference]: With dead ends: 57 [2024-11-09 23:21:48,649 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 23:21:48,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:21:48,650 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:21:48,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 136 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:21:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 23:21:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-09 23:21:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 23:21:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-09 23:21:48,656 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 24 [2024-11-09 23:21:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:21:48,656 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-09 23:21:48,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 23:21:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-09 23:21:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 23:21:48,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:48,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:21:48,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 23:21:48,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:48,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:48,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2059978289, now seen corresponding path program 1 times [2024-11-09 23:21:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:48,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7438136] [2024-11-09 23:21:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:48,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:21:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:21:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:21:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:21:49,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7438136] [2024-11-09 23:21:49,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7438136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:21:49,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138861691] [2024-11-09 23:21:49,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:49,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:49,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:21:49,020 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) [2024-11-09 23:21:49,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:21:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:21:49,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:21:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:21:49,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:21:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:21:49,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138861691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:21:49,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:21:49,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-11-09 23:21:49,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785622798] [2024-11-09 23:21:49,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:21:49,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:21:49,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:21:49,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:21:49,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:21:49,279 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 23:21:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:21:49,429 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2024-11-09 23:21:49,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:21:49,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 25 [2024-11-09 23:21:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:21:49,432 INFO L225 Difference]: With dead ends: 55 [2024-11-09 23:21:49,432 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 23:21:49,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:21:49,433 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:21:49,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 121 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:21:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 23:21:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-11-09 23:21:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-09 23:21:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-11-09 23:21:49,451 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 25 [2024-11-09 23:21:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:21:49,453 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-11-09 23:21:49,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 23:21:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-11-09 23:21:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 23:21:49,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:49,455 INFO L215 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, 1, 1] [2024-11-09 23:21:49,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:21:49,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 23:21:49,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:49,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:49,657 INFO L85 PathProgramCache]: Analyzing trace with hash -747014037, now seen corresponding path program 1 times [2024-11-09 23:21:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:49,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996293648] [2024-11-09 23:21:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:21:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 23:21:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 23:21:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 23:21:49,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:21:49,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996293648] [2024-11-09 23:21:49,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996293648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:21:49,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067474134] [2024-11-09 23:21:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:49,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:49,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:21:49,772 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) [2024-11-09 23:21:49,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:21:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:49,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:21:49,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:21:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:21:49,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:21:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:21:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067474134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:21:50,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:21:50,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-11-09 23:21:50,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149431923] [2024-11-09 23:21:50,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:21:50,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 23:21:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:21:50,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 23:21:50,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:21:50,155 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 23:21:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:21:50,328 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2024-11-09 23:21:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:21:50,328 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2024-11-09 23:21:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:21:50,330 INFO L225 Difference]: With dead ends: 111 [2024-11-09 23:21:50,330 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 23:21:50,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:21:50,331 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:21:50,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 153 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:21:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 23:21:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-09 23:21:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2024-11-09 23:21:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-11-09 23:21:50,341 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 37 [2024-11-09 23:21:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:21:50,341 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-11-09 23:21:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 23:21:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-09 23:21:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 23:21:50,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:50,343 INFO L215 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, 1, 1, 1] [2024-11-09 23:21:50,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:21:50,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:50,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:50,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash 335870733, now seen corresponding path program 1 times [2024-11-09 23:21:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345861198] [2024-11-09 23:21:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:50,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:21:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:21:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:50,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:21:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:21:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:21:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345861198] [2024-11-09 23:21:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345861198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:21:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890801618] [2024-11-09 23:21:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:50,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:50,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:21:50,690 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) [2024-11-09 23:21:50,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:21:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:50,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:21:50,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:21:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 23:21:50,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:21:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:21:51,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890801618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:21:51,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:21:51,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2024-11-09 23:21:51,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638809304] [2024-11-09 23:21:51,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:21:51,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 23:21:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:21:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 23:21:51,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:21:51,052 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-09 23:21:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:21:51,329 INFO L93 Difference]: Finished difference Result 181 states and 327 transitions. [2024-11-09 23:21:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 23:21:51,330 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) Word has length 38 [2024-11-09 23:21:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:21:51,332 INFO L225 Difference]: With dead ends: 181 [2024-11-09 23:21:51,332 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 23:21:51,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:21:51,338 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:21:51,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 317 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:21:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 23:21:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2024-11-09 23:21:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 68 states have internal predecessors, (79), 21 states have call successors, (21), 7 states have call predecessors, (21), 14 states have return successors, (63), 25 states have call predecessors, (63), 21 states have call successors, (63) [2024-11-09 23:21:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2024-11-09 23:21:51,364 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 38 [2024-11-09 23:21:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:21:51,364 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2024-11-09 23:21:51,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-09 23:21:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2024-11-09 23:21:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:21:51,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:51,367 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:21:51,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 23:21:51,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:51,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:51,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash -37020151, now seen corresponding path program 1 times [2024-11-09 23:21:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:51,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646426291] [2024-11-09 23:21:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:51,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:21:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:51,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:51,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:21:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:51,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:21:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:51,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:21:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:21:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:21:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646426291] [2024-11-09 23:21:51,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646426291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:21:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546372987] [2024-11-09 23:21:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:51,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:51,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:21:51,746 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) [2024-11-09 23:21:51,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:21:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:51,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:21:51,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:21:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 23:21:51,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:21:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:21:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546372987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:21:52,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:21:52,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-11-09 23:21:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541982959] [2024-11-09 23:21:52,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:21:52,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 23:21:52,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:21:52,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 23:21:52,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:21:52,093 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-09 23:21:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:21:52,305 INFO L93 Difference]: Finished difference Result 264 states and 512 transitions. [2024-11-09 23:21:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 23:21:52,305 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) Word has length 52 [2024-11-09 23:21:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:21:52,308 INFO L225 Difference]: With dead ends: 264 [2024-11-09 23:21:52,308 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 23:21:52,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:21:52,313 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:21:52,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 232 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:21:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 23:21:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 140. [2024-11-09 23:21:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 90 states have (on average 1.2) internal successors, (108), 92 states have internal predecessors, (108), 31 states have call successors, (31), 10 states have call predecessors, (31), 18 states have return successors, (103), 37 states have call predecessors, (103), 31 states have call successors, (103) [2024-11-09 23:21:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 242 transitions. [2024-11-09 23:21:52,335 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 242 transitions. Word has length 52 [2024-11-09 23:21:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:21:52,335 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 242 transitions. [2024-11-09 23:21:52,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-09 23:21:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 242 transitions. [2024-11-09 23:21:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 23:21:52,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:52,338 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:21:52,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:21:52,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:52,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:52,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2037631825, now seen corresponding path program 1 times [2024-11-09 23:21:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:52,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164739282] [2024-11-09 23:21:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:21:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:21:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:21:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:21:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 23:21:52,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:21:52,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164739282] [2024-11-09 23:21:52,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164739282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:21:52,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554871955] [2024-11-09 23:21:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:52,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:52,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:21:52,714 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) [2024-11-09 23:21:52,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 23:21:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:52,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:21:52,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:21:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 23:21:52,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:21:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 23:21:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554871955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:21:52,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:21:52,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2024-11-09 23:21:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912400057] [2024-11-09 23:21:52,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:21:52,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 23:21:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:21:52,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 23:21:52,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:21:52,973 INFO L87 Difference]: Start difference. First operand 140 states and 242 transitions. Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 23:21:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:21:53,215 INFO L93 Difference]: Finished difference Result 346 states and 699 transitions. [2024-11-09 23:21:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 23:21:53,216 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Word has length 53 [2024-11-09 23:21:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:21:53,217 INFO L225 Difference]: With dead ends: 346 [2024-11-09 23:21:53,218 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 23:21:53,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-09 23:21:53,220 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:21:53,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 215 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:21:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 23:21:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2024-11-09 23:21:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 63 states have internal predecessors, (73), 20 states have call successors, (20), 7 states have call predecessors, (20), 12 states have return successors, (64), 24 states have call predecessors, (64), 20 states have call successors, (64) [2024-11-09 23:21:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 157 transitions. [2024-11-09 23:21:53,239 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 157 transitions. Word has length 53 [2024-11-09 23:21:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:21:53,239 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 157 transitions. [2024-11-09 23:21:53,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 23:21:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 157 transitions. [2024-11-09 23:21:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:21:53,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:53,244 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:21:53,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 23:21:53,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:53,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:53,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1783948659, now seen corresponding path program 2 times [2024-11-09 23:21:53,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:53,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796540957] [2024-11-09 23:21:53,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:21:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:21:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:21:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:21:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:21:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:21:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:21:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:21:53,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:21:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796540957] [2024-11-09 23:21:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796540957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:21:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903306203] [2024-11-09 23:21:53,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:21:53,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:53,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:21:53,646 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) [2024-11-09 23:21:53,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 23:21:53,689 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:21:53,689 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:21:53,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:21:53,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:21:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 23:21:53,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:21:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-09 23:21:54,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903306203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:21:54,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:21:54,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 22 [2024-11-09 23:21:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505123275] [2024-11-09 23:21:54,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:21:54,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 23:21:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:21:54,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 23:21:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-09 23:21:54,033 INFO L87 Difference]: Start difference. First operand 95 states and 157 transitions. Second operand has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-09 23:21:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:21:54,369 INFO L93 Difference]: Finished difference Result 191 states and 338 transitions. [2024-11-09 23:21:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 23:21:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) Word has length 67 [2024-11-09 23:21:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:21:54,370 INFO L225 Difference]: With dead ends: 191 [2024-11-09 23:21:54,370 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 23:21:54,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:21:54,372 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:21:54,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 323 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:21:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 23:21:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2024-11-09 23:21:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 53 states have internal predecessors, (62), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31) [2024-11-09 23:21:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2024-11-09 23:21:54,378 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 105 transitions. Word has length 67 [2024-11-09 23:21:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:21:54,379 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 105 transitions. [2024-11-09 23:21:54,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-09 23:21:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 105 transitions. [2024-11-09 23:21:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:21:54,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:21:54,380 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:21:54,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 23:21:54,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:21:54,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:21:54,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:21:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1622777541, now seen corresponding path program 1 times [2024-11-09 23:21:54,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:21:54,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375265565] [2024-11-09 23:21:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:21:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:21:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:21:54,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:21:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:21:54,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:21:54,610 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:21:54,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:21:54,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:21:54,614 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:21:54,633 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:21:54,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:21:54 BoogieIcfgContainer [2024-11-09 23:21:54,636 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:21:54,636 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:21:54,636 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:21:54,637 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:21:54,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:21:47" (3/4) ... [2024-11-09 23:21:54,641 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:21:54,687 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:21:54,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:21:54,687 INFO L158 Benchmark]: Toolchain (without parser) took 7959.50ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 71.5MB in the beginning and 103.9MB in the end (delta: -32.4MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-11-09 23:21:54,688 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 142.6MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:21:54,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.78ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 59.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 23:21:54,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.04ms. Allocated memory is still 142.6MB. Free memory was 58.9MB in the beginning and 57.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:21:54,688 INFO L158 Benchmark]: Boogie Preprocessor took 32.39ms. Allocated memory is still 142.6MB. Free memory was 57.6MB in the beginning and 56.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:21:54,688 INFO L158 Benchmark]: IcfgBuilder took 272.01ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 56.0MB in the beginning and 167.3MB in the end (delta: -111.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-09 23:21:54,688 INFO L158 Benchmark]: TraceAbstraction took 7334.49ms. Allocated memory is still 201.3MB. Free memory was 166.2MB in the beginning and 106.0MB in the end (delta: 60.2MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2024-11-09 23:21:54,688 INFO L158 Benchmark]: Witness Printer took 50.83ms. Allocated memory is still 201.3MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:21:54,689 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 142.6MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.78ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 59.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.04ms. Allocated memory is still 142.6MB. Free memory was 58.9MB in the beginning and 57.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.39ms. Allocated memory is still 142.6MB. Free memory was 57.6MB in the beginning and 56.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 272.01ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 56.0MB in the beginning and 167.3MB in the end (delta: -111.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7334.49ms. Allocated memory is still 201.3MB. Free memory was 166.2MB in the beginning and 106.0MB in the end (delta: 60.2MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Witness Printer took 50.83ms. Allocated memory is still 201.3MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 4; VAL [x=4] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=4] [L39] int result = fibo1(x); [L40] COND TRUE result == 3 VAL [x=4] [L41] reach_error() VAL [x=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 1754 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1490 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1990 IncrementalHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 264 mSDtfsCounter, 1990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 782 GetRequests, 621 SyntacticMatches, 22 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=7, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 85 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 681 NumberOfCodeBlocks, 681 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 888 ConstructedInterpolants, 0 QuantifiedInterpolants, 1884 SizeOfPredicates, 12 NumberOfNonLiveVariables, 787 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 494/648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 23:21:54,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE