./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o20.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a046e57d
Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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.dk.eval-mul-div-a046e57-m
[2024-10-12 19:46:45,136 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-12 19:46:45,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-12 19:46:45,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-12 19:46:45,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-12 19:46:45,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-12 19:46:45,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-12 19:46:45,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-12 19:46:45,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-12 19:46:45,246 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-10-12 19:46:45,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-12 19:46:45,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-12 19:46:45,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-12 19:46:45,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-12 19:46:45,250 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-12 19:46:45,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-12 19:46:45,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-12 19:46:45,251 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-12 19:46:45,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-12 19:46:45,251 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-12 19:46:45,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-12 19:46:45,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-12 19:46:45,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-12 19:46:45,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-12 19:46:45,256 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-12 19:46:45,256 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-12 19:46:45,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-12 19:46:45,257 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-12 19:46:45,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-12 19:46:45,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-12 19:46:45,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-12 19:46:45,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-12 19:46:45,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-12 19:46:45,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-12 19:46:45,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-12 19:46:45,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-12 19:46:45,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-12 19:46:45,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-12 19:46:45,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-12 19:46:45,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-12 19:46:45,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-12 19:46:45,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-12 19:46:45,262 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-10-12 19:46:45,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-12 19:46:45,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-12 19:46:45,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-12 19:46:45,513 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-12 19:46:45,514 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-12 19:46:45,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o20.c
[2024-10-12 19:46:46,974 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-12 19:46:47,153 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-12 19:46:47,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o20.c
[2024-10-12 19:46:47,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aabe477c/01c7031e51b7451db33a356133ca049a/FLAGc75a08e43
[2024-10-12 19:46:47,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aabe477c/01c7031e51b7451db33a356133ca049a
[2024-10-12 19:46:47,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-12 19:46:47,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-12 19:46:47,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-12 19:46:47,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-12 19:46:47,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-12 19:46:47,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a990c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47, skipping insertion in model container
[2024-10-12 19:46:47,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,199 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-12 19:46:47,371 WARN L248 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-10-12 19:46:47,376 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-12 19:46:47,387 INFO L200 MainTranslator]: Completed pre-run
[2024-10-12 19:46:47,403 WARN L248 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-10-12 19:46:47,403 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-12 19:46:47,420 INFO L204 MainTranslator]: Completed translation
[2024-10-12 19:46:47,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47 WrapperNode
[2024-10-12 19:46:47,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-12 19:46:47,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-12 19:46:47,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-12 19:46:47,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-12 19:46:47,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,449 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19
[2024-10-12 19:46:47,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-12 19:46:47,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-12 19:46:47,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-12 19:46:47,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-12 19:46:47,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,470 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-10-12 19:46:47,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-12 19:46:47,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-12 19:46:47,481 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-12 19:46:47,481 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-12 19:46:47,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (1/1) ...
[2024-10-12 19:46:47,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-12 19:46:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-12 19:46:47,512 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-10-12 19:46:47,515 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-10-12 19:46:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-12 19:46:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-12 19:46:47,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-12 19:46:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-12 19:46:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure id
[2024-10-12 19:46:47,563 INFO L138 BoogieDeclarations]: Found implementation of procedure id
[2024-10-12 19:46:47,615 INFO L238 CfgBuilder]: Building ICFG
[2024-10-12 19:46:47,616 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-12 19:46:47,688 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live.
[2024-10-12 19:46:47,689 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-12 19:46:47,707 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-12 19:46:47,707 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-12 19:46:47,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:46:47 BoogieIcfgContainer
[2024-10-12 19:46:47,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-12 19:46:47,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-12 19:46:47,710 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-12 19:46:47,713 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-12 19:46:47,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:46:47" (1/3) ...
[2024-10-12 19:46:47,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79726326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:46:47, skipping insertion in model container
[2024-10-12 19:46:47,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:47" (2/3) ...
[2024-10-12 19:46:47,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79726326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:46:47, skipping insertion in model container
[2024-10-12 19:46:47,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:46:47" (3/3) ...
[2024-10-12 19:46:47,716 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o20.c
[2024-10-12 19:46:47,730 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-12 19:46:47,730 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-12 19:46:47,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-12 19:46:47,786 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;@5d970b50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-12 19:46:47,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-12 19:46:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-10-12 19:46:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2024-10-12 19:46:47,795 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-12 19:46:47,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 19:46:47,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 19:46:47,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 19:46:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times
[2024-10-12 19:46:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 19:46:47,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373730371]
[2024-10-12 19:46:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 19:46:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 19:46:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2024-10-12 19:46:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-12 19:46:48,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 19:46:48,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373730371]
[2024-10-12 19:46:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373730371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-12 19:46:48,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-12 19:46:48,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-12 19:46:48,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719560539]
[2024-10-12 19:46:48,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-12 19:46:48,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-12 19:46:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 19:46:48,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-12 19:46:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-12 19:46:48,280 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-12 19:46:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 19:46:48,335 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions.
[2024-10-12 19:46:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-12 19:46:48,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9
[2024-10-12 19:46:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 19:46:48,345 INFO L225 Difference]: With dead ends: 22
[2024-10-12 19:46:48,345 INFO L226 Difference]: Without dead ends: 14
[2024-10-12 19:46:48,348 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-10-12 19:46:48,351 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-12 19:46:48,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-12 19:46:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2024-10-12 19:46:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2024-10-12 19:46:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-10-12 19:46:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions.
[2024-10-12 19:46:48,383 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9
[2024-10-12 19:46:48,383 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-12 19:46:48,384 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions.
[2024-10-12 19:46:48,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-10-12 19:46:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions.
[2024-10-12 19:46:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2024-10-12 19:46:48,385 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-12 19:46:48,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 19:46:48,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-12 19:46:48,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 19:46:48,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 19:46:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times
[2024-10-12 19:46:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 19:46:48,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580732396]
[2024-10-12 19:46:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 19:46:48,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 19:46:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:48,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2024-10-12 19:46:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:48,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-10-12 19:46:48,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 19:46:48,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580732396]
[2024-10-12 19:46:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580732396] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-12 19:46:48,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686669109]
[2024-10-12 19:46:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 19:46:48,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-12 19:46:48,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-12 19:46:48,661 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-10-12 19:46:48,663 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-10-12 19:46:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:48,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-10-12 19:46:48,719 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-12 19:46:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-10-12 19:46:48,778 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-12 19:46:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-10-12 19:46:48,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686669109] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-12 19:46:48,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-12 19:46:48,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13
[2024-10-12 19:46:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433557806]
[2024-10-12 19:46:48,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-12 19:46:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-10-12 19:46:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 19:46:48,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-10-12 19:46:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2024-10-12 19:46:48,957 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 9 states have internal predecessors, (18), 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-10-12 19:46:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 19:46:49,020 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions.
[2024-10-12 19:46:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-10-12 19:46:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 9 states have internal predecessors, (18), 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 15
[2024-10-12 19:46:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 19:46:49,022 INFO L225 Difference]: With dead ends: 26
[2024-10-12 19:46:49,022 INFO L226 Difference]: Without dead ends: 20
[2024-10-12 19:46:49,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-10-12 19:46:49,024 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-12 19:46:49,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-12 19:46:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2024-10-12 19:46:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2024-10-12 19:46:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5)
[2024-10-12 19:46:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions.
[2024-10-12 19:46:49,031 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15
[2024-10-12 19:46:49,031 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-12 19:46:49,031 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions.
[2024-10-12 19:46:49,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 9 states have internal predecessors, (18), 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-10-12 19:46:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions.
[2024-10-12 19:46:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-10-12 19:46:49,033 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-12 19:46:49,033 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 19:46:49,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-10-12 19:46:49,234 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-10-12 19:46:49,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 19:46:49,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 19:46:49,235 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 2 times
[2024-10-12 19:46:49,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 19:46:49,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227706012]
[2024-10-12 19:46:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 19:46:49,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 19:46:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2024-10-12 19:46:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:49,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-10-12 19:46:49,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 19:46:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227706012]
[2024-10-12 19:46:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227706012] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-12 19:46:49,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919854378]
[2024-10-12 19:46:49,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-10-12 19:46:49,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-12 19:46:49,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-12 19:46:49,634 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-10-12 19:46:49,636 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-10-12 19:46:49,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-10-12 19:46:49,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-10-12 19:46:49,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjuncts are in the unsatisfiable core
[2024-10-12 19:46:49,700 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-12 19:46:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-10-12 19:46:49,766 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-12 19:46:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-10-12 19:46:50,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919854378] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-12 19:46:50,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-12 19:46:50,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21
[2024-10-12 19:46:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305538533]
[2024-10-12 19:46:50,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-12 19:46:50,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2024-10-12 19:46:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 19:46:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2024-10-12 19:46:50,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420
[2024-10-12 19:46:50,111 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 13 states have internal predecessors, (26), 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-10-12 19:46:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 19:46:50,314 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions.
[2024-10-12 19:46:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2024-10-12 19:46:50,315 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 13 states have internal predecessors, (26), 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 27
[2024-10-12 19:46:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 19:46:50,316 INFO L225 Difference]: With dead ends: 38
[2024-10-12 19:46:50,316 INFO L226 Difference]: Without dead ends: 32
[2024-10-12 19:46:50,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 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-10-12 19:46:50,318 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-12 19:46:50,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-12 19:46:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2024-10-12 19:46:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2024-10-12 19:46:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9)
[2024-10-12 19:46:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions.
[2024-10-12 19:46:50,326 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27
[2024-10-12 19:46:50,326 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-12 19:46:50,326 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions.
[2024-10-12 19:46:50,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 13 states have internal predecessors, (26), 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-10-12 19:46:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions.
[2024-10-12 19:46:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2024-10-12 19:46:50,328 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-12 19:46:50,328 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 19:46:50,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-10-12 19:46:50,532 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-10-12 19:46:50,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 19:46:50,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 19:46:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 3 times
[2024-10-12 19:46:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 19:46:50,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248952296]
[2024-10-12 19:46:50,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 19:46:50,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 19:46:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:50,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2024-10-12 19:46:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:50,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:51,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2024-10-12 19:46:51,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 19:46:51,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248952296]
[2024-10-12 19:46:51,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248952296] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-12 19:46:51,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822077795]
[2024-10-12 19:46:51,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-10-12 19:46:51,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-12 19:46:51,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-12 19:46:51,171 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-10-12 19:46:51,173 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-10-12 19:46:51,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s)
[2024-10-12 19:46:51,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-10-12 19:46:51,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 36 conjuncts are in the unsatisfiable core
[2024-10-12 19:46:51,228 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-12 19:46:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2024-10-12 19:46:51,316 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-12 19:46:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2024-10-12 19:46:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822077795] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-12 19:46:52,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-12 19:46:52,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37
[2024-10-12 19:46:52,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476380584]
[2024-10-12 19:46:52,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-12 19:46:52,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2024-10-12 19:46:52,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 19:46:52,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2024-10-12 19:46:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332
[2024-10-12 19:46:52,237 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 21 states have internal predecessors, (42), 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-10-12 19:46:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 19:46:53,210 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions.
[2024-10-12 19:46:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2024-10-12 19:46:53,210 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 21 states have internal predecessors, (42), 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 51
[2024-10-12 19:46:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 19:46:53,212 INFO L225 Difference]: With dead ends: 62
[2024-10-12 19:46:53,212 INFO L226 Difference]: Without dead ends: 56
[2024-10-12 19:46:53,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=386, Invalid=1966, Unknown=0, NotChecked=0, Total=2352
[2024-10-12 19:46:53,214 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-12 19:46:53,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-12 19:46:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2024-10-12 19:46:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2024-10-12 19:46:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17)
[2024-10-12 19:46:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions.
[2024-10-12 19:46:53,236 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 51
[2024-10-12 19:46:53,237 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-12 19:46:53,237 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions.
[2024-10-12 19:46:53,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 21 states have internal predecessors, (42), 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-10-12 19:46:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions.
[2024-10-12 19:46:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2024-10-12 19:46:53,241 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-12 19:46:53,241 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 19:46:53,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-10-12 19:46:53,444 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-10-12 19:46:53,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 19:46:53,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 19:46:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 4 times
[2024-10-12 19:46:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 19:46:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054007595]
[2024-10-12 19:46:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 19:46:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 19:46:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:53,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2024-10-12 19:46:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:54,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:54,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:54,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:54,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:55,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:55,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-12 19:46:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-12 19:46:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked.
[2024-10-12 19:46:55,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-12 19:46:55,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054007595]
[2024-10-12 19:46:55,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054007595] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-12 19:46:55,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688599369]
[2024-10-12 19:46:55,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-10-12 19:46:55,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-12 19:46:55,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-12 19:46:55,579 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-10-12 19:46:55,581 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-10-12 19:46:55,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-10-12 19:46:55,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-10-12 19:46:55,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 68 conjuncts are in the unsatisfiable core
[2024-10-12 19:46:55,655 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-12 19:46:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked.
[2024-10-12 19:46:55,777 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-12 19:46:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked.
[2024-10-12 19:46:58,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688599369] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-12 19:46:58,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-12 19:46:58,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69
[2024-10-12 19:46:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942300311]
[2024-10-12 19:46:58,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-12 19:46:58,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states
[2024-10-12 19:46:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-12 19:46:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants.
[2024-10-12 19:46:58,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692
[2024-10-12 19:46:58,189 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 69 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 37 states have internal predecessors, (74), 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-10-12 19:47:03,830 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-10-12 19:47:13,971 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-10-12 19:47:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-12 19:47:23,056 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions.
[2024-10-12 19:47:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states.
[2024-10-12 19:47:23,057 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 37 states have internal predecessors, (74), 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 99
[2024-10-12 19:47:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-12 19:47:23,060 INFO L225 Difference]: With dead ends: 110
[2024-10-12 19:47:23,060 INFO L226 Difference]: Without dead ends: 104
[2024-10-12 19:47:23,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=1291, Invalid=8021, Unknown=0, NotChecked=0, Total=9312
[2024-10-12 19:47:23,063 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-10-12 19:47:23,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1350 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-10-12 19:47:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2024-10-12 19:47:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104.
[2024-10-12 19:47:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 70 states have internal predecessors, (70), 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-10-12 19:47:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions.
[2024-10-12 19:47:23,082 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 99
[2024-10-12 19:47:23,083 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-12 19:47:23,083 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions.
[2024-10-12 19:47:23,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 37 states have internal predecessors, (74), 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-10-12 19:47:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions.
[2024-10-12 19:47:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2024-10-12 19:47:23,087 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-12 19:47:23,087 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1]
[2024-10-12 19:47:23,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-10-12 19:47:23,291 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-10-12 19:47:23,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-12 19:47:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-12 19:47:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1510268740, now seen corresponding path program 5 times
[2024-10-12 19:47:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-12 19:47:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806551593]
[2024-10-12 19:47:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-12 19:47:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-12 19:47:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-12 19:47:23,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-12 19:47:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-12 19:47:23,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-12 19:47:23,537 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-12 19:47:23,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-10-12 19:47:23,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-12 19:47:23,542 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1]
[2024-10-12 19:47:23,596 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-12 19:47:23,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:47:23 BoogieIcfgContainer
[2024-10-12 19:47:23,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-12 19:47:23,600 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-12 19:47:23,600 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-12 19:47:23,600 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-12 19:47:23,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:46:47" (3/4) ...
[2024-10-12 19:47:23,601 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-12 19:47:23,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-10-12 19:47:23,667 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-12 19:47:23,667 INFO L158 Benchmark]: Toolchain (without parser) took 36493.65ms. Allocated memory was 172.0MB in the beginning and 310.4MB in the end (delta: 138.4MB). Free memory was 102.9MB in the beginning and 221.7MB in the end (delta: -118.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB.
[2024-10-12 19:47:23,668 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-12 19:47:23,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.50ms. Allocated memory is still 172.0MB. Free memory was 102.6MB in the beginning and 91.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-10-12 19:47:23,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.01ms. Allocated memory is still 172.0MB. Free memory was 91.0MB in the beginning and 89.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-12 19:47:23,668 INFO L158 Benchmark]: Boogie Preprocessor took 30.09ms. Allocated memory is still 172.0MB. Free memory was 89.5MB in the beginning and 88.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-12 19:47:23,668 INFO L158 Benchmark]: RCFGBuilder took 226.94ms. Allocated memory is still 172.0MB. Free memory was 88.0MB in the beginning and 77.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-10-12 19:47:23,669 INFO L158 Benchmark]: TraceAbstraction took 35889.20ms. Allocated memory was 172.0MB in the beginning and 310.4MB in the end (delta: 138.4MB). Free memory was 76.9MB in the beginning and 224.9MB in the end (delta: -147.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-12 19:47:23,669 INFO L158 Benchmark]: Witness Printer took 67.10ms. Allocated memory is still 310.4MB. Free memory was 224.9MB in the beginning and 221.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-12 19:47:23,670 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.16ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 246.50ms. Allocated memory is still 172.0MB. Free memory was 102.6MB in the beginning and 91.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 28.01ms. Allocated memory is still 172.0MB. Free memory was 91.0MB in the beginning and 89.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 30.09ms. Allocated memory is still 172.0MB. Free memory was 89.5MB in the beginning and 88.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 226.94ms. Allocated memory is still 172.0MB. Free memory was 88.0MB in the beginning and 77.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 35889.20ms. Allocated memory was 172.0MB in the beginning and 310.4MB in the end (delta: 138.4MB). Free memory was 76.9MB in the beginning and 224.9MB in the end (delta: -147.9MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 67.10ms. Allocated memory is still 310.4MB. Free memory was 224.9MB in the beginning and 221.7MB 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, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.8s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 2112 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2003 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1112 IncrementalHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 109 mSDtfsCounter, 1112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 559 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 468 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-10-12 19:47:23,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE