./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_o20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/id_o20.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 78daae7f2fbb1fbd12685beb952877b8686cc8bc3d2c7fcd55d0c5d2b019aa0d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:59:34,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:59:34,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:59:34,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:59:34,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:59:34,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:59:34,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:59:34,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:59:34,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:59:34,218 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:59:34,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:59:34,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:59:34,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:59:34,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:59:34,222 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:59:34,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:59:34,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:59:34,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:59:34,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:59:34,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:59:34,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:59:34,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:59:34,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:59:34,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:59:34,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:59:34,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:59:34,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:59:34,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:59:34,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:59:34,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:59:34,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:59:34,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:59:34,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:59:34,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:59:34,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:59:34,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:59:34,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:59:34,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:59:34,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:59:34,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:59:34,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:59:34,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:59:34,230 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 -> 78daae7f2fbb1fbd12685beb952877b8686cc8bc3d2c7fcd55d0c5d2b019aa0d [2024-11-16 07:59:34,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:59:34,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:59:34,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:59:34,512 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:59:34,512 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:59:34,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_o20.c [2024-11-16 07:59:35,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:59:36,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:59:36,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o20.c [2024-11-16 07:59:36,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78504d1d8/6b33964613e841c1b8379bb144594c59/FLAG5996eb0ee [2024-11-16 07:59:36,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78504d1d8/6b33964613e841c1b8379bb144594c59 [2024-11-16 07:59:36,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:59:36,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:59:36,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:59:36,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:59:36,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:59:36,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b444aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36, skipping insertion in model container [2024-11-16 07:59:36,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:59:36,357 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/id_o20.c[516,529] [2024-11-16 07:59:36,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:59:36,374 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:59:36,388 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/id_o20.c[516,529] [2024-11-16 07:59:36,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:59:36,406 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:59:36,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36 WrapperNode [2024-11-16 07:59:36,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:59:36,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:59:36,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:59:36,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:59:36,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,436 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-16 07:59:36,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:59:36,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:59:36,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:59:36,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:59:36,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,455 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-16 07:59:36,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:59:36,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:59:36,462 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:59:36,462 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:59:36,463 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (1/1) ... [2024-11-16 07:59:36,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:59:36,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:59:36,493 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-16 07:59:36,495 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-16 07:59:36,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:59:36,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:59:36,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:59:36,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:59:36,537 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-16 07:59:36,537 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-16 07:59:36,591 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:59:36,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:59:36,701 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2024-11-16 07:59:36,708 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-16 07:59:36,708 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:59:36,724 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:59:36,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:59:36,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:59:36 BoogieIcfgContainer [2024-11-16 07:59:36,727 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:59:36,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:59:36,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:59:36,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:59:36,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:59:36" (1/3) ... [2024-11-16 07:59:36,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccd145d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:59:36, skipping insertion in model container [2024-11-16 07:59:36,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:59:36" (2/3) ... [2024-11-16 07:59:36,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccd145d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:59:36, skipping insertion in model container [2024-11-16 07:59:36,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:59:36" (3/3) ... [2024-11-16 07:59:36,739 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o20.c [2024-11-16 07:59:36,760 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:59:36,761 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:59:36,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:59:36,828 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;@1060a9ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:59:36,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:59:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:59:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 07:59:36,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:59:36,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:59:36,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:59:36,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:59:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1886413104, now seen corresponding path program 1 times [2024-11-16 07:59:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:59:36,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375355226] [2024-11-16 07:59:36,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:36,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:59:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:37,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:37,226 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-16 07:59:37,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:59:37,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375355226] [2024-11-16 07:59:37,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375355226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:59:37,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:59:37,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:59:37,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394881347] [2024-11-16 07:59:37,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:59:37,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:59:37,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:59:37,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:59:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:59:37,263 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 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-16 07:59:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:59:37,295 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-16 07:59:37,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:59:37,299 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-16 07:59:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:59:37,308 INFO L225 Difference]: With dead ends: 28 [2024-11-16 07:59:37,308 INFO L226 Difference]: Without dead ends: 16 [2024-11-16 07:59:37,312 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-16 07:59:37,316 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:59:37,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:59:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-16 07:59:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-16 07:59:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:59:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-16 07:59:37,347 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2024-11-16 07:59:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:59:37,347 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-16 07:59:37,347 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-16 07:59:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-16 07:59:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 07:59:37,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:59:37,349 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:59:37,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:59:37,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:59:37,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:59:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1799886983, now seen corresponding path program 1 times [2024-11-16 07:59:37,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:59:37,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822592610] [2024-11-16 07:59:37,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:59:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:37,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 07:59:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:59:37,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822592610] [2024-11-16 07:59:37,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822592610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:59:37,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768599905] [2024-11-16 07:59:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:37,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:59:37,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:59:37,673 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-16 07:59:37,677 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-16 07:59:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:37,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 07:59:37,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:59:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 07:59:37,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:59:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 07:59:37,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768599905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:59:37,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:59:37,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-16 07:59:37,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933580264] [2024-11-16 07:59:37,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:59:37,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 07:59:37,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:59:37,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 07:59:37,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:59:37,975 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 07:59:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:59:38,021 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-16 07:59:38,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 07:59:38,021 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 17 [2024-11-16 07:59:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:59:38,022 INFO L225 Difference]: With dead ends: 29 [2024-11-16 07:59:38,022 INFO L226 Difference]: Without dead ends: 22 [2024-11-16 07:59:38,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:59:38,024 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:59:38,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:59:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-16 07:59:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-16 07:59:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 07:59:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-16 07:59:38,034 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2024-11-16 07:59:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:59:38,034 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-16 07:59:38,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 07:59:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-16 07:59:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 07:59:38,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:59:38,036 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:59:38,051 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-16 07:59:38,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:59:38,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:59:38,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:59:38,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1892917223, now seen corresponding path program 2 times [2024-11-16 07:59:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:59:38,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489750999] [2024-11-16 07:59:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:38,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:59:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:38,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:38,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 07:59:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:59:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489750999] [2024-11-16 07:59:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489750999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:59:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086166335] [2024-11-16 07:59:38,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 07:59:38,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:59:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:59:38,627 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-16 07:59:38,629 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-16 07:59:38,678 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 07:59:38,678 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 07:59:38,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 07:59:38,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:59:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 07:59:38,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:59:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 07:59:39,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086166335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:59:39,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:59:39,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-16 07:59:39,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743443497] [2024-11-16 07:59:39,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:59:39,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 07:59:39,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:59:39,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 07:59:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-16 07:59:39,056 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 07:59:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:59:39,253 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-16 07:59:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 07:59:39,255 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 29 [2024-11-16 07:59:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:59:39,256 INFO L225 Difference]: With dead ends: 41 [2024-11-16 07:59:39,257 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 07:59:39,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-11-16 07:59:39,259 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:59:39,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:59:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 07:59:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-16 07:59:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 07:59:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-16 07:59:39,272 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2024-11-16 07:59:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:59:39,272 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-16 07:59:39,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 07:59:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-16 07:59:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 07:59:39,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:59:39,275 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:59:39,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 07:59:39,476 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,SelfDestructingSolverStorable2 [2024-11-16 07:59:39,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:59:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:59:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1254058329, now seen corresponding path program 3 times [2024-11-16 07:59:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:59:39,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721273221] [2024-11-16 07:59:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:59:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:39,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:39,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:40,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-16 07:59:40,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:59:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721273221] [2024-11-16 07:59:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721273221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:59:40,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981209074] [2024-11-16 07:59:40,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 07:59:40,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:59:40,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:59:40,202 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-16 07:59:40,203 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-16 07:59:40,268 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-16 07:59:40,269 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 07:59:40,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-16 07:59:40,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:59:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-16 07:59:40,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:59:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-16 07:59:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981209074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:59:41,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:59:41,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2024-11-16 07:59:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955547600] [2024-11-16 07:59:41,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:59:41,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-16 07:59:41,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:59:41,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-16 07:59:41,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 07:59:41,240 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 37 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 07:59:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:59:42,216 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2024-11-16 07:59:42,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-16 07:59:42,217 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 53 [2024-11-16 07:59:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:59:42,218 INFO L225 Difference]: With dead ends: 65 [2024-11-16 07:59:42,218 INFO L226 Difference]: Without dead ends: 58 [2024-11-16 07:59:42,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=386, Invalid=1966, Unknown=0, NotChecked=0, Total=2352 [2024-11-16 07:59:42,220 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:59:42,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:59:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-16 07:59:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-16 07:59:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 07:59:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2024-11-16 07:59:42,232 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2024-11-16 07:59:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:59:42,232 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2024-11-16 07:59:42,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 07:59:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2024-11-16 07:59:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 07:59:42,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:59:42,235 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:59:42,253 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-16 07:59:42,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:59:42,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:59:42,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:59:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1679434791, now seen corresponding path program 4 times [2024-11-16 07:59:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:59:42,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659044403] [2024-11-16 07:59:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:59:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:59:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:42,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:43,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:43,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:44,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:44,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:44,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:59:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:59:44,521 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-16 07:59:44,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:59:44,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659044403] [2024-11-16 07:59:44,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659044403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:59:44,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257485414] [2024-11-16 07:59:44,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-16 07:59:44,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:59:44,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:59:44,524 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-16 07:59:44,525 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-16 07:59:44,592 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-16 07:59:44,592 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 07:59:44,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-16 07:59:44,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:59:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-16 07:59:44,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:59:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-16 07:59:47,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257485414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:59:47,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:59:47,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2024-11-16 07:59:47,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946103503] [2024-11-16 07:59:47,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:59:47,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-11-16 07:59:47,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:59:47,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-11-16 07:59:47,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2024-11-16 07:59:47,048 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 69 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 37 states have internal predecessors, (76), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 08:00:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:00:07,933 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-11-16 08:00:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-16 08:00:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 37 states have internal predecessors, (76), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) Word has length 101 [2024-11-16 08:00:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:00:07,935 INFO L225 Difference]: With dead ends: 113 [2024-11-16 08:00:07,935 INFO L226 Difference]: Without dead ends: 106 [2024-11-16 08:00:07,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=1291, Invalid=8021, Unknown=0, NotChecked=0, Total=9312 [2024-11-16 08:00:07,940 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 08:00:07,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1455 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 08:00:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-16 08:00:07,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-16 08:00:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 72 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (34), 32 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-16 08:00:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2024-11-16 08:00:07,969 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 101 [2024-11-16 08:00:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:00:07,972 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2024-11-16 08:00:07,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 37 states have internal predecessors, (76), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 08:00:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2024-11-16 08:00:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 08:00:07,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:00:07,974 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:00:07,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 08:00:08,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:00:08,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:00:08,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:00:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -888650480, now seen corresponding path program 5 times [2024-11-16 08:00:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:00:08,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268584746] [2024-11-16 08:00:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:00:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:00:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:00:08,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 08:00:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:00:08,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 08:00:08,401 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 08:00:08,402 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 08:00:08,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 08:00:08,407 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1] [2024-11-16 08:00:08,458 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 08:00:08,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:00:08 BoogieIcfgContainer [2024-11-16 08:00:08,463 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 08:00:08,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 08:00:08,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 08:00:08,463 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 08:00:08,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:59:36" (3/4) ... [2024-11-16 08:00:08,465 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 08:00:08,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 08:00:08,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 08:00:08,518 INFO L158 Benchmark]: Toolchain (without parser) took 32380.02ms. Allocated memory was 146.8MB in the beginning and 234.9MB in the end (delta: 88.1MB). Free memory was 74.8MB in the beginning and 166.4MB in the end (delta: -91.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 08:00:08,519 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 08:00:08,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.10ms. Allocated memory is still 146.8MB. Free memory was 74.6MB in the beginning and 62.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 08:00:08,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.98ms. Allocated memory is still 146.8MB. Free memory was 62.6MB in the beginning and 61.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:00:08,519 INFO L158 Benchmark]: Boogie Preprocessor took 23.31ms. Allocated memory is still 146.8MB. Free memory was 61.3MB in the beginning and 59.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:00:08,520 INFO L158 Benchmark]: IcfgBuilder took 265.48ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 59.9MB in the beginning and 164.9MB in the end (delta: -105.0MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-16 08:00:08,520 INFO L158 Benchmark]: TraceAbstraction took 31733.40ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 163.8MB in the beginning and 169.5MB in the end (delta: -5.7MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. [2024-11-16 08:00:08,520 INFO L158 Benchmark]: Witness Printer took 54.81ms. Allocated memory is still 234.9MB. Free memory was 169.5MB in the beginning and 166.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 08:00:08,521 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.23ms. Allocated memory is still 146.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.10ms. Allocated memory is still 146.8MB. Free memory was 74.6MB in the beginning and 62.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.98ms. Allocated memory is still 146.8MB. Free memory was 62.6MB in the beginning and 61.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.31ms. Allocated memory is still 146.8MB. Free memory was 61.3MB in the beginning and 59.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 265.48ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 59.9MB in the beginning and 164.9MB in the end (delta: -105.0MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31733.40ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 163.8MB in the beginning and 169.5MB in the end (delta: -5.7MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. * Witness Printer took 54.81ms. Allocated memory is still 234.9MB. Free memory was 169.5MB in the beginning and 166.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] unsigned int input = __VERIFIER_nondet_uint(); [L13] CALL, EXPR id(input) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, x=20] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=20] [L13] unsigned int result = id(input); [L14] COND TRUE result == 20 VAL [input=20] [L15] reach_error() VAL [input=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.6s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 2288 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2162 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1050 IncrementalHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 126 mSDtfsCounter, 1050 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 575 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=5, InterpolantAutomatonStates: 137, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 598 ConstructedInterpolants, 0 QuantifiedInterpolants, 1632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 1317/2634 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-16 08:00:08,558 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