./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-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_2calls_4-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 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 --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:27:11,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:27:12,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:27:12,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:27:12,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:27:12,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:27:12,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:27:12,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:27:12,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:27:12,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:27:12,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:27:12,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:27:12,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:27:12,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:27:12,108 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:27:12,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:27:12,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:27:12,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:27:12,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:27:12,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:27:12,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:27:12,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:27:12,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:27:12,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:27:12,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:27:12,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:27:12,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:27:12,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:27:12,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:27:12,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:27:12,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:27:12,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:27:12,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:27:12,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:27:12,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:27:12,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:27:12,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:27:12,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:27:12,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:27:12,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:27:12,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:27:12,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:27:12,119 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 -> 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 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:27:12,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:27:12,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:27:12,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:27:12,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:27:12,393 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:27:12,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2024-09-11 20:27:13,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:27:13,973 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:27:13,974 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2024-09-11 20:27:13,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8ddb27772/2fee71d924854671ae801d2b2bde5565/FLAG42e0284bb [2024-09-11 20:27:14,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8ddb27772/2fee71d924854671ae801d2b2bde5565 [2024-09-11 20:27:14,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:27:14,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:27:14,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:27:14,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:27:14,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:27:14,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5cae61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14, skipping insertion in model container [2024-09-11 20:27:14,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:27:14,197 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_2calls_4-1.c[946,959] [2024-09-11 20:27:14,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:27:14,213 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:27:14,224 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_2calls_4-1.c[946,959] [2024-09-11 20:27:14,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:27:14,239 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:27:14,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14 WrapperNode [2024-09-11 20:27:14,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:27:14,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:27:14,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:27:14,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:27:14,249 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:27:14" (1/1) ... [2024-09-11 20:27:14,263 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:27:14" (1/1) ... [2024-09-11 20:27:14,280 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-09-11 20:27:14,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:27:14,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:27:14,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:27:14,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:27:14,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,310 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:27:14,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:27:14,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:27:14,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:27:14,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:27:14,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (1/1) ... [2024-09-11 20:27:14,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:27:14,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:14,358 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:27:14,362 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:27:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:27:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:27:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-09-11 20:27:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-09-11 20:27:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-09-11 20:27:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-09-11 20:27:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:27:14,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:27:14,466 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:27:14,467 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:27:14,582 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-11 20:27:14,582 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:27:14,604 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:27:14,605 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:27:14,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:27:14 BoogieIcfgContainer [2024-09-11 20:27:14,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:27:14,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:27:14,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:27:14,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:27:14,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:27:14" (1/3) ... [2024-09-11 20:27:14,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52402da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:27:14, skipping insertion in model container [2024-09-11 20:27:14,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:27:14" (2/3) ... [2024-09-11 20:27:14,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52402da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:27:14, skipping insertion in model container [2024-09-11 20:27:14,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:27:14" (3/3) ... [2024-09-11 20:27:14,613 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2024-09-11 20:27:14,627 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:27:14,627 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:27:14,675 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:27:14,681 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;@3308a196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:27:14,681 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:27:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:27:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 20:27:14,689 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:14,690 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:14,690 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:14,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:14,694 INFO L85 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2024-09-11 20:27:14,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006229924] [2024-09-11 20:27:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:14,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:14,962 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:27:14,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:14,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006229924] [2024-09-11 20:27:14,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006229924] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:27:14,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:27:14,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:27:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75743763] [2024-09-11 20:27:14,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:27:14,973 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:27:14,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:27:14,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:27:14,992 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:27:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:15,098 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2024-09-11 20:27:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:27:15,101 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:27:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:15,110 INFO L225 Difference]: With dead ends: 36 [2024-09-11 20:27:15,110 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:27:15,113 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:27:15,119 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:15,120 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:27:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:27:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-09-11 20:27:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-11 20:27:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-09-11 20:27:15,161 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2024-09-11 20:27:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:15,162 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-09-11 20:27:15,162 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:27:15,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-09-11 20:27:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 20:27:15,164 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:15,164 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:15,164 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:27:15,165 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:15,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:15,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2024-09-11 20:27:15,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:15,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102338659] [2024-09-11 20:27:15,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:15,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:15,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:15,273 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:27:15,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:15,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102338659] [2024-09-11 20:27:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102338659] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:27:15,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:27:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:27:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036906597] [2024-09-11 20:27:15,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:27:15,275 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:27:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:27:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:27:15,277 INFO L87 Difference]: Start difference. First operand 26 states and 33 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:27:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:15,350 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-09-11 20:27:15,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:27:15,351 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:27:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:15,352 INFO L225 Difference]: With dead ends: 32 [2024-09-11 20:27:15,352 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:27:15,353 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:27:15,354 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:15,354 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:27:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:27:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-09-11 20:27:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-11 20:27:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-09-11 20:27:15,364 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2024-09-11 20:27:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:15,365 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-09-11 20:27:15,365 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:27:15,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-09-11 20:27:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 20:27:15,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:15,367 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:15,367 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:27:15,368 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:15,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2024-09-11 20:27:15,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:15,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229291911] [2024-09-11 20:27:15,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:15,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:15,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:15,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:15,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:27:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:27:15,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:15,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229291911] [2024-09-11 20:27:15,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229291911] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:15,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182267026] [2024-09-11 20:27:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:15,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:15,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:15,620 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:27:15,623 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:27:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:15,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 20:27:15,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:27:15,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:27:16,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182267026] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:16,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:16,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-09-11 20:27:16,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017133682] [2024-09-11 20:27:16,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:16,014 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 20:27:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 20:27:16,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-11 20:27:16,015 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 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:27:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:16,171 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-09-11 20:27:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:27:16,172 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 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:27:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:16,173 INFO L225 Difference]: With dead ends: 54 [2024-09-11 20:27:16,173 INFO L226 Difference]: Without dead ends: 30 [2024-09-11 20:27:16,174 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:27:16,175 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:16,175 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:27:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-11 20:27:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-09-11 20:27:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-11 20:27:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-09-11 20:27:16,189 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2024-09-11 20:27:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:16,190 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-09-11 20:27:16,190 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 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:27:16,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-09-11 20:27:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:27:16,192 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:16,192 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:16,210 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:27:16,397 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:27:16,397 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:16,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2024-09-11 20:27:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:16,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767244059] [2024-09-11 20:27:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:16,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:16,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:16,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:27:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:16,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767244059] [2024-09-11 20:27:16,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767244059] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:16,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942820795] [2024-09-11 20:27:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:16,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:16,600 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:27:16,604 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:27:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:16,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 20:27:16,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:27:16,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:27:16,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942820795] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:16,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:16,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-09-11 20:27:16,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156949457] [2024-09-11 20:27:16,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:16,888 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 20:27:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:16,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 20:27:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-11 20:27:16,893 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 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:27:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:17,107 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2024-09-11 20:27:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:27:17,108 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 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:27:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:17,113 INFO L225 Difference]: With dead ends: 52 [2024-09-11 20:27:17,113 INFO L226 Difference]: Without dead ends: 48 [2024-09-11 20:27:17,113 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:27:17,114 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:17,115 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 123 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-11 20:27:17,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-09-11 20:27:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-11 20:27:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-09-11 20:27:17,135 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2024-09-11 20:27:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:17,136 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-09-11 20:27:17,136 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 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:27:17,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-09-11 20:27:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:27:17,140 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:17,140 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:17,156 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:27:17,344 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:27:17,345 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:17,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2024-09-11 20:27:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:17,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607430472] [2024-09-11 20:27:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:17,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:17,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:17,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:17,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:17,491 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:27:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:17,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 20:27:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:27:17,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607430472] [2024-09-11 20:27:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607430472] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23703706] [2024-09-11 20:27:17,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:17,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:17,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:17,505 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:27:17,510 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:27:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:17,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:27:17,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 20:27:17,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:27:17,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23703706] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:17,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:17,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-09-11 20:27:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825745089] [2024-09-11 20:27:17,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:17,969 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:27:17,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:17,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:27:17,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:27:17,970 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-11 20:27:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:18,193 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2024-09-11 20:27:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:27:18,194 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2024-09-11 20:27:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:18,195 INFO L225 Difference]: With dead ends: 108 [2024-09-11 20:27:18,196 INFO L226 Difference]: Without dead ends: 64 [2024-09-11 20:27:18,197 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:27:18,201 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:18,201 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 106 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:27:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-11 20:27:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-11 20:27:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2024-09-11 20:27:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-09-11 20:27:18,226 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 35 [2024-09-11 20:27:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:18,227 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-09-11 20:27:18,227 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-11 20:27:18,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-09-11 20:27:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-11 20:27:18,231 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:18,231 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:18,247 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:27:18,432 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:27:18,432 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:18,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2024-09-11 20:27:18,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:18,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000573133] [2024-09-11 20:27:18,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:18,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:18,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:18,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:18,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:18,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:18,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-11 20:27:18,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:18,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000573133] [2024-09-11 20:27:18,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000573133] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:18,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669703498] [2024-09-11 20:27:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:18,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:18,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:18,571 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:27:18,573 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:27:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:18,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:27:18,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:27:18,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:27:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669703498] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:19,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2024-09-11 20:27:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999734675] [2024-09-11 20:27:19,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:19,021 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 20:27:19,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 20:27:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:27:19,022 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-11 20:27:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:19,294 INFO L93 Difference]: Finished difference Result 178 states and 324 transitions. [2024-09-11 20:27:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:27:19,295 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) Word has length 36 [2024-09-11 20:27:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:19,298 INFO L225 Difference]: With dead ends: 178 [2024-09-11 20:27:19,298 INFO L226 Difference]: Without dead ends: 118 [2024-09-11 20:27:19,301 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:27:19,302 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:19,302 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 174 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-09-11 20:27:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-09-11 20:27:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 states have internal predecessors, (77), 21 states have call successors, (21), 7 states have call predecessors, (21), 14 states have return successors, (63), 25 states have call predecessors, (63), 21 states have call successors, (63) [2024-09-11 20:27:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 161 transitions. [2024-09-11 20:27:19,335 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 161 transitions. Word has length 36 [2024-09-11 20:27:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:19,336 INFO L474 AbstractCegarLoop]: Abstraction has 99 states and 161 transitions. [2024-09-11 20:27:19,336 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-11 20:27:19,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 161 transitions. [2024-09-11 20:27:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:27:19,339 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:19,339 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:19,356 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:27:19,539 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:27:19,540 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:19,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2024-09-11 20:27:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988655373] [2024-09-11 20:27:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:19,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:19,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:19,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:19,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:19,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:19,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:19,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:27:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-11 20:27:19,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988655373] [2024-09-11 20:27:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988655373] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:19,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125109593] [2024-09-11 20:27:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:19,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:19,763 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:27:19,765 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:27:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:19,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:27:19,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-11 20:27:19,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-11 20:27:20,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125109593] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:20,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:20,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-09-11 20:27:20,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879367167] [2024-09-11 20:27:20,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:20,197 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 20:27:20,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:20,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 20:27:20,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:27:20,198 INFO L87 Difference]: Start difference. First operand 99 states and 161 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2024-09-11 20:27:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:20,484 INFO L93 Difference]: Finished difference Result 261 states and 509 transitions. [2024-09-11 20:27:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:27:20,484 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) Word has length 50 [2024-09-11 20:27:20,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:20,488 INFO L225 Difference]: With dead ends: 261 [2024-09-11 20:27:20,488 INFO L226 Difference]: Without dead ends: 164 [2024-09-11 20:27:20,489 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:27:20,491 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:20,491 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 184 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-09-11 20:27:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2024-09-11 20:27:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 90 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 18 states have return successors, (103), 37 states have call predecessors, (103), 31 states have call successors, (103) [2024-09-11 20:27:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 240 transitions. [2024-09-11 20:27:20,522 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 240 transitions. Word has length 50 [2024-09-11 20:27:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:20,522 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 240 transitions. [2024-09-11 20:27:20,523 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2024-09-11 20:27:20,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 240 transitions. [2024-09-11 20:27:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-11 20:27:20,525 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:20,525 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:20,541 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 20:27:20,726 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:27:20,726 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:20,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1667877015, now seen corresponding path program 1 times [2024-09-11 20:27:20,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:20,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069250098] [2024-09-11 20:27:20,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:20,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:20,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:20,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:20,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:20,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:20,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:20,930 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:20,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:27:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069250098] [2024-09-11 20:27:20,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069250098] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:20,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866275346] [2024-09-11 20:27:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:20,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:20,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:20,966 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:27:20,968 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:27:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:21,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 20:27:21,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-11 20:27:21,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-11 20:27:21,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866275346] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:21,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2024-09-11 20:27:21,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849454315] [2024-09-11 20:27:21,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:21,253 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 20:27:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:21,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 20:27:21,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:27:21,254 INFO L87 Difference]: Start difference. First operand 138 states and 240 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-09-11 20:27:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:21,576 INFO L93 Difference]: Finished difference Result 343 states and 696 transitions. [2024-09-11 20:27:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:27:21,577 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Word has length 51 [2024-09-11 20:27:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:21,579 INFO L225 Difference]: With dead ends: 343 [2024-09-11 20:27:21,579 INFO L226 Difference]: Without dead ends: 116 [2024-09-11 20:27:21,582 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:27:21,582 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:21,583 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 239 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-09-11 20:27:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2024-09-11 20:27:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 61 states have internal predecessors, (71), 20 states have call successors, (20), 7 states have call predecessors, (20), 12 states have return successors, (64), 24 states have call predecessors, (64), 20 states have call successors, (64) [2024-09-11 20:27:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 155 transitions. [2024-09-11 20:27:21,600 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 155 transitions. Word has length 51 [2024-09-11 20:27:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:21,601 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 155 transitions. [2024-09-11 20:27:21,601 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-09-11 20:27:21,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 155 transitions. [2024-09-11 20:27:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-09-11 20:27:21,603 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:21,603 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:21,619 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:27:21,803 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:27:21,804 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:21,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1066935479, now seen corresponding path program 2 times [2024-09-11 20:27:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:21,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127072014] [2024-09-11 20:27:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:21,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:21,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:21,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:22,019 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:22,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:22,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:22,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:22,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:22,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:22,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:22,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 44 proven. 42 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-11 20:27:22,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127072014] [2024-09-11 20:27:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127072014] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870788867] [2024-09-11 20:27:22,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:27:22,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:22,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:22,125 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:27:22,127 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:27:22,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:27:22,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:27:22,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:27:22,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 47 proven. 14 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-09-11 20:27:22,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-11 20:27:22,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870788867] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:22,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:22,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 22 [2024-09-11 20:27:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513726707] [2024-09-11 20:27:22,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:22,667 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-11 20:27:22,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-11 20:27:22,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:27:22,670 INFO L87 Difference]: Start difference. First operand 93 states and 155 transitions. Second operand has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 states have internal predecessors, (71), 14 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (26), 16 states have call predecessors, (26), 14 states have call successors, (26) [2024-09-11 20:27:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:23,035 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2024-09-11 20:27:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-11 20:27:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 states have internal predecessors, (71), 14 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (26), 16 states have call predecessors, (26), 14 states have call successors, (26) Word has length 78 [2024-09-11 20:27:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:23,038 INFO L225 Difference]: With dead ends: 188 [2024-09-11 20:27:23,038 INFO L226 Difference]: Without dead ends: 85 [2024-09-11 20:27:23,040 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2024-09-11 20:27:23,040 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:23,041 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 228 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:27:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-09-11 20:27:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2024-09-11 20:27:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31) [2024-09-11 20:27:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2024-09-11 20:27:23,051 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 78 [2024-09-11 20:27:23,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:23,052 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2024-09-11 20:27:23,052 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 states have internal predecessors, (71), 14 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (26), 16 states have call predecessors, (26), 14 states have call successors, (26) [2024-09-11 20:27:23,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2024-09-11 20:27:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-09-11 20:27:23,053 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:23,053 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:23,072 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:27:23,254 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:27:23,255 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:23,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:23,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1164844098, now seen corresponding path program 1 times [2024-09-11 20:27:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822757960] [2024-09-11 20:27:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:23,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:27:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 20:27:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-09-11 20:27:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822757960] [2024-09-11 20:27:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822757960] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366510674] [2024-09-11 20:27:23,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:23,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:23,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:23,669 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:27:23,670 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-11 20:27:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:23,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-11 20:27:23,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-09-11 20:27:23,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-09-11 20:27:24,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366510674] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:24,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:24,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2024-09-11 20:27:24,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066446927] [2024-09-11 20:27:24,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:24,061 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 20:27:24,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 20:27:24,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:27:24,062 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-11 20:27:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:24,188 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2024-09-11 20:27:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 20:27:24,188 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) Word has length 64 [2024-09-11 20:27:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:24,190 INFO L225 Difference]: With dead ends: 93 [2024-09-11 20:27:24,190 INFO L226 Difference]: Without dead ends: 89 [2024-09-11 20:27:24,191 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:27:24,192 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:24,192 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 583 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:27:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-11 20:27:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-09-11 20:27:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 57 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (38), 20 states have call predecessors, (38), 14 states have call successors, (38) [2024-09-11 20:27:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-09-11 20:27:24,212 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 64 [2024-09-11 20:27:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:24,213 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-09-11 20:27:24,213 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-11 20:27:24,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-09-11 20:27:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-09-11 20:27:24,215 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:27:24,215 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:24,228 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 20:27:24,418 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:24,419 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:27:24,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:24,420 INFO L85 PathProgramCache]: Analyzing trace with hash -976355400, now seen corresponding path program 1 times [2024-09-11 20:27:24,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:27:24,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516099841] [2024-09-11 20:27:24,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:24,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:27:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:27:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:27:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:27:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:27:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:27:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-11 20:27:24,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:27:24,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516099841] [2024-09-11 20:27:24,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516099841] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:27:24,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937917585] [2024-09-11 20:27:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:27:24,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:27:24,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:27:24,590 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:27:24,592 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 20:27:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:27:24,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 20:27:24,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:27:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-11 20:27:24,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:27:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-11 20:27:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937917585] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:27:25,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:27:25,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2024-09-11 20:27:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277360242] [2024-09-11 20:27:25,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:27:25,198 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 20:27:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:27:25,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 20:27:25,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:27:25,199 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2024-09-11 20:27:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:27:25,394 INFO L93 Difference]: Finished difference Result 158 states and 233 transitions. [2024-09-11 20:27:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:27:25,395 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) Word has length 65 [2024-09-11 20:27:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:27:25,396 INFO L225 Difference]: With dead ends: 158 [2024-09-11 20:27:25,396 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:27:25,397 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:27:25,397 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:27:25,398 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 171 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:27:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:27:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:27:25,399 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:27:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:27:25,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2024-09-11 20:27:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:27:25,399 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:27:25,400 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 11 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2024-09-11 20:27:25,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:27:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:27:25,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:27:25,402 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:27:25,419 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-11 20:27:25,603 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-11 20:27:25,608 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:27:25,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:27:27,945 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:27:27,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:27:27 BoogieIcfgContainer [2024-09-11 20:27:27,965 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:27:27,966 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:27:27,966 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:27:27,966 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:27:27,967 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:27:14" (3/4) ... [2024-09-11 20:27:27,969 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:27:27,972 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2024-09-11 20:27:27,972 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2024-09-11 20:27:27,975 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:27:27,975 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:27:27,975 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:27:27,975 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:27:28,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:27:28,059 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:27:28,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:27:28,060 INFO L158 Benchmark]: Toolchain (without parser) took 14052.63ms. Allocated memory was 146.8MB in the beginning and 325.1MB in the end (delta: 178.3MB). Free memory was 102.0MB in the beginning and 121.6MB in the end (delta: -19.6MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. [2024-09-11 20:27:28,060 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:27:28,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.49ms. Allocated memory is still 146.8MB. Free memory was 102.0MB in the beginning and 90.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:27:28,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.31ms. Allocated memory is still 146.8MB. Free memory was 90.6MB in the beginning and 89.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:27:28,060 INFO L158 Benchmark]: Boogie Preprocessor took 41.31ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 87.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:27:28,061 INFO L158 Benchmark]: RCFGBuilder took 282.23ms. Allocated memory is still 146.8MB. Free memory was 87.7MB in the beginning and 76.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:27:28,061 INFO L158 Benchmark]: TraceAbstraction took 13358.44ms. Allocated memory was 146.8MB in the beginning and 325.1MB in the end (delta: 178.3MB). Free memory was 75.5MB in the beginning and 126.8MB in the end (delta: -51.3MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. [2024-09-11 20:27:28,062 INFO L158 Benchmark]: Witness Printer took 93.24ms. Allocated memory is still 325.1MB. Free memory was 126.8MB in the beginning and 121.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:27:28,063 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.21ms. Allocated memory is still 146.8MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.49ms. Allocated memory is still 146.8MB. Free memory was 102.0MB in the beginning and 90.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.31ms. Allocated memory is still 146.8MB. Free memory was 90.6MB in the beginning and 89.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.31ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 87.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 282.23ms. Allocated memory is still 146.8MB. Free memory was 87.7MB in the beginning and 76.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13358.44ms. Allocated memory was 146.8MB in the beginning and 325.1MB in the end (delta: 178.3MB). Free memory was 75.5MB in the beginning and 126.8MB in the end (delta: -51.3MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. * Witness Printer took 93.24ms. Allocated memory is still 325.1MB. Free memory was 126.8MB in the beginning and 121.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: 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 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 2068 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1780 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2330 IncrementalHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 288 mSDtfsCounter, 2330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1106 GetRequests, 899 SyntacticMatches, 27 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=7, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 90 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 867 NumberOfCodeBlocks, 867 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1262 ConstructedInterpolants, 0 QuantifiedInterpolants, 2710 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 926/1284 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: 40]: Location Invariant Derived location invariant: (4 <= x) - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Ensures: (((((\result == 1) && (\old(n) == 1)) || (\result == 0)) || (1 < \old(n))) && (((((\result == 1) && (\old(n) == 1)) || (\old(n) < 1)) || (3 < \old(n))) || ((\result == 1) && (2 == \old(n))))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: (((((\result == 1) || (\old(n) < 1)) || (2 < \old(n))) && (((\result == 0) || (1 < \old(n))) || (\old(n) == 1))) && ((((3 == \old(n)) || (4 < \old(n))) || (\old(n) < 2)) || ((3 == \result) && (\old(n) == 4)))) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:27:28,094 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