./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --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 04d6fb36 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 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 19:42:48,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 19:42:49,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 19:42:49,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 19:42:49,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 19:42:49,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 19:42:49,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 19:42:49,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 19:42:49,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 19:42:49,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 19:42:49,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 19:42:49,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 19:42:49,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 19:42:49,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 19:42:49,123 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 19:42:49,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 19:42:49,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 19:42:49,124 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 19:42:49,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 19:42:49,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 19:42:49,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 19:42:49,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 19:42:49,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 19:42:49,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 19:42:49,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 19:42:49,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 19:42:49,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 19:42:49,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 19:42:49,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 19:42:49,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 19:42:49,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 19:42:49,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 19:42:49,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:42:49,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 19:42:49,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 19:42:49,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 19:42:49,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 19:42:49,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 19:42:49,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 19:42:49,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 19:42:49,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 19:42:49,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 19:42:49,135 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.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER 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-15 19:42:49,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 19:42:49,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 19:42:49,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 19:42:49,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 19:42:49,471 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 19:42:49,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Ackermann01-2.c [2024-09-15 19:42:50,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 19:42:51,174 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 19:42:51,174 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Ackermann01-2.c [2024-09-15 19:42:51,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c4706c31e/64e925ec37a245b4ae0150eca4319f74/FLAG6df2af703 [2024-09-15 19:42:51,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c4706c31e/64e925ec37a245b4ae0150eca4319f74 [2024-09-15 19:42:51,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 19:42:51,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 19:42:51,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 19:42:51,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 19:42:51,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 19:42:51,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b56c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51, skipping insertion in model container [2024-09-15 19:42:51,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 19:42:51,398 WARN L248 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-15 19:42:51,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:42:51,416 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 19:42:51,433 WARN L248 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-15 19:42:51,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:42:51,453 INFO L204 MainTranslator]: Completed translation [2024-09-15 19:42:51,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51 WrapperNode [2024-09-15 19:42:51,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 19:42:51,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 19:42:51,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 19:42:51,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 19:42:51,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,475 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 19:42:51,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 19:42:51,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 19:42:51,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 19:42:51,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 19:42:51,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,507 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-15 19:42:51,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 19:42:51,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 19:42:51,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 19:42:51,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 19:42:51,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (1/1) ... [2024-09-15 19:42:51,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:42:51,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:42:51,554 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-15 19:42:51,557 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-15 19:42:51,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 19:42:51,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 19:42:51,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 19:42:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 19:42:51,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 19:42:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2024-09-15 19:42:51,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2024-09-15 19:42:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 19:42:51,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 19:42:51,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 19:42:51,666 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 19:42:51,668 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 19:42:51,824 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-15 19:42:51,825 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 19:42:51,847 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 19:42:51,848 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-15 19:42:51,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:42:51 BoogieIcfgContainer [2024-09-15 19:42:51,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 19:42:51,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 19:42:51,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 19:42:51,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 19:42:51,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:42:51" (1/3) ... [2024-09-15 19:42:51,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109040b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:42:51, skipping insertion in model container [2024-09-15 19:42:51,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:42:51" (2/3) ... [2024-09-15 19:42:51,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109040b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:42:51, skipping insertion in model container [2024-09-15 19:42:51,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:42:51" (3/3) ... [2024-09-15 19:42:51,859 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2024-09-15 19:42:51,874 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 19:42:51,875 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-15 19:42:51,932 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 19:42:51,940 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;@72a3e666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 19:42:51,940 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-15 19:42:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-15 19:42:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-15 19:42:51,951 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:42:51,952 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:42:51,953 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:42:51,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2113269736, now seen corresponding path program 1 times [2024-09-15 19:42:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:42:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037093833] [2024-09-15 19:42:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:42:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:42:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:52,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:42:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:52,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 19:42:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:52,340 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-15 19:42:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:42:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037093833] [2024-09-15 19:42:52,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037093833] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:42:52,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:42:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-15 19:42:52,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552291157] [2024-09-15 19:42:52,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:42:52,352 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 19:42:52,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:42:52,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 19:42:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-15 19:42:52,380 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-15 19:42:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:42:52,533 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2024-09-15 19:42:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 19:42:52,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-09-15 19:42:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:42:52,543 INFO L225 Difference]: With dead ends: 39 [2024-09-15 19:42:52,543 INFO L226 Difference]: Without dead ends: 27 [2024-09-15 19:42:52,546 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-15 19:42:52,549 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:42:52,549 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:42:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-15 19:42:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-09-15 19:42:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-15 19:42:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-09-15 19:42:52,588 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 15 [2024-09-15 19:42:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:42:52,588 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-09-15 19:42:52,589 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-15 19:42:52,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-09-15 19:42:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-15 19:42:52,593 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:42:52,593 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:42:52,594 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 19:42:52,594 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:42:52,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2051125499, now seen corresponding path program 1 times [2024-09-15 19:42:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:42:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029787453] [2024-09-15 19:42:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:42:52,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:42:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:52,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:42:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:52,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 19:42:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:52,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:52,877 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-15 19:42:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:42:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029787453] [2024-09-15 19:42:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029787453] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:42:52,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:42:52,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 19:42:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447857344] [2024-09-15 19:42:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:42:52,881 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 19:42:52,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:42:52,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 19:42:52,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-09-15 19:42:52,883 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 19:42:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:42:52,990 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2024-09-15 19:42:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 19:42:52,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-09-15 19:42:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:42:52,992 INFO L225 Difference]: With dead ends: 34 [2024-09-15 19:42:52,993 INFO L226 Difference]: Without dead ends: 30 [2024-09-15 19:42:52,993 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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-15 19:42:52,994 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:42:52,995 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 120 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:42:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-15 19:42:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-09-15 19:42:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-15 19:42:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-09-15 19:42:53,005 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 22 [2024-09-15 19:42:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:42:53,005 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-09-15 19:42:53,005 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 19:42:53,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-09-15 19:42:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-15 19:42:53,007 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:42:53,007 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:42:53,007 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 19:42:53,008 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:42:53,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1493163978, now seen corresponding path program 1 times [2024-09-15 19:42:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:42:53,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180186012] [2024-09-15 19:42:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:42:53,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:42:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:53,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:42:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:53,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 19:42:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:53,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:53,108 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-15 19:42:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:53,114 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-15 19:42:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:42:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180186012] [2024-09-15 19:42:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180186012] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:42:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557322222] [2024-09-15 19:42:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:42:53,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:42:53,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:42:53,119 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-15 19:42:53,121 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-15 19:42:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:53,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-15 19:42:53,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:42:53,269 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-15 19:42:53,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:42:53,431 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-15 19:42:53,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557322222] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:42:53,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:42:53,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2024-09-15 19:42:53,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325949242] [2024-09-15 19:42:53,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:42:53,433 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-15 19:42:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:42:53,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-15 19:42:53,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-15 19:42:53,434 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-15 19:42:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:42:53,581 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2024-09-15 19:42:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 19:42:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2024-09-15 19:42:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:42:53,584 INFO L225 Difference]: With dead ends: 51 [2024-09-15 19:42:53,584 INFO L226 Difference]: Without dead ends: 33 [2024-09-15 19:42:53,585 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 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-15 19:42:53,586 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:42:53,588 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 127 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:42:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-15 19:42:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-09-15 19:42:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-15 19:42:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-09-15 19:42:53,604 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 28 [2024-09-15 19:42:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:42:53,604 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-09-15 19:42:53,605 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-15 19:42:53,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-09-15 19:42:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-15 19:42:53,607 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:42:53,607 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, 1, 1, 1, 1] [2024-09-15 19:42:53,626 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 19:42:53,807 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-15 19:42:53,808 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:42:53,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1687167245, now seen corresponding path program 1 times [2024-09-15 19:42:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:42:53,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692735189] [2024-09-15 19:42:53,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:42:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:42:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:53,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:42:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:53,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 19:42:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:53,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:54,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:54,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-15 19:42:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:54,089 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-15 19:42:54,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:42:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692735189] [2024-09-15 19:42:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692735189] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:42:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833183071] [2024-09-15 19:42:54,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:42:54,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:42:54,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:42:54,093 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-15 19:42:54,095 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-15 19:42:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:54,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-15 19:42:54,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:42:54,214 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-15 19:42:54,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:42:54,849 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-15 19:42:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833183071] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:42:54,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:42:54,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2024-09-15 19:42:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055197508] [2024-09-15 19:42:54,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:42:54,853 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-15 19:42:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:42:54,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-15 19:42:54,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-09-15 19:42:54,854 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (7), 1 states have call predecessors, (7), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-15 19:42:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:42:55,754 INFO L93 Difference]: Finished difference Result 77 states and 147 transitions. [2024-09-15 19:42:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-15 19:42:55,755 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (7), 1 states have call predecessors, (7), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) Word has length 35 [2024-09-15 19:42:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:42:55,759 INFO L225 Difference]: With dead ends: 77 [2024-09-15 19:42:55,759 INFO L226 Difference]: Without dead ends: 71 [2024-09-15 19:42:55,760 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 69 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-15 19:42:55,761 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 19:42:55,761 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 219 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 19:42:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-15 19:42:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2024-09-15 19:42:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (32), 11 states have call predecessors, (32), 7 states have call successors, (32) [2024-09-15 19:42:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 67 transitions. [2024-09-15 19:42:55,789 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 67 transitions. Word has length 35 [2024-09-15 19:42:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:42:55,790 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 67 transitions. [2024-09-15 19:42:55,790 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (7), 1 states have call predecessors, (7), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-15 19:42:55,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 67 transitions. [2024-09-15 19:42:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-15 19:42:55,792 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:42:55,794 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, 1, 1, 1, 1] [2024-09-15 19:42:55,810 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-15 19:42:55,994 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-15 19:42:55,995 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:42:55,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:55,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1359677809, now seen corresponding path program 2 times [2024-09-15 19:42:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:42:55,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532505725] [2024-09-15 19:42:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:42:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:42:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:56,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:42:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:56,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 19:42:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:56,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:56,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:56,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:56,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-15 19:42:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:56,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:56,279 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-15 19:42:56,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:42:56,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532505725] [2024-09-15 19:42:56,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532505725] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:42:56,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108686698] [2024-09-15 19:42:56,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 19:42:56,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:42:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:42:56,282 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-15 19:42:56,283 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-15 19:42:56,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 19:42:56,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:42:56,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-15 19:42:56,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:42:56,420 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-15 19:42:56,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:42:56,804 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-15 19:42:56,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108686698] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:42:56,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:42:56,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20 [2024-09-15 19:42:56,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640116792] [2024-09-15 19:42:56,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:42:56,807 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-15 19:42:56,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:42:56,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-15 19:42:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-09-15 19:42:56,808 INFO L87 Difference]: Start difference. First operand 41 states and 67 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 6 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (14), 10 states have call predecessors, (14), 6 states have call successors, (14) [2024-09-15 19:42:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:42:57,129 INFO L93 Difference]: Finished difference Result 99 states and 223 transitions. [2024-09-15 19:42:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-15 19:42:57,130 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 6 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (14), 10 states have call predecessors, (14), 6 states have call successors, (14) Word has length 49 [2024-09-15 19:42:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:42:57,132 INFO L225 Difference]: With dead ends: 99 [2024-09-15 19:42:57,132 INFO L226 Difference]: Without dead ends: 66 [2024-09-15 19:42:57,134 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 105 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-15 19:42:57,135 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:42:57,135 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 122 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:42:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-15 19:42:57,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-09-15 19:42:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 11 states have call successors, (11), 4 states have call predecessors, (11), 12 states have return successors, (58), 18 states have call predecessors, (58), 10 states have call successors, (58) [2024-09-15 19:42:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2024-09-15 19:42:57,164 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 49 [2024-09-15 19:42:57,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:42:57,164 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2024-09-15 19:42:57,164 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 6 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (14), 10 states have call predecessors, (14), 6 states have call successors, (14) [2024-09-15 19:42:57,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2024-09-15 19:42:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-09-15 19:42:57,168 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:42:57,168 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, 1, 1, 1, 1] [2024-09-15 19:42:57,185 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-15 19:42:57,369 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-15 19:42:57,369 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:42:57,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 432777711, now seen corresponding path program 3 times [2024-09-15 19:42:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:42:57,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736448233] [2024-09-15 19:42:57,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:42:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:42:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:42:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 19:42:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-15 19:42:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,785 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-15 19:42:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:42:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-15 19:42:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:42:57,914 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-15 19:42:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:42:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736448233] [2024-09-15 19:42:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736448233] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:42:57,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979925300] [2024-09-15 19:42:57,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-15 19:42:57,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:42:57,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:42:57,918 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-15 19:42:57,920 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-15 19:42:57,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-15 19:42:57,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:42:57,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-15 19:42:57,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:42:58,156 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-15 19:42:58,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:42:59,959 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-15 19:42:59,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979925300] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:42:59,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:42:59,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 14] total 32 [2024-09-15 19:42:59,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207920852] [2024-09-15 19:42:59,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:42:59,960 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-15 19:42:59,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:42:59,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-15 19:42:59,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2024-09-15 19:42:59,962 INFO L87 Difference]: Start difference. First operand 63 states and 110 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 24 states have internal predecessors, (64), 7 states have call successors, (13), 1 states have call predecessors, (13), 14 states have return successors, (28), 17 states have call predecessors, (28), 7 states have call successors, (28) [2024-09-15 19:43:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:43:01,035 INFO L93 Difference]: Finished difference Result 156 states and 446 transitions. [2024-09-15 19:43:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-09-15 19:43:01,036 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 24 states have internal predecessors, (64), 7 states have call successors, (13), 1 states have call predecessors, (13), 14 states have return successors, (28), 17 states have call predecessors, (28), 7 states have call successors, (28) Word has length 89 [2024-09-15 19:43:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:43:01,037 INFO L225 Difference]: With dead ends: 156 [2024-09-15 19:43:01,041 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 19:43:01,052 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=676, Invalid=3880, Unknown=0, NotChecked=0, Total=4556 [2024-09-15 19:43:01,052 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 100 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 19:43:01,053 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 181 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 19:43:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 19:43:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 19:43:01,055 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-15 19:43:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 19:43:01,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2024-09-15 19:43:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:43:01,055 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 19:43:01,056 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 24 states have internal predecessors, (64), 7 states have call successors, (13), 1 states have call predecessors, (13), 14 states have return successors, (28), 17 states have call predecessors, (28), 7 states have call successors, (28) [2024-09-15 19:43:01,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 19:43:01,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 19:43:01,059 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-15 19:43:01,073 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-15 19:43:01,259 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-15 19:43:01,262 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-15 19:43:01,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-15 19:43:04,244 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 19:43:04,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:43:04 BoogieIcfgContainer [2024-09-15 19:43:04,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 19:43:04,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-15 19:43:04,268 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-15 19:43:04,268 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-15 19:43:04,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:42:51" (3/4) ... [2024-09-15 19:43:04,270 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-15 19:43:04,273 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-15 19:43:04,274 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2024-09-15 19:43:04,274 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-15 19:43:04,279 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-09-15 19:43:04,279 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-15 19:43:04,279 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-15 19:43:04,279 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 19:43:04,359 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-15 19:43:04,360 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-15 19:43:04,360 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-15 19:43:04,360 INFO L158 Benchmark]: Toolchain (without parser) took 13161.11ms. Allocated memory was 62.9MB in the beginning and 299.9MB in the end (delta: 237.0MB). Free memory was 29.2MB in the beginning and 138.4MB in the end (delta: -109.3MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2024-09-15 19:43:04,361 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 50.3MB. Free memory is still 23.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:43:04,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.55ms. Allocated memory is still 62.9MB. Free memory was 28.8MB in the beginning and 35.8MB in the end (delta: -7.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-09-15 19:43:04,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.18ms. Allocated memory is still 62.9MB. Free memory was 35.8MB in the beginning and 34.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:43:04,361 INFO L158 Benchmark]: Boogie Preprocessor took 43.70ms. Allocated memory is still 62.9MB. Free memory was 34.8MB in the beginning and 33.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 19:43:04,362 INFO L158 Benchmark]: RCFGBuilder took 327.97ms. Allocated memory is still 62.9MB. Free memory was 33.3MB in the beginning and 39.0MB in the end (delta: -5.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-09-15 19:43:04,362 INFO L158 Benchmark]: TraceAbstraction took 12416.88ms. Allocated memory was 62.9MB in the beginning and 299.9MB in the end (delta: 237.0MB). Free memory was 38.5MB in the beginning and 142.6MB in the end (delta: -104.1MB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB. [2024-09-15 19:43:04,362 INFO L158 Benchmark]: Witness Printer took 92.40ms. Allocated memory is still 299.9MB. Free memory was 142.6MB in the beginning and 138.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-15 19:43:04,364 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 50.3MB. Free memory is still 23.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.55ms. Allocated memory is still 62.9MB. Free memory was 28.8MB in the beginning and 35.8MB in the end (delta: -7.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.18ms. Allocated memory is still 62.9MB. Free memory was 35.8MB in the beginning and 34.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.70ms. Allocated memory is still 62.9MB. Free memory was 34.8MB in the beginning and 33.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 327.97ms. Allocated memory is still 62.9MB. Free memory was 33.3MB in the beginning and 39.0MB in the end (delta: -5.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12416.88ms. Allocated memory was 62.9MB in the beginning and 299.9MB in the end (delta: 237.0MB). Free memory was 38.5MB in the beginning and 142.6MB in the end (delta: -104.1MB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB. * Witness Printer took 92.40ms. Allocated memory is still 299.9MB. Free memory was 142.6MB in the beginning and 138.4MB 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 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 883 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 754 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1805 IncrementalHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 129 mSDtfsCounter, 1805 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 429 SyntacticMatches, 4 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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.1s InterpolantComputationTime, 439 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 626 ConstructedInterpolants, 0 QuantifiedInterpolants, 1356 SizeOfPredicates, 2 NumberOfNonLiveVariables, 543 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 - 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-15 19:43:04,398 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