./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_5-1.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_5-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 2199d5dae92fc703178378f6dd7dec10a5f129181c51bc9a88c002f6d4f76a67 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:28:19,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:28:19,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:28:19,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:28:19,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:28:19,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:28:19,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:28:19,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:28:19,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:28:19,187 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:28:19,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:28:19,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:28:19,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:28:19,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:28:19,192 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:28:19,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:28:19,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:28:19,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:28:19,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:28:19,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:28:19,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:28:19,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:28:19,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:28:19,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:28:19,198 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:28:19,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:28:19,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:28:19,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:28:19,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:28:19,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:28:19,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:28:19,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:28:19,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:28:19,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:28:19,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:28:19,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:28:19,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:28:19,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:28:19,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:28:19,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:28:19,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:28:19,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:28:19,203 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 -> 2199d5dae92fc703178378f6dd7dec10a5f129181c51bc9a88c002f6d4f76a67 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:28:19,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:28:19,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:28:19,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:28:19,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:28:19,481 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:28:19,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_5-1.c [2024-09-11 20:28:20,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:28:21,056 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:28:21,057 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_5-1.c [2024-09-11 20:28:21,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/cc7e8989b/b0de3464ba344d41b919830772198080/FLAGcf3dc8af1 [2024-09-11 20:28:21,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/cc7e8989b/b0de3464ba344d41b919830772198080 [2024-09-11 20:28:21,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:28:21,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:28:21,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:28:21,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:28:21,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:28:21,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bc1e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21, skipping insertion in model container [2024-09-11 20:28:21,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:28:21,267 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_5-1.c[740,753] [2024-09-11 20:28:21,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:28:21,289 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:28:21,301 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_5-1.c[740,753] [2024-09-11 20:28:21,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:28:21,321 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:28:21,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21 WrapperNode [2024-09-11 20:28:21,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:28:21,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:28:21,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:28:21,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:28:21,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,355 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-09-11 20:28:21,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:28:21,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:28:21,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:28:21,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:28:21,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,376 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 20:28:21,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:28:21,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:28:21,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:28:21,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:28:21,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (1/1) ... [2024-09-11 20:28:21,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:28:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:21,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:28:21,424 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:28:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:28:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:28:21,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:28:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:28:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-09-11 20:28:21,467 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-09-11 20:28:21,515 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:28:21,517 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:28:21,598 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 20:28:21,598 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:28:21,618 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:28:21,618 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:28:21,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:28:21 BoogieIcfgContainer [2024-09-11 20:28:21,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:28:21,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:28:21,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:28:21,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:28:21,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:28:21" (1/3) ... [2024-09-11 20:28:21,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226134bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:28:21, skipping insertion in model container [2024-09-11 20:28:21,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:21" (2/3) ... [2024-09-11 20:28:21,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226134bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:28:21, skipping insertion in model container [2024-09-11 20:28:21,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:28:21" (3/3) ... [2024-09-11 20:28:21,626 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2024-09-11 20:28:21,639 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:28:21,639 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:28:21,682 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:28:21,688 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;@5487b497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:28:21,688 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:28:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:28:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 20:28:21,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:21,698 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:21,699 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:21,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash -798924922, now seen corresponding path program 1 times [2024-09-11 20:28:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:21,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750720054] [2024-09-11 20:28:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:21,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:28:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750720054] [2024-09-11 20:28:21,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750720054] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:28:21,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:28:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:28:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634215937] [2024-09-11 20:28:21,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:28:21,996 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:28:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:28:22,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:28:22,015 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:28:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:22,094 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-09-11 20:28:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:28:22,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-09-11 20:28:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:22,104 INFO L225 Difference]: With dead ends: 27 [2024-09-11 20:28:22,105 INFO L226 Difference]: Without dead ends: 19 [2024-09-11 20:28:22,107 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:28:22,111 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:22,113 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-11 20:28:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-09-11 20:28:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:28:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-09-11 20:28:22,160 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2024-09-11 20:28:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:22,161 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-09-11 20:28:22,161 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:28:22,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-09-11 20:28:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 20:28:22,163 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:22,163 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:22,164 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:28:22,164 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:22,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1717873930, now seen corresponding path program 1 times [2024-09-11 20:28:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:22,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528669817] [2024-09-11 20:28:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:22,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:22,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:28:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:22,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528669817] [2024-09-11 20:28:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528669817] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:28:22,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:28:22,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:28:22,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635184089] [2024-09-11 20:28:22,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:28:22,268 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:28:22,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:22,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:28:22,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:28:22,270 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:28:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:22,328 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-09-11 20:28:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:28:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-11 20:28:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:22,330 INFO L225 Difference]: With dead ends: 23 [2024-09-11 20:28:22,330 INFO L226 Difference]: Without dead ends: 19 [2024-09-11 20:28:22,331 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:28:22,332 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:22,334 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:28:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-11 20:28:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-09-11 20:28:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:28:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-09-11 20:28:22,343 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2024-09-11 20:28:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:22,343 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-09-11 20:28:22,344 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:28:22,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-09-11 20:28:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 20:28:22,346 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:22,347 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:22,347 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:28:22,347 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:22,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash 913644549, now seen corresponding path program 1 times [2024-09-11 20:28:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:22,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025567715] [2024-09-11 20:28:22,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:22,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:22,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:22,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:28:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:28:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025567715] [2024-09-11 20:28:22,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025567715] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:22,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584871952] [2024-09-11 20:28:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:22,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:22,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:22,587 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:28:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:22,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 20:28:22,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:22,746 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-11 20:28:22,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:28:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584871952] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:22,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-09-11 20:28:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817136691] [2024-09-11 20:28:22,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:22,963 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 20:28:22,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:22,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 20:28:22,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-09-11 20:28:22,965 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:28:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:23,049 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2024-09-11 20:28:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:28:23,049 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2024-09-11 20:28:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:23,050 INFO L225 Difference]: With dead ends: 34 [2024-09-11 20:28:23,050 INFO L226 Difference]: Without dead ends: 19 [2024-09-11 20:28:23,051 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:28:23,052 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:23,052 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 35 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-11 20:28:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-11 20:28:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 20:28:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-09-11 20:28:23,059 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2024-09-11 20:28:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:23,059 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-09-11 20:28:23,059 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:28:23,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-09-11 20:28:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:28:23,061 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:23,061 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:23,078 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:28:23,261 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:23,262 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:23,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash -252103063, now seen corresponding path program 1 times [2024-09-11 20:28:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589920589] [2024-09-11 20:28:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:23,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:23,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:23,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:23,418 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-11 20:28:23,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:23,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589920589] [2024-09-11 20:28:23,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589920589] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:23,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876688630] [2024-09-11 20:28:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:23,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:23,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:23,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:23,422 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:28:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:23,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 20:28:23,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:23,504 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-11 20:28:23,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:28:23,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876688630] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:23,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:23,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-09-11 20:28:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917640977] [2024-09-11 20:28:23,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:23,701 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 20:28:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 20:28:23,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:28:23,702 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 20:28:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:23,832 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-09-11 20:28:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:28:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2024-09-11 20:28:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:23,835 INFO L225 Difference]: With dead ends: 37 [2024-09-11 20:28:23,835 INFO L226 Difference]: Without dead ends: 33 [2024-09-11 20:28:23,835 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-09-11 20:28:23,836 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:23,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 55 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-11 20:28:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-11 20:28:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-09-11 20:28:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2024-09-11 20:28:23,856 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2024-09-11 20:28:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:23,857 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2024-09-11 20:28:23,857 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 20:28:23,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:23,857 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2024-09-11 20:28:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-11 20:28:23,859 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:23,860 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:23,875 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:28:24,063 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:24,064 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:24,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 659330, now seen corresponding path program 2 times [2024-09-11 20:28:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041421530] [2024-09-11 20:28:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:24,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:24,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:24,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:24,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:24,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:28:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:24,262 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-11 20:28:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041421530] [2024-09-11 20:28:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041421530] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199343373] [2024-09-11 20:28:24,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:28:24,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:24,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:24,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:24,269 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:28:24,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:28:24,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:24,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:28:24,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-11 20:28:24,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 20:28:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199343373] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:24,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:24,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-09-11 20:28:24,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273333801] [2024-09-11 20:28:24,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:24,762 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 20:28:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:24,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 20:28:24,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:28:24,763 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-11 20:28:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:24,911 INFO L93 Difference]: Finished difference Result 68 states and 105 transitions. [2024-09-11 20:28:24,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:28:24,912 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 36 [2024-09-11 20:28:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:24,913 INFO L225 Difference]: With dead ends: 68 [2024-09-11 20:28:24,913 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 20:28:24,914 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:28:24,915 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:24,915 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 56 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 20:28:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-11 20:28:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-11 20:28:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-09-11 20:28:24,923 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 36 [2024-09-11 20:28:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:24,924 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-09-11 20:28:24,924 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-11 20:28:24,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-09-11 20:28:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-09-11 20:28:24,927 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:24,927 INFO L216 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:24,943 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:28:25,130 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:25,131 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:25,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash -867130448, now seen corresponding path program 3 times [2024-09-11 20:28:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701035417] [2024-09-11 20:28:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,242 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:28:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:28:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:28:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:28:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-11 20:28:25,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701035417] [2024-09-11 20:28:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701035417] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860808972] [2024-09-11 20:28:25,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:28:25,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:25,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:25,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:25,516 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:28:25,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-09-11 20:28:25,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:25,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:28:25,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-09-11 20:28:25,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-09-11 20:28:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860808972] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:26,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2024-09-11 20:28:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564736076] [2024-09-11 20:28:26,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:26,063 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 20:28:26,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 20:28:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:28:26,066 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-11 20:28:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:26,343 INFO L93 Difference]: Finished difference Result 88 states and 132 transitions. [2024-09-11 20:28:26,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 20:28:26,344 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 92 [2024-09-11 20:28:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:26,347 INFO L225 Difference]: With dead ends: 88 [2024-09-11 20:28:26,347 INFO L226 Difference]: Without dead ends: 52 [2024-09-11 20:28:26,350 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:28:26,351 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 58 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:26,351 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 96 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:28:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-11 20:28:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-09-11 20:28:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-09-11 20:28:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-09-11 20:28:26,368 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 92 [2024-09-11 20:28:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:26,369 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-09-11 20:28:26,369 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-11 20:28:26,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-09-11 20:28:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-09-11 20:28:26,371 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:26,371 INFO L216 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:26,391 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:28:26,578 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:26,579 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:26,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1193756999, now seen corresponding path program 4 times [2024-09-11 20:28:26,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:26,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550009139] [2024-09-11 20:28:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:26,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:28:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:28:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:26,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-11 20:28:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:27,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:27,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:27,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:27,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:27,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:28:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:27,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:28:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:27,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:27,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 198 proven. 308 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2024-09-11 20:28:27,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:27,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550009139] [2024-09-11 20:28:27,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550009139] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:27,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949336900] [2024-09-11 20:28:27,207 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 20:28:27,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:27,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:27,211 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 20:28:27,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 20:28:27,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:27,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-11 20:28:27,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 356 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-09-11 20:28:27,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 383 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-09-11 20:28:28,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949336900] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:28,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:28,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 19] total 30 [2024-09-11 20:28:28,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412767106] [2024-09-11 20:28:28,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:28,803 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-11 20:28:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-11 20:28:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:28:28,807 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) [2024-09-11 20:28:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:29,118 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2024-09-11 20:28:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 20:28:29,120 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) Word has length 132 [2024-09-11 20:28:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:29,123 INFO L225 Difference]: With dead ends: 111 [2024-09-11 20:28:29,123 INFO L226 Difference]: Without dead ends: 68 [2024-09-11 20:28:29,125 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 281 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=455, Invalid=1267, Unknown=0, NotChecked=0, Total=1722 [2024-09-11 20:28:29,126 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 69 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:29,126 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 96 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:28:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-11 20:28:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-09-11 20:28:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 40 states have internal predecessors, (44), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2024-09-11 20:28:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2024-09-11 20:28:29,137 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 132 [2024-09-11 20:28:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:29,137 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2024-09-11 20:28:29,138 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) [2024-09-11 20:28:29,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-09-11 20:28:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-09-11 20:28:29,140 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:29,140 INFO L216 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:29,155 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 20:28:29,343 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 20:28:29,344 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:29,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:29,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1696376591, now seen corresponding path program 5 times [2024-09-11 20:28:29,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:29,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420975788] [2024-09-11 20:28:29,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:29,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:29,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:29,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:29,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:29,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:29,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:29,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:28:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:29,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:28:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-11 20:28:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:28:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-09-11 20:28:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420975788] [2024-09-11 20:28:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420975788] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206781676] [2024-09-11 20:28:30,124 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 20:28:30,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:30,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:30,127 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 20:28:30,208 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-09-11 20:28:30,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:30,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-11 20:28:30,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-09-11 20:28:30,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-09-11 20:28:30,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206781676] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:30,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:30,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 20 [2024-09-11 20:28:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903056023] [2024-09-11 20:28:30,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:30,765 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:28:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:28:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:28:30,766 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-11 20:28:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:30,904 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2024-09-11 20:28:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:28:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2024-09-11 20:28:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:30,908 INFO L225 Difference]: With dead ends: 72 [2024-09-11 20:28:30,908 INFO L226 Difference]: Without dead ends: 68 [2024-09-11 20:28:30,909 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:28:30,911 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:30,911 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-11 20:28:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-09-11 20:28:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 45 states have internal predecessors, (49), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) [2024-09-11 20:28:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2024-09-11 20:28:30,931 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 105 [2024-09-11 20:28:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:30,932 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2024-09-11 20:28:30,932 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-11 20:28:30,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2024-09-11 20:28:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-09-11 20:28:30,937 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:30,937 INFO L216 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:30,953 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 20:28:31,137 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:31,138 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:31,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash 725563789, now seen corresponding path program 6 times [2024-09-11 20:28:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:31,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757983728] [2024-09-11 20:28:31,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:31,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,411 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,423 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:28:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:28:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,478 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-11 20:28:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-11 20:28:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:28:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:28:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 230 proven. 170 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2024-09-11 20:28:31,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:31,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757983728] [2024-09-11 20:28:31,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757983728] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128739611] [2024-09-11 20:28:31,545 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-11 20:28:31,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:31,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:31,547 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 20:28:31,648 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2024-09-11 20:28:31,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:31,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-11 20:28:31,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 131 proven. 302 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-09-11 20:28:31,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 131 proven. 337 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-09-11 20:28:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128739611] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:32,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:32,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 15] total 23 [2024-09-11 20:28:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863347701] [2024-09-11 20:28:32,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:32,943 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-11 20:28:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:32,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-11 20:28:32,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:28:32,944 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 23 states, 22 states have (on average 3.0) internal successors, (66), 23 states have internal predecessors, (66), 18 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (29), 12 states have call predecessors, (29), 18 states have call successors, (29) [2024-09-11 20:28:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:33,207 INFO L93 Difference]: Finished difference Result 127 states and 185 transitions. [2024-09-11 20:28:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 20:28:33,208 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.0) internal successors, (66), 23 states have internal predecessors, (66), 18 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (29), 12 states have call predecessors, (29), 18 states have call successors, (29) Word has length 132 [2024-09-11 20:28:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:33,209 INFO L225 Difference]: With dead ends: 127 [2024-09-11 20:28:33,209 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:28:33,211 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 284 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:28:33,211 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:33,211 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 124 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:28:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:28:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:28:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:28:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:28:33,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2024-09-11 20:28:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:33,212 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:28:33,213 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.0) internal successors, (66), 23 states have internal predecessors, (66), 18 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (29), 12 states have call predecessors, (29), 18 states have call successors, (29) [2024-09-11 20:28:33,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:28:33,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:28:33,216 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:28:33,233 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:28:33,420 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:33,424 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2024-09-11 20:28:33,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:28:34,557 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:28:34,574 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-11 20:28:34,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:28:34 BoogieIcfgContainer [2024-09-11 20:28:34,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:28:34,576 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:28:34,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:28:34,577 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:28:34,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:28:21" (3/4) ... [2024-09-11 20:28:34,579 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:28:34,582 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo [2024-09-11 20:28:34,585 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:28:34,585 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:28:34,585 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:28:34,586 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:28:34,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:28:34,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:28:34,663 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:28:34,664 INFO L158 Benchmark]: Toolchain (without parser) took 13577.96ms. Allocated memory was 144.7MB in the beginning and 230.7MB in the end (delta: 86.0MB). Free memory was 90.4MB in the beginning and 95.8MB in the end (delta: -5.4MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2024-09-11 20:28:34,664 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:28:34,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.39ms. Allocated memory is still 144.7MB. Free memory was 90.4MB in the beginning and 78.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:28:34,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.05ms. Allocated memory is still 144.7MB. Free memory was 78.9MB in the beginning and 77.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:28:34,665 INFO L158 Benchmark]: Boogie Preprocessor took 26.26ms. Allocated memory is still 144.7MB. Free memory was 77.3MB in the beginning and 75.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:28:34,665 INFO L158 Benchmark]: RCFGBuilder took 234.60ms. Allocated memory is still 144.7MB. Free memory was 75.8MB in the beginning and 65.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:28:34,666 INFO L158 Benchmark]: TraceAbstraction took 12955.23ms. Allocated memory was 144.7MB in the beginning and 230.7MB in the end (delta: 86.0MB). Free memory was 64.7MB in the beginning and 100.0MB in the end (delta: -35.3MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2024-09-11 20:28:34,666 INFO L158 Benchmark]: Witness Printer took 87.05ms. Allocated memory is still 230.7MB. Free memory was 100.0MB in the beginning and 95.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:28:34,668 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.19ms. Allocated memory is still 144.7MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.39ms. Allocated memory is still 144.7MB. Free memory was 90.4MB in the beginning and 78.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.05ms. Allocated memory is still 144.7MB. Free memory was 78.9MB in the beginning and 77.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.26ms. Allocated memory is still 144.7MB. Free memory was 77.3MB in the beginning and 75.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.60ms. Allocated memory is still 144.7MB. Free memory was 75.8MB in the beginning and 65.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12955.23ms. Allocated memory was 144.7MB in the beginning and 230.7MB in the end (delta: 86.0MB). Free memory was 64.7MB in the beginning and 100.0MB in the end (delta: -35.3MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Witness Printer took 87.05ms. Allocated memory is still 230.7MB. Free memory was 100.0MB in the beginning and 95.8MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 29]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 9, TraceHistogramMax: 19, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 908 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 749 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1384 IncrementalHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 159 mSDtfsCounter, 1384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1370 GetRequests, 1180 SyntacticMatches, 27 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=8, 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, 9 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1103 NumberOfCodeBlocks, 1049 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1622 ConstructedInterpolants, 0 QuantifiedInterpolants, 3350 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1195 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 6101/8805 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (5 <= x) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo Derived contract for procedure fibo. Ensures: (((\result == 1) || (1 != \old(n))) && ((0 < \old(n)) || (\result == 0))) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:28:34,700 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