./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d 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/sendmail-close-angle.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 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 12:02:14,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:02:14,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:02:14,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:02:14,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:02:14,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:02:14,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:02:14,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:02:14,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:02:14,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:02:14,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:02:14,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:02:14,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:02:14,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:02:14,609 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:02:14,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:02:14,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:02:14,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:02:14,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:02:14,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:02:14,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:02:14,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:02:14,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:02:14,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:02:14,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:02:14,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:02:14,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:02:14,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:02:14,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:02:14,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:02:14,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:02:14,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:02:14,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:02:14,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:02:14,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:02:14,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:02:14,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:02:14,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:02:14,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:02:14,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:02:14,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:02:14,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:02:14,624 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 -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 12:02:14,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:02:14,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:02:14,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:02:14,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:02:14,883 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:02:14,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2024-09-20 12:02:16,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:02:16,575 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:02:16,575 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2024-09-20 12:02:16,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6d072101a/796f175a0c4d4abdb848c387eb096bad/FLAGf6ae91d99 [2024-09-20 12:02:16,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6d072101a/796f175a0c4d4abdb848c387eb096bad [2024-09-20 12:02:16,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:02:16,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:02:16,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:02:16,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:02:16,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:02:16,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@265750c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16, skipping insertion in model container [2024-09-20 12:02:16,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:02:16,783 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2024-09-20 12:02:16,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:02:16,811 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:02:16,825 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2024-09-20 12:02:16,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:02:16,850 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:02:16,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16 WrapperNode [2024-09-20 12:02:16,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:02:16,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:02:16,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:02:16,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:02:16,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,877 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:02:16,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:02:16,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:02:16,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:02:16,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:02:16,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,915 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-20 12:02:16,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:02:16,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:02:16,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:02:16,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:02:16,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (1/1) ... [2024-09-20 12:02:16,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:02:17,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:02:17,060 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-20 12:02:17,071 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-20 12:02:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:02:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:02:17,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:02:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:02:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:02:17,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:02:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:02:17,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:02:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:02:17,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:02:17,158 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:02:17,159 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:02:17,293 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-20 12:02:17,294 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:02:17,330 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:02:17,330 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 12:02:17,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:02:17 BoogieIcfgContainer [2024-09-20 12:02:17,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:02:17,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:02:17,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:02:17,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:02:17,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:02:16" (1/3) ... [2024-09-20 12:02:17,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f9ae60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:02:17, skipping insertion in model container [2024-09-20 12:02:17,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:02:16" (2/3) ... [2024-09-20 12:02:17,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f9ae60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:02:17, skipping insertion in model container [2024-09-20 12:02:17,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:02:17" (3/3) ... [2024-09-20 12:02:17,343 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2024-09-20 12:02:17,357 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:02:17,357 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:02:17,405 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:02:17,411 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;@695a4e8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:02:17,411 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:02:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-20 12:02:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-20 12:02:17,422 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:17,423 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:17,423 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:17,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:17,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1996117268, now seen corresponding path program 1 times [2024-09-20 12:02:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085486585] [2024-09-20 12:02:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:17,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:17,602 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-20 12:02:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085486585] [2024-09-20 12:02:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085486585] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:02:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:02:17,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 12:02:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426255543] [2024-09-20 12:02:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:02:17,610 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 12:02:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:17,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 12:02:17,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:02:17,636 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-20 12:02:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:17,676 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2024-09-20 12:02:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 12:02:17,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2024-09-20 12:02:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:17,685 INFO L225 Difference]: With dead ends: 56 [2024-09-20 12:02:17,686 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 12:02:17,689 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:02:17,693 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:17,694 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:02:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 12:02:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-20 12:02:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-20 12:02:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-09-20 12:02:17,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2024-09-20 12:02:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:17,735 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-09-20 12:02:17,735 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-20 12:02:17,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-09-20 12:02:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-20 12:02:17,738 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:17,739 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:17,739 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:02:17,739 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:17,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:17,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1160645557, now seen corresponding path program 1 times [2024-09-20 12:02:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:17,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676375013] [2024-09-20 12:02:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:17,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:17,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:02:17,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:17,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676375013] [2024-09-20 12:02:17,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676375013] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:02:17,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:02:17,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 12:02:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965270209] [2024-09-20 12:02:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:02:17,987 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:02:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:17,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:02:17,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:02:17,990 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. 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-20 12:02:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:18,106 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-09-20 12:02:18,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:02:18,107 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-20 12:02:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:18,109 INFO L225 Difference]: With dead ends: 33 [2024-09-20 12:02:18,109 INFO L226 Difference]: Without dead ends: 31 [2024-09-20 12:02:18,110 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:02:18,112 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:18,112 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 80 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:02:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-20 12:02:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-20 12:02:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-20 12:02:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-09-20 12:02:18,129 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2024-09-20 12:02:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:18,129 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-09-20 12:02:18,129 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-20 12:02:18,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-09-20 12:02:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-20 12:02:18,134 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:18,134 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-20 12:02:18,134 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:02:18,134 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:18,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:18,135 INFO L85 PathProgramCache]: Analyzing trace with hash -679603193, now seen corresponding path program 1 times [2024-09-20 12:02:18,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:18,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119545716] [2024-09-20 12:02:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:18,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:02:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,301 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-20 12:02:18,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:18,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119545716] [2024-09-20 12:02:18,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119545716] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:02:18,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:02:18,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:02:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097463924] [2024-09-20 12:02:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:02:18,303 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:02:18,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:02:18,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:02:18,305 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-20 12:02:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:18,442 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-09-20 12:02:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:02:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-20 12:02:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:18,445 INFO L225 Difference]: With dead ends: 46 [2024-09-20 12:02:18,447 INFO L226 Difference]: Without dead ends: 44 [2024-09-20 12:02:18,447 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-20 12:02:18,448 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:18,449 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 109 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:02:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-20 12:02:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-09-20 12:02:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-20 12:02:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2024-09-20 12:02:18,462 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 19 [2024-09-20 12:02:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:18,463 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-09-20 12:02:18,463 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-20 12:02:18,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-09-20 12:02:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-20 12:02:18,465 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:18,465 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:18,465 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:02:18,465 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:18,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1179305077, now seen corresponding path program 1 times [2024-09-20 12:02:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:18,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730139826] [2024-09-20 12:02:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:18,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:02:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 12:02:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:02:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730139826] [2024-09-20 12:02:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730139826] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:02:18,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:02:18,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:02:18,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828697115] [2024-09-20 12:02:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:02:18,614 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:02:18,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:18,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:02:18,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:02:18,615 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 12:02:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:18,730 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-09-20 12:02:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:02:18,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-09-20 12:02:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:18,732 INFO L225 Difference]: With dead ends: 52 [2024-09-20 12:02:18,735 INFO L226 Difference]: Without dead ends: 50 [2024-09-20 12:02:18,735 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:02:18,736 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:18,736 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 190 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:02:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-20 12:02:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-09-20 12:02:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-20 12:02:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-09-20 12:02:18,756 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 26 [2024-09-20 12:02:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:18,756 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-09-20 12:02:18,757 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 12:02:18,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-09-20 12:02:18,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-20 12:02:18,758 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:18,758 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:18,758 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 12:02:18,759 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:18,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 893389487, now seen corresponding path program 1 times [2024-09-20 12:02:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483110287] [2024-09-20 12:02:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:18,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:02:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:02:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 12:02:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 12:02:18,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483110287] [2024-09-20 12:02:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483110287] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:02:18,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:02:18,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 12:02:18,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754829016] [2024-09-20 12:02:18,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:02:18,926 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 12:02:18,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:18,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 12:02:18,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:02:18,927 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 12:02:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:19,080 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2024-09-20 12:02:19,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 12:02:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2024-09-20 12:02:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:19,082 INFO L225 Difference]: With dead ends: 71 [2024-09-20 12:02:19,084 INFO L226 Difference]: Without dead ends: 64 [2024-09-20 12:02:19,084 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:02:19,086 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:19,089 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 96 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:02:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-20 12:02:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-20 12:02:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-20 12:02:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2024-09-20 12:02:19,103 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 30 [2024-09-20 12:02:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:19,104 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-09-20 12:02:19,104 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 12:02:19,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2024-09-20 12:02:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-20 12:02:19,105 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:19,105 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:19,106 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 12:02:19,106 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:19,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1072747919, now seen corresponding path program 1 times [2024-09-20 12:02:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:19,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322457213] [2024-09-20 12:02:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:02:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 12:02:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:02:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 12:02:19,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:19,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322457213] [2024-09-20 12:02:19,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322457213] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:02:19,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:02:19,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 12:02:19,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246765892] [2024-09-20 12:02:19,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:02:19,199 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 12:02:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 12:02:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:02:19,201 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 12:02:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:19,299 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-09-20 12:02:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 12:02:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-09-20 12:02:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:19,302 INFO L225 Difference]: With dead ends: 72 [2024-09-20 12:02:19,302 INFO L226 Difference]: Without dead ends: 70 [2024-09-20 12:02:19,302 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-20 12:02:19,303 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:19,303 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:02:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-20 12:02:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-09-20 12:02:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-20 12:02:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-09-20 12:02:19,323 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2024-09-20 12:02:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:19,324 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-09-20 12:02:19,324 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 12:02:19,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-09-20 12:02:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-20 12:02:19,326 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:19,326 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:19,326 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 12:02:19,326 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:19,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash -42548696, now seen corresponding path program 1 times [2024-09-20 12:02:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434989557] [2024-09-20 12:02:19,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:02:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 12:02:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:02:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 12:02:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-20 12:02:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-20 12:02:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-20 12:02:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-20 12:02:19,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:19,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434989557] [2024-09-20 12:02:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434989557] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:02:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955873235] [2024-09-20 12:02:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:19,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:02:19,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:02:19,573 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-20 12:02:19,576 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-20 12:02:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:19,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 12:02:19,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:02:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-20 12:02:19,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:02:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-20 12:02:20,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955873235] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:02:20,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:02:20,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-09-20 12:02:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512390180] [2024-09-20 12:02:20,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:02:20,075 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-20 12:02:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:20,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-20 12:02:20,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-09-20 12:02:20,077 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 17 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-20 12:02:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:20,434 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2024-09-20 12:02:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-20 12:02:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 54 [2024-09-20 12:02:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:20,436 INFO L225 Difference]: With dead ends: 103 [2024-09-20 12:02:20,438 INFO L226 Difference]: Without dead ends: 88 [2024-09-20 12:02:20,439 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-09-20 12:02:20,439 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:20,440 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 193 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 12:02:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-20 12:02:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-09-20 12:02:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.1) internal successors, (55), 53 states have internal predecessors, (55), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-20 12:02:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2024-09-20 12:02:20,470 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 54 [2024-09-20 12:02:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:20,471 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2024-09-20 12:02:20,471 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-20 12:02:20,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2024-09-20 12:02:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-20 12:02:20,473 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:20,473 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:20,516 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-20 12:02:20,673 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 12:02:20,674 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:20,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:20,674 INFO L85 PathProgramCache]: Analyzing trace with hash -22060520, now seen corresponding path program 1 times [2024-09-20 12:02:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:20,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859336479] [2024-09-20 12:02:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:20,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:02:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 12:02:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:02:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 12:02:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:02:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-20 12:02:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-20 12:02:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-20 12:02:20,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:20,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859336479] [2024-09-20 12:02:20,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859336479] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:02:20,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049192547] [2024-09-20 12:02:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:20,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:02:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:02:20,849 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-20 12:02:20,851 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-20 12:02:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:20,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-20 12:02:20,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:02:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-20 12:02:21,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:02:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-20 12:02:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049192547] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:02:21,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:02:21,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-09-20 12:02:21,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007274248] [2024-09-20 12:02:21,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:02:21,180 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-20 12:02:21,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:21,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-20 12:02:21,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-09-20 12:02:21,181 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-20 12:02:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:21,293 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2024-09-20 12:02:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 12:02:21,294 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 55 [2024-09-20 12:02:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:21,296 INFO L225 Difference]: With dead ends: 92 [2024-09-20 12:02:21,298 INFO L226 Difference]: Without dead ends: 90 [2024-09-20 12:02:21,298 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-09-20 12:02:21,299 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:21,299 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 198 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:02:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-20 12:02:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-09-20 12:02:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 56 states have internal predecessors, (58), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-20 12:02:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-09-20 12:02:21,328 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 55 [2024-09-20 12:02:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:21,328 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-09-20 12:02:21,329 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-20 12:02:21,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-09-20 12:02:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-20 12:02:21,331 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:21,331 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:21,349 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 12:02:21,531 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:02:21,532 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:21,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash -111356737, now seen corresponding path program 2 times [2024-09-20 12:02:21,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:21,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955837595] [2024-09-20 12:02:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:21,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:02:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 12:02:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:02:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 12:02:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:02:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-20 12:02:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-20 12:02:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-20 12:02:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 12:02:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 12:02:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 12:02:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-09-20 12:02:21,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:21,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955837595] [2024-09-20 12:02:21,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955837595] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:02:21,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69818182] [2024-09-20 12:02:21,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 12:02:21,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:02:21,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:02:21,784 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-20 12:02:21,788 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-20 12:02:21,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 12:02:21,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:02:21,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-20 12:02:21,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:02:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-20 12:02:22,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:02:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-20 12:02:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69818182] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:02:22,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:02:22,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2024-09-20 12:02:22,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816515370] [2024-09-20 12:02:22,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:02:22,201 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-20 12:02:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-20 12:02:22,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-09-20 12:02:22,203 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 11 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-09-20 12:02:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:22,530 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2024-09-20 12:02:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-20 12:02:22,530 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 11 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) Word has length 79 [2024-09-20 12:02:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:22,533 INFO L225 Difference]: With dead ends: 100 [2024-09-20 12:02:22,534 INFO L226 Difference]: Without dead ends: 98 [2024-09-20 12:02:22,534 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2024-09-20 12:02:22,535 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 53 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:22,535 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 187 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 12:02:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-20 12:02:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-09-20 12:02:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 12 states have call predecessors, (26), 11 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-20 12:02:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-09-20 12:02:22,557 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 79 [2024-09-20 12:02:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:22,557 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-09-20 12:02:22,558 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 11 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-09-20 12:02:22,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-09-20 12:02:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-09-20 12:02:22,559 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:02:22,560 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:22,576 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 12:02:22,763 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-20 12:02:22,764 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:02:22,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:22,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1860395034, now seen corresponding path program 2 times [2024-09-20 12:02:22,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:02:22,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100049667] [2024-09-20 12:02:22,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:02:22,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:02:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:02:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:02:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,054 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 12:02:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 12:02:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 12:02:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:02:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-20 12:02:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-20 12:02:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-20 12:02:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 12:02:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 12:02:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,132 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 12:02:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-20 12:02:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,139 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-20 12:02:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-20 12:02:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,144 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-20 12:02:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:02:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 56 proven. 46 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-20 12:02:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:02:23,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100049667] [2024-09-20 12:02:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100049667] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:02:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661240928] [2024-09-20 12:02:23,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 12:02:23,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:02:23,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:02:23,150 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-20 12:02:23,152 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-20 12:02:23,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 12:02:23,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:02:23,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-20 12:02:23,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:02:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 64 proven. 67 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-09-20 12:02:23,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:02:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 71 proven. 60 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-09-20 12:02:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661240928] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:02:23,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:02:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 20 [2024-09-20 12:02:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394323221] [2024-09-20 12:02:23,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:02:23,562 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-20 12:02:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:02:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-20 12:02:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-09-20 12:02:23,563 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 12 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) [2024-09-20 12:02:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:02:23,886 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-09-20 12:02:23,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-20 12:02:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 12 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) Word has length 102 [2024-09-20 12:02:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:02:23,888 INFO L225 Difference]: With dead ends: 105 [2024-09-20 12:02:23,888 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 12:02:23,890 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2024-09-20 12:02:23,892 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:02:23,893 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 234 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 12:02:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 12:02:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 12:02:23,893 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-20 12:02:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 12:02:23,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2024-09-20 12:02:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:02:23,894 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 12:02:23,895 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 12 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) [2024-09-20 12:02:23,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:02:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 12:02:23,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 12:02:23,898 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 12:02:23,916 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 12:02:24,102 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:02:24,106 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-09-20 12:02:24,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 12:02:25,261 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 12:02:25,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:02:25 BoogieIcfgContainer [2024-09-20 12:02:25,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 12:02:25,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 12:02:25,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 12:02:25,280 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 12:02:25,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:02:17" (3/4) ... [2024-09-20 12:02:25,282 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 12:02:25,331 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 12:02:25,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 12:02:25,332 INFO L158 Benchmark]: Toolchain (without parser) took 8735.16ms. Allocated memory was 188.7MB in the beginning and 289.4MB in the end (delta: 100.7MB). Free memory was 120.4MB in the beginning and 178.0MB in the end (delta: -57.6MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-09-20 12:02:25,333 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:02:25,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.35ms. Allocated memory is still 188.7MB. Free memory was 120.2MB in the beginning and 108.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-20 12:02:25,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.14ms. Allocated memory is still 188.7MB. Free memory was 108.7MB in the beginning and 107.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:02:25,333 INFO L158 Benchmark]: Boogie Preprocessor took 90.07ms. Allocated memory is still 188.7MB. Free memory was 107.7MB in the beginning and 161.5MB in the end (delta: -53.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-09-20 12:02:25,334 INFO L158 Benchmark]: RCFGBuilder took 362.57ms. Allocated memory is still 188.7MB. Free memory was 161.5MB in the beginning and 147.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 12:02:25,334 INFO L158 Benchmark]: TraceAbstraction took 7945.92ms. Allocated memory was 188.7MB in the beginning and 289.4MB in the end (delta: 100.7MB). Free memory was 147.3MB in the beginning and 180.1MB in the end (delta: -32.8MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. [2024-09-20 12:02:25,334 INFO L158 Benchmark]: Witness Printer took 51.78ms. Allocated memory is still 289.4MB. Free memory was 180.1MB in the beginning and 178.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:02:25,337 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.35ms. Allocated memory is still 188.7MB. Free memory was 120.2MB in the beginning and 108.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.14ms. Allocated memory is still 188.7MB. Free memory was 108.7MB in the beginning and 107.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.07ms. Allocated memory is still 188.7MB. Free memory was 107.7MB in the beginning and 161.5MB in the end (delta: -53.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 362.57ms. Allocated memory is still 188.7MB. Free memory was 161.5MB in the beginning and 147.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7945.92ms. Allocated memory was 188.7MB in the beginning and 289.4MB in the end (delta: 100.7MB). Free memory was 147.3MB in the beginning and 180.1MB in the end (delta: -32.8MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. * Witness Printer took 51.78ms. Allocated memory is still 289.4MB. Free memory was 180.1MB in the beginning and 178.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 1463 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1160 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 962 IncrementalHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 303 mSDtfsCounter, 962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 665 SyntacticMatches, 18 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=9, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 985 ConstructedInterpolants, 0 QuantifiedInterpolants, 2990 SizeOfPredicates, 14 NumberOfNonLiveVariables, 628 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2630/2902 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: 55]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((((long long) 2 + buflim) == bufferlen) && (in == 0)) && (0 <= buflim)) && (buf == 0)) && (((long long) bufferlen + 1) <= inlen)) || ((((((((long long) bufferlen + in) + 1) <= ((long long) buf + inlen)) && (((long long) 2 + buflim) == bufferlen)) && (1 <= in)) && (0 <= buf)) && (buf <= buflim))) - 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-20 12:02:25,366 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE