./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/nested6.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/nested6.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 327b0d5e70f014fe291a4771fe2bbb17cb1148e77fe8f6a261d10a47df8adacc --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:25:30,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:25:30,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:25:30,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:25:30,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:25:31,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:25:31,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:25:31,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:25:31,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:25:31,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:25:31,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:25:31,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:25:31,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:25:31,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:25:31,022 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:25:31,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:25:31,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:25:31,024 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:25:31,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:25:31,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:25:31,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:25:31,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:25:31,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:25:31,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:25:31,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:25:31,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:25:31,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:25:31,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:25:31,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:25:31,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:25:31,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:25:31,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:25:31,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:25:31,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:25:31,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:25:31,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:25:31,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:25:31,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:25:31,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:25:31,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:25:31,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:25:31,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:25:31,039 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 -> 327b0d5e70f014fe291a4771fe2bbb17cb1148e77fe8f6a261d10a47df8adacc Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 15:25:31,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:25:31,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:25:31,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:25:31,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:25:31,292 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:25:31,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/nested6.i [2024-09-12 15:25:32,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:25:32,695 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:25:32,695 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/nested6.i [2024-09-12 15:25:32,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a6f196adc/479aa709ab9b420cb2b729e307fa6d44/FLAGd657892c0 [2024-09-12 15:25:33,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a6f196adc/479aa709ab9b420cb2b729e307fa6d44 [2024-09-12 15:25:33,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:25:33,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:25:33,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:25:33,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:25:33,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:25:33,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7139dccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33, skipping insertion in model container [2024-09-12 15:25:33,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:25:33,283 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/nested6.i[893,906] [2024-09-12 15:25:33,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:25:33,303 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:25:33,313 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/nested6.i[893,906] [2024-09-12 15:25:33,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:25:33,330 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:25:33,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33 WrapperNode [2024-09-12 15:25:33,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:25:33,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:25:33,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:25:33,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:25:33,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,351 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:25:33,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:25:33,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:25:33,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:25:33,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:25:33,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,381 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-12 15:25:33,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:25:33,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:25:33,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:25:33,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:25:33,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (1/1) ... [2024-09-12 15:25:33,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:25:33,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:33,424 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-12 15:25:33,426 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-12 15:25:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:25:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:25:33,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:25:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:25:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:25:33,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:25:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:25:33,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:25:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 15:25:33,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 15:25:33,514 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:25:33,516 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:25:33,655 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-12 15:25:33,657 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:25:33,670 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:25:33,673 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-12 15:25:33,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:25:33 BoogieIcfgContainer [2024-09-12 15:25:33,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:25:33,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:25:33,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:25:33,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:25:33,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:25:33" (1/3) ... [2024-09-12 15:25:33,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f120069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:25:33, skipping insertion in model container [2024-09-12 15:25:33,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:33" (2/3) ... [2024-09-12 15:25:33,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f120069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:25:33, skipping insertion in model container [2024-09-12 15:25:33,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:25:33" (3/3) ... [2024-09-12 15:25:33,680 INFO L112 eAbstractionObserver]: Analyzing ICFG nested6.i [2024-09-12 15:25:33,692 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:25:33,692 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:25:33,738 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:25:33,745 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;@5d936645, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:25:33,745 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:25:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 15:25:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 15:25:33,754 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:33,754 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:33,755 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:33,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1369990859, now seen corresponding path program 1 times [2024-09-12 15:25:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:33,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858595296] [2024-09-12 15:25:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,055 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-12 15:25:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858595296] [2024-09-12 15:25:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858595296] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:34,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:34,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187694479] [2024-09-12 15:25:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:34,061 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:34,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:34,079 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-12 15:25:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:34,154 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2024-09-12 15:25:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:25:34,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2024-09-12 15:25:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:34,162 INFO L225 Difference]: With dead ends: 53 [2024-09-12 15:25:34,162 INFO L226 Difference]: Without dead ends: 27 [2024-09-12 15:25:34,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-12 15:25:34,167 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:34,168 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 89 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:25:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-12 15:25:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-12 15:25:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 15:25:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-12 15:25:34,196 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2024-09-12 15:25:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:34,197 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-12 15:25:34,197 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-12 15:25:34,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-12 15:25:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 15:25:34,198 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:34,198 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:34,198 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:25:34,199 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:34,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash -13683414, now seen corresponding path program 1 times [2024-09-12 15:25:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:34,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912771250] [2024-09-12 15:25:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,298 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-12 15:25:34,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912771250] [2024-09-12 15:25:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912771250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:34,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:34,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114842900] [2024-09-12 15:25:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:34,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:34,308 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12 15:25:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:34,422 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-09-12 15:25:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:34,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2024-09-12 15:25:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:34,424 INFO L225 Difference]: With dead ends: 39 [2024-09-12 15:25:34,424 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 15:25:34,425 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 15:25:34,426 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:34,428 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 93 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 15:25:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2024-09-12 15:25:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 15:25:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-09-12 15:25:34,440 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2024-09-12 15:25:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:34,441 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-09-12 15:25:34,441 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12 15:25:34,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-09-12 15:25:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 15:25:34,442 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:34,442 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:34,442 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:25:34,443 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:34,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 900795853, now seen corresponding path program 1 times [2024-09-12 15:25:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:34,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413563997] [2024-09-12 15:25:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 15:25:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,536 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-12 15:25:34,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:34,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413563997] [2024-09-12 15:25:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413563997] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:34,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:34,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561748903] [2024-09-12 15:25:34,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:34,545 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:34,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:34,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:34,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:34,546 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-12 15:25:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:34,629 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-09-12 15:25:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:25:34,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 19 [2024-09-12 15:25:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:34,631 INFO L225 Difference]: With dead ends: 44 [2024-09-12 15:25:34,631 INFO L226 Difference]: Without dead ends: 42 [2024-09-12 15:25:34,632 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-12 15:25:34,636 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:34,637 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-12 15:25:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-12 15:25:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 15:25:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-09-12 15:25:34,646 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 19 [2024-09-12 15:25:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:34,646 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-09-12 15:25:34,646 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-12 15:25:34,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-09-12 15:25:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 15:25:34,647 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:34,647 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:34,647 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 15:25:34,647 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:34,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:34,648 INFO L85 PathProgramCache]: Analyzing trace with hash -999921348, now seen corresponding path program 1 times [2024-09-12 15:25:34,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:34,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700257457] [2024-09-12 15:25:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:34,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-12 15:25:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:25:34,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:34,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700257457] [2024-09-12 15:25:34,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700257457] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:34,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547816145] [2024-09-12 15:25:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:34,783 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-12 15:25:34,784 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-12 15:25:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:34,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 15:25:34,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 15:25:34,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 15:25:34,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547816145] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:34,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 15:25:34,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-09-12 15:25:34,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896220642] [2024-09-12 15:25:34,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:34,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:34,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:25:34,924 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:25:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:35,031 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2024-09-12 15:25:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:25:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-09-12 15:25:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:35,032 INFO L225 Difference]: With dead ends: 105 [2024-09-12 15:25:35,032 INFO L226 Difference]: Without dead ends: 70 [2024-09-12 15:25:35,033 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-12 15:25:35,033 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:35,034 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 70 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-12 15:25:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 46. [2024-09-12 15:25:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 15:25:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-09-12 15:25:35,048 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 23 [2024-09-12 15:25:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:35,049 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-09-12 15:25:35,049 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:25:35,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-09-12 15:25:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 15:25:35,051 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:35,051 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:35,064 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 15:25:35,252 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:35,252 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:35,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1424907511, now seen corresponding path program 1 times [2024-09-12 15:25:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:35,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405084744] [2024-09-12 15:25:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:35,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:35,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:35,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:25:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:35,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 15:25:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:25:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:35,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405084744] [2024-09-12 15:25:35,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405084744] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:35,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985474807] [2024-09-12 15:25:35,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:35,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:35,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:35,376 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-12 15:25:35,376 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-12 15:25:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:35,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 15:25:35,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 15:25:35,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:25:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985474807] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:35,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:35,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2024-09-12 15:25:35,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705373597] [2024-09-12 15:25:35,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:35,515 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 15:25:35,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:35,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 15:25:35,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-09-12 15:25:35,516 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-12 15:25:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:35,791 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2024-09-12 15:25:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-12 15:25:35,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2024-09-12 15:25:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:35,795 INFO L225 Difference]: With dead ends: 114 [2024-09-12 15:25:35,795 INFO L226 Difference]: Without dead ends: 90 [2024-09-12 15:25:35,796 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2024-09-12 15:25:35,797 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:35,797 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 142 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-12 15:25:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2024-09-12 15:25:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-12 15:25:35,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2024-09-12 15:25:35,818 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 30 [2024-09-12 15:25:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:35,818 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2024-09-12 15:25:35,818 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-12 15:25:35,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:35,819 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2024-09-12 15:25:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 15:25:35,820 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:35,820 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:35,832 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 15:25:36,021 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:36,022 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:36,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1874224038, now seen corresponding path program 1 times [2024-09-12 15:25:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310903172] [2024-09-12 15:25:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:25:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 15:25:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 15:25:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:36,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310903172] [2024-09-12 15:25:36,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310903172] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:36,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799893429] [2024-09-12 15:25:36,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:36,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:36,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:36,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:25:36,123 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 15:25:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 15:25:36,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 15:25:36,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 15:25:36,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799893429] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:36,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:36,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-09-12 15:25:36,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003257410] [2024-09-12 15:25:36,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:36,316 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 15:25:36,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:36,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 15:25:36,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-09-12 15:25:36,317 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-12 15:25:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:36,458 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2024-09-12 15:25:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 15:25:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2024-09-12 15:25:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:36,459 INFO L225 Difference]: With dead ends: 127 [2024-09-12 15:25:36,459 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 15:25:36,460 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2024-09-12 15:25:36,460 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 50 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:36,461 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 125 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 15:25:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2024-09-12 15:25:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.26) internal successors, (63), 52 states have internal predecessors, (63), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 15:25:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2024-09-12 15:25:36,482 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 40 [2024-09-12 15:25:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:36,482 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2024-09-12 15:25:36,483 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-12 15:25:36,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-09-12 15:25:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-12 15:25:36,485 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:36,485 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:36,504 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 15:25:36,685 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 15:25:36,686 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:36,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash -209260640, now seen corresponding path program 1 times [2024-09-12 15:25:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:36,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132659995] [2024-09-12 15:25:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,761 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 15:25:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,765 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:25:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-12 15:25:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 15:25:36,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:36,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132659995] [2024-09-12 15:25:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132659995] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:36,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060563302] [2024-09-12 15:25:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:36,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:36,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:36,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:25:36,779 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 15:25:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:36,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 15:25:36,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-12 15:25:36,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 15:25:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060563302] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:36,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:36,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-12 15:25:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252809675] [2024-09-12 15:25:36,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:36,934 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-12 15:25:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:36,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-12 15:25:36,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-09-12 15:25:36,935 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-12 15:25:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:37,021 INFO L93 Difference]: Finished difference Result 136 states and 176 transitions. [2024-09-12 15:25:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:37,022 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 42 [2024-09-12 15:25:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:37,023 INFO L225 Difference]: With dead ends: 136 [2024-09-12 15:25:37,023 INFO L226 Difference]: Without dead ends: 91 [2024-09-12 15:25:37,023 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-09-12 15:25:37,024 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:37,024 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 120 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-09-12 15:25:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2024-09-12 15:25:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 57 states have internal predecessors, (68), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-12 15:25:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2024-09-12 15:25:37,043 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 42 [2024-09-12 15:25:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:37,043 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2024-09-12 15:25:37,044 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-12 15:25:37,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2024-09-12 15:25:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-12 15:25:37,046 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:37,046 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:37,062 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 15:25:37,247 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:37,247 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:37,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1806952856, now seen corresponding path program 1 times [2024-09-12 15:25:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:37,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002883332] [2024-09-12 15:25:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:37,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,322 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 15:25:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:25:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,327 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 15:25:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-12 15:25:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-12 15:25:37,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:37,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002883332] [2024-09-12 15:25:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002883332] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:37,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539557407] [2024-09-12 15:25:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:37,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:37,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:37,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:25:37,334 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 15:25:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 15:25:37,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 15:25:37,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 15:25:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539557407] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:37,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 14 [2024-09-12 15:25:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162688694] [2024-09-12 15:25:37,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:37,559 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 15:25:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 15:25:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-09-12 15:25:37,560 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-12 15:25:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:37,919 INFO L93 Difference]: Finished difference Result 159 states and 219 transitions. [2024-09-12 15:25:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 15:25:37,919 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 53 [2024-09-12 15:25:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:37,920 INFO L225 Difference]: With dead ends: 159 [2024-09-12 15:25:37,920 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 15:25:37,921 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-09-12 15:25:37,923 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 65 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:37,923 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 115 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 15:25:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 15:25:37,924 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-12 15:25:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 15:25:37,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2024-09-12 15:25:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:37,925 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 15:25:37,925 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-12 15:25:37,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 15:25:37,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 15:25:37,928 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 15:25:37,940 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 15:25:38,128 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 15:25:38,131 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:38,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 15:25:40,514 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 15:25:40,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 03:25:40 BoogieIcfgContainer [2024-09-12 15:25:40,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 15:25:40,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 15:25:40,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 15:25:40,528 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 15:25:40,528 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:25:33" (3/4) ... [2024-09-12 15:25:40,529 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 15:25:40,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 15:25:40,532 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 15:25:40,532 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 15:25:40,534 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-09-12 15:25:40,534 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-09-12 15:25:40,534 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 15:25:40,534 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:25:40,534 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:25:40,601 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 15:25:40,601 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 15:25:40,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 15:25:40,602 INFO L158 Benchmark]: Toolchain (without parser) took 7484.24ms. Allocated memory was 62.9MB in the beginning and 276.8MB in the end (delta: 213.9MB). Free memory was 31.4MB in the beginning and 164.4MB in the end (delta: -133.0MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2024-09-12 15:25:40,602 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 28.6MB in the beginning and 28.5MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:25:40,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.16ms. Allocated memory is still 62.9MB. Free memory was 31.2MB in the beginning and 37.4MB in the end (delta: -6.2MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-09-12 15:25:40,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.74ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 36.5MB in the end (delta: 879.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:25:40,606 INFO L158 Benchmark]: Boogie Preprocessor took 43.27ms. Allocated memory is still 62.9MB. Free memory was 36.2MB in the beginning and 34.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:25:40,607 INFO L158 Benchmark]: RCFGBuilder took 277.45ms. Allocated memory is still 62.9MB. Free memory was 34.5MB in the beginning and 40.1MB in the end (delta: -5.6MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-09-12 15:25:40,607 INFO L158 Benchmark]: TraceAbstraction took 6852.71ms. Allocated memory was 62.9MB in the beginning and 276.8MB in the end (delta: 213.9MB). Free memory was 39.5MB in the beginning and 169.6MB in the end (delta: -130.2MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. [2024-09-12 15:25:40,607 INFO L158 Benchmark]: Witness Printer took 73.76ms. Allocated memory is still 276.8MB. Free memory was 169.6MB in the beginning and 164.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:25:40,608 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.13ms. Allocated memory is still 48.2MB. Free memory was 28.6MB in the beginning and 28.5MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.16ms. Allocated memory is still 62.9MB. Free memory was 31.2MB in the beginning and 37.4MB in the end (delta: -6.2MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.74ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 36.5MB in the end (delta: 879.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.27ms. Allocated memory is still 62.9MB. Free memory was 36.2MB in the beginning and 34.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 277.45ms. Allocated memory is still 62.9MB. Free memory was 34.5MB in the beginning and 40.1MB in the end (delta: -5.6MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6852.71ms. Allocated memory was 62.9MB in the beginning and 276.8MB in the end (delta: 213.9MB). Free memory was 39.5MB in the beginning and 169.6MB in the end (delta: -130.2MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. * Witness Printer took 73.76ms. Allocated memory is still 276.8MB. Free memory was 169.6MB in the beginning and 164.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 832 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 670 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 788 IncrementalHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 162 mSDtfsCounter, 788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 366 SyntacticMatches, 11 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=7, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 1356 SizeOfPredicates, 20 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 398/439 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: 24]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (n == k) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((long long) j + 1) <= n) && (k <= n)) && (((long long) i * 2) <= j)) && (((long long) i * 2) <= k)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((n == k) && (((long long) i * 2) <= j)) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-12 15:25:40,627 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