./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex-add.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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/loop-lit/bh2017-ex-add.i -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 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:23:17,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:23:18,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:23:18,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:23:18,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:23:18,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:23:18,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:23:18,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:23:18,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:23:18,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:23:18,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:23:18,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:23:18,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:23:18,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:23:18,119 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:23:18,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:23:18,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:23:18,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:23:18,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:23:18,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:23:18,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:23:18,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:23:18,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:23:18,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:23:18,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:23:18,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:23:18,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:23:18,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:23:18,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:23:18,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:23:18,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:23:18,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:23:18,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:23:18,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:23:18,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:23:18,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:23:18,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:23:18,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:23:18,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:23:18,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:23:18,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:23:18,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:23:18,128 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 -> 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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 10:23:18,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:23:18,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:23:18,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:23:18,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:23:18,519 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:23:18,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2024-09-25 10:23:19,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:23:20,157 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:23:20,157 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2024-09-25 10:23:20,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6a71368bb/afbb612cb2ee48b1843254d416efcd16/FLAG6248905af [2024-09-25 10:23:20,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6a71368bb/afbb612cb2ee48b1843254d416efcd16 [2024-09-25 10:23:20,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:23:20,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:23:20,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:23:20,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:23:20,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:23:20,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b4d11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20, skipping insertion in model container [2024-09-25 10:23:20,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:23:20,711 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/loop-lit/bh2017-ex-add.i[802,815] [2024-09-25 10:23:20,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:23:20,744 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:23:20,756 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/loop-lit/bh2017-ex-add.i[802,815] [2024-09-25 10:23:20,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:23:20,784 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:23:20,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20 WrapperNode [2024-09-25 10:23:20,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:23:20,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:23:20,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:23:20,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:23:20,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,805 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:23:20,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:23:20,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:23:20,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:23:20,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:23:20,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,839 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 10:23:20,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:23:20,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:23:20,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:23:20,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:23:20,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (1/1) ... [2024-09-25 10:23:20,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:23:20,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:23:20,888 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 10:23:20,894 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 10:23:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:23:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:23:20,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:23:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:23:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:23:20,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:23:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:23:20,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:23:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:23:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:23:21,006 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:23:21,008 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:23:21,196 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-25 10:23:21,197 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:23:21,217 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:23:21,218 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:23:21,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:23:21 BoogieIcfgContainer [2024-09-25 10:23:21,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:23:21,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:23:21,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:23:21,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:23:21,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:23:20" (1/3) ... [2024-09-25 10:23:21,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f11e5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:23:21, skipping insertion in model container [2024-09-25 10:23:21,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:23:20" (2/3) ... [2024-09-25 10:23:21,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f11e5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:23:21, skipping insertion in model container [2024-09-25 10:23:21,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:23:21" (3/3) ... [2024-09-25 10:23:21,230 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex-add.i [2024-09-25 10:23:21,247 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:23:21,247 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:23:21,308 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:23:21,315 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;@4af561ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:23:21,316 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:23:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:23:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:23:21,326 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:21,327 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:21,327 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:21,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1396054794, now seen corresponding path program 1 times [2024-09-25 10:23:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:21,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111227258] [2024-09-25 10:23:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:21,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:21,630 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 10:23:21,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:21,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111227258] [2024-09-25 10:23:21,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111227258] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:21,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:23:21,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639957887] [2024-09-25 10:23:21,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:21,644 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:23:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:21,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:23:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:23:21,669 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:23:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:21,756 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2024-09-25 10:23:21,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:23:21,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 10:23:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:21,763 INFO L225 Difference]: With dead ends: 55 [2024-09-25 10:23:21,763 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 10:23:21,765 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:23:21,769 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:21,770 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 10:23:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-25 10:23:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:23:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-09-25 10:23:21,817 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 10 [2024-09-25 10:23:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:21,818 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-09-25 10:23:21,819 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:23:21,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-09-25 10:23:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:23:21,821 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:21,821 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:21,821 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:23:21,822 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:21,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2013774231, now seen corresponding path program 1 times [2024-09-25 10:23:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:21,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286991636] [2024-09-25 10:23:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:23:22,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286991636] [2024-09-25 10:23:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286991636] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:22,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:23:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546845782] [2024-09-25 10:23:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:22,058 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:23:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:22,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:23:22,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:23:22,060 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:23:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:22,140 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-09-25 10:23:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:23:22,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-09-25 10:23:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:22,143 INFO L225 Difference]: With dead ends: 36 [2024-09-25 10:23:22,143 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 10:23:22,143 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:23:22,144 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:22,145 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 100 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:23:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 10:23:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-25 10:23:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:23:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-09-25 10:23:22,165 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 15 [2024-09-25 10:23:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:22,165 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-09-25 10:23:22,165 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:23:22,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-09-25 10:23:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 10:23:22,168 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:22,168 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:22,168 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:23:22,168 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:22,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1915138482, now seen corresponding path program 1 times [2024-09-25 10:23:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:22,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010797860] [2024-09-25 10:23:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:23:22,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010797860] [2024-09-25 10:23:22,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010797860] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:22,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:22,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:23:22,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225123924] [2024-09-25 10:23:22,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:22,277 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:23:22,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:22,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:23:22,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:23:22,282 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:23:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:22,305 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-09-25 10:23:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:23:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-25 10:23:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:22,307 INFO L225 Difference]: With dead ends: 76 [2024-09-25 10:23:22,307 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 10:23:22,308 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:23:22,309 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:22,309 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 10:23:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-25 10:23:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:23:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2024-09-25 10:23:22,320 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 24 [2024-09-25 10:23:22,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:22,321 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-09-25 10:23:22,321 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:23:22,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2024-09-25 10:23:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 10:23:22,323 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:22,323 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:22,323 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:23:22,323 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:22,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1242719267, now seen corresponding path program 1 times [2024-09-25 10:23:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:22,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157633427] [2024-09-25 10:23:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:22,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:23:22,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:22,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157633427] [2024-09-25 10:23:22,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157633427] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:22,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:22,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:23:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234785150] [2024-09-25 10:23:22,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:22,402 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:23:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:22,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:23:22,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:23:22,404 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:23:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:22,436 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2024-09-25 10:23:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:23:22,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-09-25 10:23:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:22,438 INFO L225 Difference]: With dead ends: 113 [2024-09-25 10:23:22,438 INFO L226 Difference]: Without dead ends: 71 [2024-09-25 10:23:22,439 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:23:22,440 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:22,441 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 66 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-25 10:23:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-09-25 10:23:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 10:23:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-09-25 10:23:22,457 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 26 [2024-09-25 10:23:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:22,457 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-09-25 10:23:22,458 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:23:22,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-09-25 10:23:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 10:23:22,460 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:22,460 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:22,460 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:23:22,460 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:22,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash 602123413, now seen corresponding path program 1 times [2024-09-25 10:23:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102773191] [2024-09-25 10:23:22,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:23:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:23:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102773191] [2024-09-25 10:23:22,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102773191] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:23:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953950912] [2024-09-25 10:23:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:22,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:23:22,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:23:22,548 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 10:23:22,550 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 10:23:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:22,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:23:22,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:23:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:22,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:23:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:22,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953950912] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:23:22,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:23:22,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:23:22,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654027952] [2024-09-25 10:23:22,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:23:22,794 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:23:22,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:22,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:23:22,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:22,795 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 10:23:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:22,893 INFO L93 Difference]: Finished difference Result 209 states and 315 transitions. [2024-09-25 10:23:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:23:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 41 [2024-09-25 10:23:22,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:22,895 INFO L225 Difference]: With dead ends: 209 [2024-09-25 10:23:22,895 INFO L226 Difference]: Without dead ends: 143 [2024-09-25 10:23:22,898 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:22,899 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:22,899 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 107 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:23:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-09-25 10:23:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-09-25 10:23:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 109 states have (on average 1.4403669724770642) internal successors, (157), 109 states have internal predecessors, (157), 29 states have call successors, (29), 5 states have call predecessors, (29), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-09-25 10:23:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2024-09-25 10:23:22,938 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 41 [2024-09-25 10:23:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:22,938 INFO L474 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2024-09-25 10:23:22,939 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 10:23:22,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2024-09-25 10:23:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 10:23:22,944 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:22,944 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:22,960 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:23:23,145 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:23:23,146 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:23,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:23,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1662151770, now seen corresponding path program 1 times [2024-09-25 10:23:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:23,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965464069] [2024-09-25 10:23:23,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,242 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,246 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:23:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:23:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965464069] [2024-09-25 10:23:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965464069] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:23:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033185524] [2024-09-25 10:23:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:23,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:23:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:23:23,256 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 10:23:23,265 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 10:23:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:23:23,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:23:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:23,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:23:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:23:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033185524] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:23:23,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:23:23,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:23:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771516525] [2024-09-25 10:23:23,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:23:23,429 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:23:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:23:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:23,430 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 10:23:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:23,542 INFO L93 Difference]: Finished difference Result 452 states and 705 transitions. [2024-09-25 10:23:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:23:23,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2024-09-25 10:23:23,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:23,546 INFO L225 Difference]: With dead ends: 452 [2024-09-25 10:23:23,550 INFO L226 Difference]: Without dead ends: 314 [2024-09-25 10:23:23,551 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:23,553 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 38 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:23,555 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 155 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-09-25 10:23:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-09-25 10:23:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 247 states have (on average 1.4493927125506072) internal successors, (358), 247 states have internal predecessors, (358), 62 states have call successors, (62), 5 states have call predecessors, (62), 4 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2024-09-25 10:23:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 481 transitions. [2024-09-25 10:23:23,603 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 481 transitions. Word has length 43 [2024-09-25 10:23:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:23,604 INFO L474 AbstractCegarLoop]: Abstraction has 314 states and 481 transitions. [2024-09-25 10:23:23,604 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 10:23:23,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 481 transitions. [2024-09-25 10:23:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-09-25 10:23:23,611 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:23,611 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:23,627 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:23:23,811 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:23:23,812 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:23,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1063543182, now seen corresponding path program 2 times [2024-09-25 10:23:23,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:23,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071997336] [2024-09-25 10:23:23,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:23:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:23:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 10:23:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 10:23:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 10:23:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 10:23:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-25 10:23:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-25 10:23:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-09-25 10:23:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071997336] [2024-09-25 10:23:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071997336] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:23,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:23,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:23:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519605393] [2024-09-25 10:23:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:23,999 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:23:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:23:24,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:23:24,005 INFO L87 Difference]: Start difference. First operand 314 states and 481 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:23:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:24,087 INFO L93 Difference]: Finished difference Result 320 states and 486 transitions. [2024-09-25 10:23:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:23:24,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-09-25 10:23:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:24,090 INFO L225 Difference]: With dead ends: 320 [2024-09-25 10:23:24,090 INFO L226 Difference]: Without dead ends: 318 [2024-09-25 10:23:24,091 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:24,091 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:24,092 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-09-25 10:23:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-09-25 10:23:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 250 states have (on average 1.444) internal successors, (361), 250 states have internal predecessors, (361), 62 states have call successors, (62), 6 states have call predecessors, (62), 5 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2024-09-25 10:23:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 484 transitions. [2024-09-25 10:23:24,137 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 484 transitions. Word has length 92 [2024-09-25 10:23:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:24,138 INFO L474 AbstractCegarLoop]: Abstraction has 318 states and 484 transitions. [2024-09-25 10:23:24,138 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:23:24,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 484 transitions. [2024-09-25 10:23:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-25 10:23:24,141 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:23:24,142 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:23:24,142 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 10:23:24,142 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:23:24,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1514797283, now seen corresponding path program 2 times [2024-09-25 10:23:24,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:23:24,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240654049] [2024-09-25 10:23:24,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:23:24,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:23:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:23:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:23:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:23:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:23:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:23:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 10:23:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 10:23:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 10:23:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 10:23:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,322 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-25 10:23:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-25 10:23:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:23:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-25 10:23:24,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:23:24,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240654049] [2024-09-25 10:23:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240654049] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:23:24,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:23:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:23:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461686342] [2024-09-25 10:23:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:23:24,333 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:23:24,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:23:24,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:23:24,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:23:24,334 INFO L87 Difference]: Start difference. First operand 318 states and 484 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:23:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:23:24,413 INFO L93 Difference]: Finished difference Result 318 states and 484 transitions. [2024-09-25 10:23:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:23:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 94 [2024-09-25 10:23:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:23:24,416 INFO L225 Difference]: With dead ends: 318 [2024-09-25 10:23:24,417 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:23:24,418 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:23:24,418 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:23:24,419 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 115 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:23:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:23:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:23:24,422 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 10:23:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:23:24,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2024-09-25 10:23:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:23:24,422 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:23:24,423 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:23:24,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:23:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:23:24,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:23:24,426 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:23:24,427 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-25 10:23:24,429 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-09-25 10:23:24,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:23:25,755 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:23:25,771 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:23:25,772 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:23:25,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:23:25,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:23:25,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:23:25,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:23:25,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:23:25,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:23:25,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:23:25 BoogieIcfgContainer [2024-09-25 10:23:25,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:23:25,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:23:25,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:23:25,775 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:23:25,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:23:21" (3/4) ... [2024-09-25 10:23:25,778 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:23:25,830 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:23:25,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:23:25,831 INFO L158 Benchmark]: Toolchain (without parser) took 5304.82ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 29.4MB in the beginning and 42.6MB in the end (delta: -13.2MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2024-09-25 10:23:25,831 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 50.3MB. Free memory is still 33.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:23:25,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.78ms. Allocated memory is still 65.0MB. Free memory was 29.4MB in the beginning and 38.3MB in the end (delta: -8.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-09-25 10:23:25,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.09ms. Allocated memory is still 65.0MB. Free memory was 38.3MB in the beginning and 37.3MB in the end (delta: 986.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:23:25,833 INFO L158 Benchmark]: Boogie Preprocessor took 46.73ms. Allocated memory is still 65.0MB. Free memory was 37.3MB in the beginning and 35.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:23:25,834 INFO L158 Benchmark]: RCFGBuilder took 365.06ms. Allocated memory is still 65.0MB. Free memory was 35.5MB in the beginning and 42.9MB in the end (delta: -7.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 10:23:25,834 INFO L158 Benchmark]: TraceAbstraction took 4552.11ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 42.3MB in the beginning and 44.7MB in the end (delta: -2.5MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2024-09-25 10:23:25,834 INFO L158 Benchmark]: Witness Printer took 55.31ms. Allocated memory is still 117.4MB. Free memory was 44.7MB in the beginning and 42.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:23:25,837 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.14ms. Allocated memory is still 50.3MB. Free memory is still 33.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.78ms. Allocated memory is still 65.0MB. Free memory was 29.4MB in the beginning and 38.3MB in the end (delta: -8.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.09ms. Allocated memory is still 65.0MB. Free memory was 38.3MB in the beginning and 37.3MB in the end (delta: 986.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.73ms. Allocated memory is still 65.0MB. Free memory was 37.3MB in the beginning and 35.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.06ms. Allocated memory is still 65.0MB. Free memory was 35.5MB in the beginning and 42.9MB in the end (delta: -7.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4552.11ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 42.3MB in the beginning and 44.7MB in the end (delta: -2.5MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 55.31ms. Allocated memory is still 117.4MB. Free memory was 44.7MB in the beginning and 42.6MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 13]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 813 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 555 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 258 mSDtfsCounter, 174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 183 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 782/830 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main. Ensures: 0 - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:23:25,869 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