./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann01-2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:23:58,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:23:58,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:23:58,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:23:58,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:23:58,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:23:58,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:23:58,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:23:58,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:23:58,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:23:58,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:23:58,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:23:58,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:23:58,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:23:58,553 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:23:58,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:23:58,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:23:58,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:23:58,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:23:58,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:23:58,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:23:58,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:23:58,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:23:58,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:23:58,562 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:23:58,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:23:58,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:23:58,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:23:58,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:23:58,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:23:58,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:23:58,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:23:58,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:23:58,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:23:58,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:23:58,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:23:58,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:23:58,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:23:58,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:23:58,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:23:58,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:23:58,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:23:58,566 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:23:58,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:23:58,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:23:58,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:23:58,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:23:58,833 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:23:58,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Ackermann01-2.c [2024-09-11 20:24:00,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:24:00,387 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:24:00,387 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Ackermann01-2.c [2024-09-11 20:24:00,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1fa5bfc7b/3b0a4516a349425ca339e2dd1582cae1/FLAG3be6d965c [2024-09-11 20:24:00,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1fa5bfc7b/3b0a4516a349425ca339e2dd1582cae1 [2024-09-11 20:24:00,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:24:00,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:24:00,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:24:00,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:24:00,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:24:00,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:24:00" (1/1) ... [2024-09-11 20:24:00,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2831540d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:00, skipping insertion in model container [2024-09-11 20:24:00,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:24:00" (1/1) ... [2024-09-11 20:24:00,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:24:00,981 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Ackermann01-2.c[1234,1247] [2024-09-11 20:24:00,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:24:01,002 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:24:01,020 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Ackermann01-2.c[1234,1247] [2024-09-11 20:24:01,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:24:01,039 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:24:01,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01 WrapperNode [2024-09-11 20:24:01,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:24:01,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:24:01,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:24:01,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:24:01,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,063 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-09-11 20:24:01,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:24:01,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:24:01,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:24:01,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:24:01,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,086 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-09-11 20:24:01,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:24:01,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:24:01,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:24:01,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:24:01,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (1/1) ... [2024-09-11 20:24:01,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:24:01,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:01,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:24:01,134 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:24:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:24:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:24:01,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:24:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2024-09-11 20:24:01,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2024-09-11 20:24:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:24:01,235 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:24:01,237 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:24:01,379 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-09-11 20:24:01,379 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:24:01,408 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:24:01,409 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:24:01,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:01 BoogieIcfgContainer [2024-09-11 20:24:01,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:24:01,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:24:01,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:24:01,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:24:01,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:24:00" (1/3) ... [2024-09-11 20:24:01,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18010ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:24:01, skipping insertion in model container [2024-09-11 20:24:01,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:01" (2/3) ... [2024-09-11 20:24:01,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18010ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:24:01, skipping insertion in model container [2024-09-11 20:24:01,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:01" (3/3) ... [2024-09-11 20:24:01,439 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2024-09-11 20:24:01,472 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:24:01,472 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:24:01,575 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:24:01,582 INFO L336 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=All, 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;@770d70ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:24:01,583 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:24:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:24:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 20:24:01,595 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:01,596 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:01,596 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:01,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1538870455, now seen corresponding path program 1 times [2024-09-11 20:24:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796586012] [2024-09-11 20:24:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:01,877 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:24:01,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:01,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796586012] [2024-09-11 20:24:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796586012] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:24:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:24:01,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 20:24:01,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679422452] [2024-09-11 20:24:01,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:24:01,988 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 20:24:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:02,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 20:24:02,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:24:02,010 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-09-11 20:24:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:02,152 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2024-09-11 20:24:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:24:02,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-09-11 20:24:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:02,161 INFO L225 Difference]: With dead ends: 31 [2024-09-11 20:24:02,161 INFO L226 Difference]: Without dead ends: 23 [2024-09-11 20:24:02,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:24:02,171 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:02,171 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 72 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-11 20:24:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-11 20:24:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-11 20:24:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-09-11 20:24:02,218 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2024-09-11 20:24:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:02,219 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-09-11 20:24:02,219 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-09-11 20:24:02,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-09-11 20:24:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 20:24:02,223 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:02,223 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:02,223 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:24:02,224 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:02,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash -108557995, now seen corresponding path program 1 times [2024-09-11 20:24:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:02,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077896952] [2024-09-11 20:24:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:02,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:02,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:24:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077896952] [2024-09-11 20:24:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077896952] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:24:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:24:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-11 20:24:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386644257] [2024-09-11 20:24:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:24:02,539 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 20:24:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:02,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 20:24:02,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:24:02,542 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:24:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:02,670 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2024-09-11 20:24:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:24:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-11 20:24:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:02,672 INFO L225 Difference]: With dead ends: 30 [2024-09-11 20:24:02,672 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 20:24:02,673 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:24:02,674 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:02,674 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 80 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 20:24:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-09-11 20:24:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-11 20:24:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-09-11 20:24:02,684 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2024-09-11 20:24:02,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:02,684 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-09-11 20:24:02,685 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:24:02,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-09-11 20:24:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 20:24:02,687 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:02,687 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:02,687 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:24:02,687 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:02,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1474991098, now seen corresponding path program 1 times [2024-09-11 20:24:02,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:02,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061269467] [2024-09-11 20:24:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:02,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:02,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:02,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:24:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:24:02,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:02,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061269467] [2024-09-11 20:24:02,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061269467] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089504083] [2024-09-11 20:24:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:02,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:02,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:02,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:24:02,828 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:24:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:02,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 20:24:02,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:24:03,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:24:03,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089504083] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:03,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:03,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2024-09-11 20:24:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198621869] [2024-09-11 20:24:03,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:03,197 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 20:24:03,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 20:24:03,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-11 20:24:03,199 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-11 20:24:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:03,392 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2024-09-11 20:24:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:24:03,393 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24 [2024-09-11 20:24:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:03,394 INFO L225 Difference]: With dead ends: 47 [2024-09-11 20:24:03,394 INFO L226 Difference]: Without dead ends: 29 [2024-09-11 20:24:03,396 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:24:03,397 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:03,399 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 85 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-11 20:24:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2024-09-11 20:24:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-11 20:24:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-09-11 20:24:03,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 24 [2024-09-11 20:24:03,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:03,413 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-09-11 20:24:03,413 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-11 20:24:03,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-09-11 20:24:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-11 20:24:03,417 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:03,417 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:03,432 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:24:03,621 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:03,622 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:03,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1725758412, now seen corresponding path program 1 times [2024-09-11 20:24:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:03,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878401555] [2024-09-11 20:24:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:03,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:03,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:03,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:03,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:03,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:24:03,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878401555] [2024-09-11 20:24:03,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878401555] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769823429] [2024-09-11 20:24:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:03,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:03,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:24:03,895 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:24:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:03,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-11 20:24:03,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-11 20:24:03,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:24:04,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769823429] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:04,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:04,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2024-09-11 20:24:04,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051468243] [2024-09-11 20:24:04,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:04,614 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-11 20:24:04,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:04,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-11 20:24:04,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:24:04,617 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 19 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-11 20:24:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:05,478 INFO L93 Difference]: Finished difference Result 73 states and 143 transitions. [2024-09-11 20:24:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-11 20:24:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 19 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 31 [2024-09-11 20:24:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:05,487 INFO L225 Difference]: With dead ends: 73 [2024-09-11 20:24:05,487 INFO L226 Difference]: Without dead ends: 67 [2024-09-11 20:24:05,489 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=385, Invalid=1967, Unknown=0, NotChecked=0, Total=2352 [2024-09-11 20:24:05,489 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 59 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:05,490 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 150 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:24:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-11 20:24:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2024-09-11 20:24:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31) [2024-09-11 20:24:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2024-09-11 20:24:05,523 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 31 [2024-09-11 20:24:05,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:05,523 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2024-09-11 20:24:05,524 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 19 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-11 20:24:05,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:05,524 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2024-09-11 20:24:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 20:24:05,527 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:05,527 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:05,543 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:24:05,728 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:05,728 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:05,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1482164270, now seen corresponding path program 2 times [2024-09-11 20:24:05,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:05,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543136296] [2024-09-11 20:24:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:05,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:05,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:05,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:05,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:05,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:05,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-11 20:24:05,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:05,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543136296] [2024-09-11 20:24:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543136296] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848215295] [2024-09-11 20:24:05,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:24:05,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:05,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:05,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:24:05,992 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:24:06,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:24:06,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:24:06,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 20:24:06,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 20:24:06,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-11 20:24:06,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848215295] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:06,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:06,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20 [2024-09-11 20:24:06,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913357073] [2024-09-11 20:24:06,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:06,492 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:24:06,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:06,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:24:06,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:24:06,494 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2024-09-11 20:24:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:06,827 INFO L93 Difference]: Finished difference Result 95 states and 219 transitions. [2024-09-11 20:24:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:24:06,828 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 45 [2024-09-11 20:24:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:06,830 INFO L225 Difference]: With dead ends: 95 [2024-09-11 20:24:06,830 INFO L226 Difference]: Without dead ends: 62 [2024-09-11 20:24:06,832 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:24:06,833 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:06,833 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 117 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:24:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-11 20:24:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-09-11 20:24:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 9 states have call successors, (9), 2 states have call predecessors, (9), 11 states have return successors, (57), 17 states have call predecessors, (57), 9 states have call successors, (57) [2024-09-11 20:24:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2024-09-11 20:24:06,871 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 45 [2024-09-11 20:24:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:06,872 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2024-09-11 20:24:06,872 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2024-09-11 20:24:06,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2024-09-11 20:24:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-11 20:24:06,874 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:06,875 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 8, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:06,892 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:24:07,080 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:07,081 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:07,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash 841120270, now seen corresponding path program 3 times [2024-09-11 20:24:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:07,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524557404] [2024-09-11 20:24:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:24:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 100 proven. 93 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-09-11 20:24:07,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524557404] [2024-09-11 20:24:07,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524557404] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:07,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207031206] [2024-09-11 20:24:07,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:24:07,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:07,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:24:07,670 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:24:07,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-11 20:24:07,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:24:07,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-11 20:24:07,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 112 proven. 20 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:24:07,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-09-11 20:24:09,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207031206] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:09,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:09,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 14] total 32 [2024-09-11 20:24:09,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882731235] [2024-09-11 20:24:09,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:09,965 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-11 20:24:09,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-11 20:24:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2024-09-11 20:24:09,967 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 24 states have internal predecessors, (63), 7 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (27), 17 states have call predecessors, (27), 7 states have call successors, (27) [2024-09-11 20:24:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:11,166 INFO L93 Difference]: Finished difference Result 152 states and 442 transitions. [2024-09-11 20:24:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-09-11 20:24:11,167 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 24 states have internal predecessors, (63), 7 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (27), 17 states have call predecessors, (27), 7 states have call successors, (27) Word has length 85 [2024-09-11 20:24:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:11,168 INFO L225 Difference]: With dead ends: 152 [2024-09-11 20:24:11,168 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:24:11,172 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=676, Invalid=3880, Unknown=0, NotChecked=0, Total=4556 [2024-09-11 20:24:11,173 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 98 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:11,173 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 149 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-11 20:24:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:24:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:24:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:24:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:24:11,174 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-09-11 20:24:11,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:11,174 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:24:11,175 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 24 states have internal predecessors, (63), 7 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (27), 17 states have call predecessors, (27), 7 states have call successors, (27) [2024-09-11 20:24:11,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:24:11,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:24:11,178 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:24:11,195 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:24:11,382 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:11,385 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-11 20:24:11,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:24:14,507 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:24:14,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:24:14 BoogieIcfgContainer [2024-09-11 20:24:14,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:24:14,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:24:14,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:24:14,534 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:24:14,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:01" (3/4) ... [2024-09-11 20:24:14,536 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:24:14,540 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2024-09-11 20:24:14,544 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:24:14,544 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:24:14,545 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:24:14,545 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:24:14,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:24:14,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:24:14,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:24:14,628 INFO L158 Benchmark]: Toolchain (without parser) took 13831.20ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 145.2MB in the beginning and 304.3MB in the end (delta: -159.0MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-09-11 20:24:14,628 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:24:14,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.63ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 133.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:24:14,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.89ms. Allocated memory is still 176.2MB. Free memory was 133.2MB in the beginning and 132.2MB in the end (delta: 979.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:24:14,629 INFO L158 Benchmark]: Boogie Preprocessor took 29.80ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:24:14,631 INFO L158 Benchmark]: RCFGBuilder took 314.75ms. Allocated memory is still 176.2MB. Free memory was 130.1MB in the beginning and 118.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:24:14,631 INFO L158 Benchmark]: TraceAbstraction took 13122.41ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 117.5MB in the beginning and 308.5MB in the end (delta: -190.9MB). Peak memory consumption was 196.1MB. Max. memory is 16.1GB. [2024-09-11 20:24:14,631 INFO L158 Benchmark]: Witness Printer took 93.16ms. Allocated memory is still 371.2MB. Free memory was 308.5MB in the beginning and 304.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:24:14,634 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.17ms. Allocated memory is still 109.1MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.63ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 133.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.89ms. Allocated memory is still 176.2MB. Free memory was 133.2MB in the beginning and 132.2MB in the end (delta: 979.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.80ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.75ms. Allocated memory is still 176.2MB. Free memory was 130.1MB in the beginning and 118.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13122.41ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 117.5MB in the beginning and 308.5MB in the end (delta: -190.9MB). Peak memory consumption was 196.1MB. Max. memory is 16.1GB. * Witness Printer took 93.16ms. Allocated memory is still 371.2MB. Free memory was 308.5MB in the beginning and 304.3MB in the end (delta: 4.2MB). 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 - PositiveResult [Line: 46]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 653 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 551 mSDsCounter, 281 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1961 IncrementalHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 281 mSolverCounterUnsat, 102 mSDtfsCounter, 1961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 553 GetRequests, 381 SyntacticMatches, 4 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=5, InterpolantAutomatonStates: 114, 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, 6 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 399 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 1300 SizeOfPredicates, 2 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 1129/1303 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for ackermann Derived contract for procedure ackermann. Ensures: (((0 < \old(m)) || ((\old(m) == 0) && (((long long) \old(n) + 1) <= \result))) && (((((((2 <= \old(m)) && (0 <= \result)) && (\old(n) <= 0)) || ((\old(m) == 1) && (3 <= \result))) || (\old(m) < 1)) || (((2 <= \result) && (\old(n) <= 0)) && (\old(m) == 1))) || ((2 <= \old(m)) && (0 <= \result)))) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:24:14,658 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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 Result: TRUE