./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/id_i5_o5-2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1be5a7d97aa41e02c549ddce0b54861696e25bfa9b91d41dbf151eb81f7686c7 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:09:19,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:09:19,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:09:19,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:09:19,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:09:19,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:09:19,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:09:19,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:09:19,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:09:19,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:09:19,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:09:19,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:09:19,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:09:19,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:09:19,942 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:09:19,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:09:19,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:09:19,942 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:09:19,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:09:19,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:09:19,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:09:19,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:09:19,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:09:19,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:09:19,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:09:19,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:09:19,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:09:19,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:09:19,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:09:19,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:09:19,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:09:19,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:09:19,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:19,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:09:19,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:09:19,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:09:19,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:09:19,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:09:19,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:09:19,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:09:19,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:09:19,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:09:19,948 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 -> 1be5a7d97aa41e02c549ddce0b54861696e25bfa9b91d41dbf151eb81f7686c7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:09:20,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:09:20,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:09:20,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:09:20,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:09:20,190 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:09:20,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2024-09-25 00:09:20,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:09:22,279 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:09:22,280 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2024-09-25 00:09:22,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f87ead22b/ff174c05f45f4419b70bf690ccaab341/FLAG1ab159381 [2024-09-25 00:09:22,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f87ead22b/ff174c05f45f4419b70bf690ccaab341 [2024-09-25 00:09:22,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:09:22,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:09:22,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:22,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:09:22,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:09:22,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7297c1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22, skipping insertion in model container [2024-09-25 00:09:22,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:09:22,885 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id_i5_o5-2.c[450,463] [2024-09-25 00:09:22,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:22,908 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:09:22,920 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id_i5_o5-2.c[450,463] [2024-09-25 00:09:22,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:22,934 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:09:22,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22 WrapperNode [2024-09-25 00:09:22,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:22,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:22,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:09:22,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:09:22,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,957 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:09:22,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:22,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:09:22,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:09:22,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:09:22,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,980 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-25 00:09:22,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:09:22,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:09:22,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:09:22,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:09:22,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (1/1) ... [2024-09-25 00:09:22,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:23,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:23,019 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-25 00:09:23,021 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-25 00:09:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:09:23,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:09:23,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:09:23,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:09:23,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:09:23,058 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:09:23,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:09:23,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:09:23,058 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-25 00:09:23,058 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-25 00:09:23,118 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:09:23,120 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:09:23,234 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 00:09:23,234 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:09:23,256 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:09:23,257 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:09:23,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:23 BoogieIcfgContainer [2024-09-25 00:09:23,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:09:23,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:09:23,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:09:23,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:09:23,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:09:22" (1/3) ... [2024-09-25 00:09:23,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34274ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:23, skipping insertion in model container [2024-09-25 00:09:23,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:22" (2/3) ... [2024-09-25 00:09:23,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34274ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:23, skipping insertion in model container [2024-09-25 00:09:23,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:23" (3/3) ... [2024-09-25 00:09:23,266 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2024-09-25 00:09:23,282 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:09:23,283 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:09:23,334 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:09:23,342 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;@74ec00c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:09:23,343 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:09:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 00:09:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 00:09:23,353 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:23,353 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:23,354 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:23,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2082045565, now seen corresponding path program 1 times [2024-09-25 00:09:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:23,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241598076] [2024-09-25 00:09:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:23,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:23,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:23,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:23,620 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-25 00:09:23,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:23,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241598076] [2024-09-25 00:09:23,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241598076] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:09:23,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:09:23,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:09:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600768514] [2024-09-25 00:09:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:09:23,628 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:09:23,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:09:23,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:09:23,649 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:09:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:23,692 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-09-25 00:09:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:09:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-09-25 00:09:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:23,702 INFO L225 Difference]: With dead ends: 30 [2024-09-25 00:09:23,702 INFO L226 Difference]: Without dead ends: 18 [2024-09-25 00:09:23,704 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-25 00:09:23,707 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:23,708 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-25 00:09:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-25 00:09:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:09:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-09-25 00:09:23,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2024-09-25 00:09:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:23,739 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-09-25 00:09:23,739 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:09:23,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-09-25 00:09:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 00:09:23,742 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:23,742 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:23,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:09:23,742 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:23,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:23,743 INFO L85 PathProgramCache]: Analyzing trace with hash -799337521, now seen corresponding path program 1 times [2024-09-25 00:09:23,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:23,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260393265] [2024-09-25 00:09:23,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:23,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:23,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:23,886 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:23,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,036 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-25 00:09:24,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260393265] [2024-09-25 00:09:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260393265] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466296800] [2024-09-25 00:09:24,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:24,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:24,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:24,041 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-25 00:09:24,043 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-25 00:09:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 00:09:24,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 00:09:24,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:24,329 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-25 00:09:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466296800] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:24,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:24,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-09-25 00:09:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352005666] [2024-09-25 00:09:24,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:24,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 00:09:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:24,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 00:09:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-09-25 00:09:24,332 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:09:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:24,387 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-09-25 00:09:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:09:24,388 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 19 [2024-09-25 00:09:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:24,388 INFO L225 Difference]: With dead ends: 25 [2024-09-25 00:09:24,388 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 00:09:24,389 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:09:24,390 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:24,390 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 50 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 00:09:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-25 00:09:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 00:09:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-25 00:09:24,395 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2024-09-25 00:09:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:24,395 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-25 00:09:24,395 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:09:24,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-25 00:09:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 00:09:24,397 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:24,397 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:24,411 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:09:24,601 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:24,602 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:24,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1955994435, now seen corresponding path program 2 times [2024-09-25 00:09:24,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:24,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862846059] [2024-09-25 00:09:24,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:24,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:09:24,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:24,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862846059] [2024-09-25 00:09:24,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862846059] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:24,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633047809] [2024-09-25 00:09:24,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:09:24,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:24,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:24,842 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-25 00:09:24,844 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-25 00:09:24,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:09:24,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:24,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:09:24,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 00:09:24,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 00:09:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633047809] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:25,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:25,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 14 [2024-09-25 00:09:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113358512] [2024-09-25 00:09:25,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:25,208 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 00:09:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:25,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 00:09:25,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-09-25 00:09:25,210 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-25 00:09:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:25,273 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-09-25 00:09:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:09:25,273 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 25 [2024-09-25 00:09:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:25,274 INFO L225 Difference]: With dead ends: 28 [2024-09-25 00:09:25,274 INFO L226 Difference]: Without dead ends: 24 [2024-09-25 00:09:25,275 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-09-25 00:09:25,276 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:25,276 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-25 00:09:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-25 00:09:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 00:09:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-09-25 00:09:25,281 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2024-09-25 00:09:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:25,281 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-09-25 00:09:25,281 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-25 00:09:25,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-09-25 00:09:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 00:09:25,282 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:25,282 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:25,295 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:25,486 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:25,486 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:25,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1072241521, now seen corresponding path program 3 times [2024-09-25 00:09:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:25,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205573913] [2024-09-25 00:09:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:25,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,577 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:09:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205573913] [2024-09-25 00:09:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205573913] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973871471] [2024-09-25 00:09:25,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:09:25,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:25,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:25,666 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-25 00:09:25,668 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-25 00:09:25,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 00:09:25,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:25,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 00:09:25,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:09:25,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:09:26,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973871471] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:26,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:26,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 16 [2024-09-25 00:09:26,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366374041] [2024-09-25 00:09:26,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:26,170 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 00:09:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:26,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 00:09:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-09-25 00:09:26,172 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-25 00:09:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:26,244 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-09-25 00:09:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 00:09:26,245 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) Word has length 31 [2024-09-25 00:09:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:26,246 INFO L225 Difference]: With dead ends: 31 [2024-09-25 00:09:26,246 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 00:09:26,247 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-09-25 00:09:26,247 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:26,248 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 74 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 00:09:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-25 00:09:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 00:09:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-25 00:09:26,256 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2024-09-25 00:09:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:26,257 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-25 00:09:26,257 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-25 00:09:26,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-25 00:09:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 00:09:26,258 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:26,258 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:26,273 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 00:09:26,459 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:26,460 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:26,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:26,461 INFO L85 PathProgramCache]: Analyzing trace with hash -790562051, now seen corresponding path program 4 times [2024-09-25 00:09:26,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:26,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047698344] [2024-09-25 00:09:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-25 00:09:26,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:26,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047698344] [2024-09-25 00:09:26,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047698344] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:26,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428201689] [2024-09-25 00:09:26,668 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 00:09:26,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:26,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:26,670 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-25 00:09:26,671 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-25 00:09:26,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 00:09:26,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:26,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 00:09:26,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 00:09:26,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 00:09:27,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428201689] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:27,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:27,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 17 [2024-09-25 00:09:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747170567] [2024-09-25 00:09:27,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:27,337 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 00:09:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:27,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 00:09:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:09:27,338 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) [2024-09-25 00:09:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:27,396 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-09-25 00:09:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:09:27,397 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) Word has length 37 [2024-09-25 00:09:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:27,398 INFO L225 Difference]: With dead ends: 34 [2024-09-25 00:09:27,398 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 00:09:27,398 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2024-09-25 00:09:27,399 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:27,399 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 97 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 00:09:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-25 00:09:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 00:09:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-09-25 00:09:27,405 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2024-09-25 00:09:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:27,405 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-09-25 00:09:27,406 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) [2024-09-25 00:09:27,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-09-25 00:09:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 00:09:27,408 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:27,408 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:27,421 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 00:09:27,612 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:27,613 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:27,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash 446137679, now seen corresponding path program 5 times [2024-09-25 00:09:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723333601] [2024-09-25 00:09:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-25 00:09:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723333601] [2024-09-25 00:09:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723333601] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255677455] [2024-09-25 00:09:27,960 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 00:09:27,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:27,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:27,961 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-25 00:09:27,963 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-25 00:09:28,005 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-09-25 00:09:28,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:28,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 00:09:28,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 00:09:28,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 00:09:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255677455] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:28,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:28,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 17 [2024-09-25 00:09:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324767154] [2024-09-25 00:09:28,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:28,186 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 00:09:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:28,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 00:09:28,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:09:28,187 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 7 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 00:09:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:28,386 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-09-25 00:09:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 00:09:28,386 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 7 states have call predecessors, (8), 1 states have call successors, (8) Word has length 43 [2024-09-25 00:09:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:28,387 INFO L225 Difference]: With dead ends: 37 [2024-09-25 00:09:28,387 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 00:09:28,388 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2024-09-25 00:09:28,388 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:28,389 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 208 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 00:09:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-25 00:09:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-25 00:09:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-09-25 00:09:28,400 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2024-09-25 00:09:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:28,401 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-09-25 00:09:28,401 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 7 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 00:09:28,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-09-25 00:09:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 00:09:28,404 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:28,404 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:28,418 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 00:09:28,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 00:09:28,605 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:28,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1764409661, now seen corresponding path program 6 times [2024-09-25 00:09:28,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:28,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383643056] [2024-09-25 00:09:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:28,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 45 proven. 18 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-09-25 00:09:28,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:28,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383643056] [2024-09-25 00:09:28,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383643056] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:28,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541392245] [2024-09-25 00:09:28,851 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 00:09:28,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:28,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:28,853 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-25 00:09:28,854 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-25 00:09:28,902 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-09-25 00:09:28,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:28,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 00:09:28,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 00:09:28,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:09:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541392245] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:09:28,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:09:28,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 14 [2024-09-25 00:09:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771444587] [2024-09-25 00:09:28,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:09:28,961 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 00:09:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:28,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 00:09:28,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-09-25 00:09:28,962 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 00:09:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:29,041 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-09-25 00:09:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 00:09:29,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2024-09-25 00:09:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:29,042 INFO L225 Difference]: With dead ends: 33 [2024-09-25 00:09:29,043 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:09:29,047 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2024-09-25 00:09:29,048 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:29,048 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 72 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:09:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:09:29,048 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-25 00:09:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:09:29,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2024-09-25 00:09:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:29,049 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:09:29,049 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 00:09:29,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:09:29,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:09:29,052 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:09:29,066 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:29,256 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:29,260 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1] [2024-09-25 00:09:29,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:09:29,534 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:09:29,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:09:29 BoogieIcfgContainer [2024-09-25 00:09:29,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:09:29,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:09:29,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:09:29,565 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:09:29,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:23" (3/4) ... [2024-09-25 00:09:29,567 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:09:29,616 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:09:29,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:09:29,616 INFO L158 Benchmark]: Toolchain (without parser) took 6922.18ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 74.0MB in the beginning and 206.5MB in the end (delta: -132.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:09:29,617 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 105.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:09:29,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.49ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 73.8MB in the beginning and 166.3MB in the end (delta: -92.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-09-25 00:09:29,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.54ms. Allocated memory is still 199.2MB. Free memory was 166.3MB in the beginning and 165.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:09:29,617 INFO L158 Benchmark]: Boogie Preprocessor took 32.78ms. Allocated memory is still 199.2MB. Free memory was 165.3MB in the beginning and 164.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:09:29,618 INFO L158 Benchmark]: RCFGBuilder took 266.19ms. Allocated memory is still 199.2MB. Free memory was 164.2MB in the beginning and 151.6MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 00:09:29,618 INFO L158 Benchmark]: TraceAbstraction took 6305.00ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 150.6MB in the beginning and 208.6MB in the end (delta: -58.0MB). Peak memory consumption was 120.8MB. Max. memory is 16.1GB. [2024-09-25 00:09:29,618 INFO L158 Benchmark]: Witness Printer took 51.37ms. Allocated memory is still 239.1MB. Free memory was 208.6MB in the beginning and 206.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:09:29,620 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.16ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 105.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.49ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 73.8MB in the beginning and 166.3MB in the end (delta: -92.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.54ms. Allocated memory is still 199.2MB. Free memory was 166.3MB in the beginning and 165.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.78ms. Allocated memory is still 199.2MB. Free memory was 165.3MB in the beginning and 164.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 266.19ms. Allocated memory is still 199.2MB. Free memory was 164.2MB in the beginning and 151.6MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6305.00ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 150.6MB in the beginning and 208.6MB in the end (delta: -58.0MB). Peak memory consumption was 120.8MB. Max. memory is 16.1GB. * Witness Printer took 51.37ms. Allocated memory is still 239.1MB. Free memory was 208.6MB in the beginning and 206.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 15]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 633 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 529 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 104 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 382 SyntacticMatches, 15 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=6, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 421 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 1338 SizeOfPredicates, 16 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 440/768 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id. Ensures: ((((((((3 == \result) && (x == 3)) || ((2 == \result) && (x == 2))) || ((5 == \result) && (5 == x))) || ((\result == 1) && (x == 1))) || ((x == 4) && (4 == \result))) || ((\result == 0) && (x == 0))) || (5 < x)) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:09:29,644 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