./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci01-1.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/Fibonacci01-1.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 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --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:43:05,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 19:43:05,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 19:43:05,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 19:43:05,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 19:43:05,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 19:43:05,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 19:43:05,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 19:43:05,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 19:43:05,964 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 19:43:05,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 19:43:05,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 19:43:05,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 19:43:05,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 19:43:05,969 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 19:43:05,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 19:43:05,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 19:43:05,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 19:43:05,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 19:43:05,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 19:43:05,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 19:43:05,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 19:43:05,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 19:43:05,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 19:43:05,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 19:43:05,973 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 19:43:05,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 19:43:05,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 19:43:05,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 19:43:05,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 19:43:05,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 19:43:05,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 19:43:05,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:43:05,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 19:43:05,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 19:43:05,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 19:43:05,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 19:43:05,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 19:43:05,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 19:43:05,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 19:43:05,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 19:43:05,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 19:43:05,979 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 -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 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:43:06,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 19:43:06,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 19:43:06,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 19:43:06,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 19:43:06,355 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 19:43:06,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Fibonacci01-1.c [2024-09-15 19:43:07,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 19:43:08,031 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 19:43:08,032 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Fibonacci01-1.c [2024-09-15 19:43:08,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/76b22ab7e/6eacdbc4c8ed4e5893054d4dcd638d0e/FLAG8a21bcf8f [2024-09-15 19:43:08,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/76b22ab7e/6eacdbc4c8ed4e5893054d4dcd638d0e [2024-09-15 19:43:08,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 19:43:08,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 19:43:08,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 19:43:08,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 19:43:08,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 19:43:08,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ccb29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08, skipping insertion in model container [2024-09-15 19:43:08,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 19:43:08,626 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/Fibonacci01-1.c[804,817] [2024-09-15 19:43:08,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:43:08,647 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 19:43:08,661 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/Fibonacci01-1.c[804,817] [2024-09-15 19:43:08,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:43:08,679 INFO L204 MainTranslator]: Completed translation [2024-09-15 19:43:08,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08 WrapperNode [2024-09-15 19:43:08,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 19:43:08,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 19:43:08,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 19:43:08,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 19:43:08,689 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:43:08" (1/1) ... [2024-09-15 19:43:08,695 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:43:08" (1/1) ... [2024-09-15 19:43:08,702 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 19:43:08,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 19:43:08,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 19:43:08,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 19:43:08,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 19:43:08,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,731 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:43:08,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 19:43:08,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 19:43:08,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 19:43:08,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 19:43:08,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (1/1) ... [2024-09-15 19:43:08,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:43:08,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:43:08,782 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:43:08,790 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:43:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-09-15 19:43:08,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-09-15 19:43:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 19:43:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 19:43:08,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 19:43:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 19:43:08,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 19:43:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 19:43:08,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 19:43:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 19:43:08,900 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 19:43:08,902 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 19:43:09,069 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-15 19:43:09,070 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 19:43:09,090 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 19:43:09,093 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-15 19:43:09,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:43:09 BoogieIcfgContainer [2024-09-15 19:43:09,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 19:43:09,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 19:43:09,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 19:43:09,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 19:43:09,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:43:08" (1/3) ... [2024-09-15 19:43:09,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2093cce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:43:09, skipping insertion in model container [2024-09-15 19:43:09,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:43:08" (2/3) ... [2024-09-15 19:43:09,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2093cce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:43:09, skipping insertion in model container [2024-09-15 19:43:09,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:43:09" (3/3) ... [2024-09-15 19:43:09,105 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2024-09-15 19:43:09,123 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 19:43:09,123 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-15 19:43:09,192 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 19:43:09,202 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;@ed1798f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 19:43:09,202 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-15 19:43:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-15 19:43:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-15 19:43:09,215 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:43:09,215 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:43:09,216 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:43:09,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:09,222 INFO L85 PathProgramCache]: Analyzing trace with hash -745735812, now seen corresponding path program 1 times [2024-09-15 19:43:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:43:09,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582063789] [2024-09-15 19:43:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:43:09,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:43:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:09,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:43:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:09,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-15 19:43:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:09,674 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:43:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:43:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582063789] [2024-09-15 19:43:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582063789] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:43:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:43:09,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 19:43:09,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715719103] [2024-09-15 19:43:09,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:43:09,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 19:43:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:43:09,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 19:43:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 19:43:09,713 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:43:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:43:09,880 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-09-15 19:43:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 19:43:09,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-09-15 19:43:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:43:09,892 INFO L225 Difference]: With dead ends: 36 [2024-09-15 19:43:09,893 INFO L226 Difference]: Without dead ends: 24 [2024-09-15 19:43:09,896 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 19:43:09,901 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:43:09,903 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:43:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-15 19:43:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-09-15 19:43:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-15 19:43:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-15 19:43:09,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2024-09-15 19:43:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:43:09,953 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-15 19:43:09,953 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:43:09,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-15 19:43:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-15 19:43:09,957 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:43:09,957 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:43:09,957 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 19:43:09,958 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:43:09,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -954418184, now seen corresponding path program 1 times [2024-09-15 19:43:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:43:09,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129556506] [2024-09-15 19:43:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:43:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:43:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:10,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:43:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:10,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-15 19:43:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:10,197 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:43:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:43:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129556506] [2024-09-15 19:43:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129556506] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:43:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:43:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 19:43:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034880093] [2024-09-15 19:43:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:43:10,202 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 19:43:10,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:43:10,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 19:43:10,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 19:43:10,203 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:43:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:43:10,306 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-09-15 19:43:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 19:43:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-09-15 19:43:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:43:10,308 INFO L225 Difference]: With dead ends: 28 [2024-09-15 19:43:10,309 INFO L226 Difference]: Without dead ends: 24 [2024-09-15 19:43:10,309 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 19:43:10,310 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:43:10,310 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:43:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-15 19:43:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-09-15 19:43:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-15 19:43:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-15 19:43:10,325 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-09-15 19:43:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:43:10,326 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-15 19:43:10,326 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:43:10,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-15 19:43:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-15 19:43:10,328 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:43:10,328 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] [2024-09-15 19:43:10,328 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 19:43:10,329 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:43:10,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash 520207931, now seen corresponding path program 1 times [2024-09-15 19:43:10,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:43:10,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071125510] [2024-09-15 19:43:10,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:43:10,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:43:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:10,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:43:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:10,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-15 19:43:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:10,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:43:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:10,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-15 19:43:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:10,505 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:43:10,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:43:10,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071125510] [2024-09-15 19:43:10,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071125510] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:43:10,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957561240] [2024-09-15 19:43:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:43:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:43:10,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:43:10,513 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:43:10,515 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:43:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:10,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-15 19:43:10,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:43:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-15 19:43:10,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:43:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-15 19:43:11,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957561240] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:43:11,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:43:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 21 [2024-09-15 19:43:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195108858] [2024-09-15 19:43:11,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:43:11,238 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-15 19:43:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:43:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-15 19:43:11,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-09-15 19:43:11,240 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-15 19:43:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:43:11,442 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2024-09-15 19:43:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 19:43:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 27 [2024-09-15 19:43:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:43:11,447 INFO L225 Difference]: With dead ends: 39 [2024-09-15 19:43:11,447 INFO L226 Difference]: Without dead ends: 24 [2024-09-15 19:43:11,448 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-09-15 19:43:11,449 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 19:43:11,451 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 148 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 19:43:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-15 19:43:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-15 19:43:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-15 19:43:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-15 19:43:11,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 27 [2024-09-15 19:43:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:43:11,461 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-15 19:43:11,461 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-15 19:43:11,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-15 19:43:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-15 19:43:11,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:43:11,463 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:43:11,478 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:43:11,664 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:43:11,664 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:43:11,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1409384643, now seen corresponding path program 1 times [2024-09-15 19:43:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:43:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844123244] [2024-09-15 19:43:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:43:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:43:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:11,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:43:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:11,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-15 19:43:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:11,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:43:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:11,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 19:43:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-15 19:43:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:43:11,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844123244] [2024-09-15 19:43:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844123244] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:43:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621198693] [2024-09-15 19:43:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:43:11,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:43:11,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:43:11,926 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:43:11,927 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:43:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:11,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-15 19:43:11,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:43:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-15 19:43:12,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:43:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-15 19:43:12,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621198693] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:43:12,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:43:12,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2024-09-15 19:43:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827075680] [2024-09-15 19:43:12,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:43:12,467 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-15 19:43:12,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:43:12,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-15 19:43:12,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-09-15 19:43:12,469 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-15 19:43:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:43:12,680 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-09-15 19:43:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-15 19:43:12,681 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 28 [2024-09-15 19:43:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:43:12,682 INFO L225 Difference]: With dead ends: 35 [2024-09-15 19:43:12,682 INFO L226 Difference]: Without dead ends: 31 [2024-09-15 19:43:12,683 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2024-09-15 19:43:12,684 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:43:12,684 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 108 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:43:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-15 19:43:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-09-15 19:43:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-15 19:43:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-09-15 19:43:12,691 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 28 [2024-09-15 19:43:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:43:12,692 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-09-15 19:43:12,692 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-15 19:43:12,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-09-15 19:43:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-15 19:43:12,693 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:43:12,693 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:43:12,711 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-15 19:43:12,894 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:43:12,894 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:43:12,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1216271788, now seen corresponding path program 2 times [2024-09-15 19:43:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:43:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299889450] [2024-09-15 19:43:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:43:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:43:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:12,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:43:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:12,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-15 19:43:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:12,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:43:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:13,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:43:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:13,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 19:43:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:13,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-15 19:43:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-15 19:43:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:43:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299889450] [2024-09-15 19:43:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299889450] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:43:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821712563] [2024-09-15 19:43:13,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 19:43:13,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:43:13,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:43:13,084 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:43:13,086 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:43:13,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 19:43:13,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:43:13,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-15 19:43:13,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:43:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 19:43:13,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:43:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-15 19:43:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821712563] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:43:13,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:43:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 14 [2024-09-15 19:43:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644683225] [2024-09-15 19:43:13,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:43:13,435 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-15 19:43:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:43:13,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-15 19:43:13,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-09-15 19:43:13,436 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-15 19:43:13,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:43:13,517 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2024-09-15 19:43:13,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 19:43:13,517 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 41 [2024-09-15 19:43:13,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:43:13,518 INFO L225 Difference]: With dead ends: 56 [2024-09-15 19:43:13,519 INFO L226 Difference]: Without dead ends: 34 [2024-09-15 19:43:13,519 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-09-15 19:43:13,520 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:43:13,521 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:43:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-15 19:43:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-09-15 19:43:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-15 19:43:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-09-15 19:43:13,530 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 41 [2024-09-15 19:43:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:43:13,530 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-09-15 19:43:13,531 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-15 19:43:13,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-09-15 19:43:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-15 19:43:13,532 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:43:13,532 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:43:13,550 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:43:13,733 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:43:13,735 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:43:13,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 492769668, now seen corresponding path program 3 times [2024-09-15 19:43:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:43:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006882681] [2024-09-15 19:43:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:43:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:43:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:13,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:43:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:13,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-15 19:43:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:13,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:43:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:13,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-15 19:43:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:14,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 19:43:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:14,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-15 19:43:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:43:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-15 19:43:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:43:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006882681] [2024-09-15 19:43:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006882681] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:43:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888046547] [2024-09-15 19:43:14,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-15 19:43:14,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:43:14,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:43:14,042 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:43:14,044 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:43:14,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-15 19:43:14,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:43:14,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-15 19:43:14,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:43:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-15 19:43:14,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:43:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-15 19:43:14,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888046547] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:43:14,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:43:14,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 25 [2024-09-15 19:43:14,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005782034] [2024-09-15 19:43:14,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:43:14,801 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-15 19:43:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:43:14,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-15 19:43:14,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-09-15 19:43:14,802 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (14), 12 states have call predecessors, (14), 9 states have call successors, (14) [2024-09-15 19:43:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:43:15,103 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2024-09-15 19:43:15,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-15 19:43:15,104 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (14), 12 states have call predecessors, (14), 9 states have call successors, (14) Word has length 42 [2024-09-15 19:43:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:43:15,105 INFO L225 Difference]: With dead ends: 45 [2024-09-15 19:43:15,105 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 19:43:15,106 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2024-09-15 19:43:15,107 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 19:43:15,107 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 147 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 19:43:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 19:43:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 19:43:15,110 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:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 19:43:15,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-09-15 19:43:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:43:15,110 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 19:43:15,110 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 19 states have internal predecessors, (42), 9 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (14), 12 states have call predecessors, (14), 9 states have call successors, (14) [2024-09-15 19:43:15,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:43:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 19:43:15,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 19:43:15,118 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-15 19:43:15,139 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:15,319 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:15,322 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-15 19:43:15,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-15 19:43:16,065 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 19:43:16,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:43:16 BoogieIcfgContainer [2024-09-15 19:43:16,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 19:43:16,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-15 19:43:16,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-15 19:43:16,084 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-15 19:43:16,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:43:09" (3/4) ... [2024-09-15 19:43:16,087 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-15 19:43:16,091 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2024-09-15 19:43:16,091 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-15 19:43:16,091 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-15 19:43:16,094 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-15 19:43:16,094 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-15 19:43:16,094 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-15 19:43:16,094 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 19:43:16,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-15 19:43:16,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-15 19:43:16,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-15 19:43:16,183 INFO L158 Benchmark]: Toolchain (without parser) took 7749.52ms. Allocated memory was 65.0MB in the beginning and 144.7MB in the end (delta: 79.7MB). Free memory was 29.8MB in the beginning and 79.2MB in the end (delta: -49.4MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-09-15 19:43:16,183 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 44.0MB. Free memory is still 20.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:43:16,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.63ms. Allocated memory is still 65.0MB. Free memory was 29.6MB in the beginning and 36.5MB in the end (delta: -6.8MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-09-15 19:43:16,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.40ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 35.5MB in the end (delta: 941.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 19:43:16,184 INFO L158 Benchmark]: Boogie Preprocessor took 36.45ms. Allocated memory is still 65.0MB. Free memory was 35.5MB in the beginning and 33.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:43:16,184 INFO L158 Benchmark]: RCFGBuilder took 353.24ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 56.4MB in the end (delta: -22.5MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-09-15 19:43:16,185 INFO L158 Benchmark]: TraceAbstraction took 6986.72ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 56.0MB in the beginning and 83.4MB in the end (delta: -27.5MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2024-09-15 19:43:16,185 INFO L158 Benchmark]: Witness Printer took 98.86ms. Allocated memory is still 144.7MB. Free memory was 83.4MB in the beginning and 79.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-15 19:43:16,187 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 44.0MB. Free memory is still 20.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.63ms. Allocated memory is still 65.0MB. Free memory was 29.6MB in the beginning and 36.5MB in the end (delta: -6.8MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.40ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 35.5MB in the end (delta: 941.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.45ms. Allocated memory is still 65.0MB. Free memory was 35.5MB in the beginning and 33.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.24ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 56.4MB in the end (delta: -22.5MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6986.72ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 56.0MB in the beginning and 83.4MB in the end (delta: -27.5MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 98.86ms. Allocated memory is still 144.7MB. Free memory was 83.4MB in the beginning and 79.2MB 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: 36]: 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 635 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 534 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 911 IncrementalHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 101 mSDtfsCounter, 911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 273 SyntacticMatches, 16 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, InterpolantAutomatonStates: 56, 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, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 305 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 1244 SizeOfPredicates, 5 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 232/366 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: 16]: Procedure Contract for fibonacci Derived contract for procedure fibonacci. Ensures: ((((2 <= \old(n)) && (\old(n) <= ((long long) \result + 1))) || ((\old(n) <= 0) && ((\result == 1) || (\result == 0)))) || ((\result == 1) && (1 == \old(n)))) RESULT: Ultimate proved your program to be correct! [2024-09-15 19:43:16,214 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE