./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-new/count_by_k.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-new/count_by_k.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 ee41851a84d57c0c483c2a5edf48180b7c141c1991cdc82f0d66c6775eb49f5b --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:24:54,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:24:54,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:24:54,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:24:54,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:24:54,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:24:54,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:24:54,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:24:54,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:24:54,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:24:54,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:24:54,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:24:54,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:24:54,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:24:54,983 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:24:54,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:24:54,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:24:54,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:24:54,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:24:54,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:24:54,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:24:54,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:24:54,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:24:54,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:24:54,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:24:54,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:24:54,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:24:54,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:24:54,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:24:54,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:24:54,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:24:54,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:24:54,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:24:54,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:24:54,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:24:54,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:24:54,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:24:54,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:24:54,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:24:54,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:24:54,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:24:54,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:24:54,991 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 -> ee41851a84d57c0c483c2a5edf48180b7c141c1991cdc82f0d66c6775eb49f5b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:24:55,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:24:55,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:24:55,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:24:55,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:24:55,274 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:24:55,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-new/count_by_k.i [2024-09-25 10:24:56,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:24:56,791 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:24:56,792 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-new/count_by_k.i [2024-09-25 10:24:56,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/487cb51d1/a4c3991728a94b6ab88f9ee0f6288d90/FLAG2ae835e8a [2024-09-25 10:24:57,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/487cb51d1/a4c3991728a94b6ab88f9ee0f6288d90 [2024-09-25 10:24:57,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:24:57,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:24:57,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:24:57,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:24:57,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:24:57,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b030aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57, skipping insertion in model container [2024-09-25 10:24:57,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:24:57,337 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-new/count_by_k.i[891,904] [2024-09-25 10:24:57,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:24:57,356 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:24:57,367 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-new/count_by_k.i[891,904] [2024-09-25 10:24:57,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:24:57,382 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:24:57,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57 WrapperNode [2024-09-25 10:24:57,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:24:57,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:24:57,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:24:57,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:24:57,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,398 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:24:57,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:24:57,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:24:57,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:24:57,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:24:57,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,418 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:24:57,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:24:57,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:24:57,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:24:57,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:24:57,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (1/1) ... [2024-09-25 10:24:57,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:24:57,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:57,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:24:57,472 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:24:57,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:24:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:24:57,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:24:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:24:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:24:57,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:24:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:24:57,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:24:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:24:57,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:24:57,577 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:24:57,579 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:24:57,686 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:24:57,686 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:24:57,701 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:24:57,701 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:24:57,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:24:57 BoogieIcfgContainer [2024-09-25 10:24:57,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:24:57,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:24:57,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:24:57,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:24:57,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:24:57" (1/3) ... [2024-09-25 10:24:57,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6bc253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:24:57, skipping insertion in model container [2024-09-25 10:24:57,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:57" (2/3) ... [2024-09-25 10:24:57,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6bc253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:24:57, skipping insertion in model container [2024-09-25 10:24:57,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:24:57" (3/3) ... [2024-09-25 10:24:57,708 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_k.i [2024-09-25 10:24:57,721 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:24:57,721 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:24:57,759 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:24:57,764 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;@7b33ad07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:24:57,764 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:24:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:24:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:24:57,773 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:57,774 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:57,774 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:57,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2086566020, now seen corresponding path program 1 times [2024-09-25 10:24:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:57,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279137188] [2024-09-25 10:24:57,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:57,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:57,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:57,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279137188] [2024-09-25 10:24:57,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279137188] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:24:57,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:24:57,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:24:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704843640] [2024-09-25 10:24:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:24:57,911 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:24:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:57,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:24:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:24:57,933 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:57,951 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-25 10:24:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:24:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2024-09-25 10:24:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:57,958 INFO L225 Difference]: With dead ends: 31 [2024-09-25 10:24:57,958 INFO L226 Difference]: Without dead ends: 12 [2024-09-25 10:24:57,960 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-25 10:24:57,963 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:57,963 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-25 10:24:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-25 10:24:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-09-25 10:24:57,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2024-09-25 10:24:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:57,987 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-09-25 10:24:57,987 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:57,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-09-25 10:24:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:24:57,988 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:57,988 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:57,989 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:24:57,989 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:57,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:57,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2092107146, now seen corresponding path program 1 times [2024-09-25 10:24:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:57,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708860322] [2024-09-25 10:24:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:58,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:58,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:58,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708860322] [2024-09-25 10:24:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708860322] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:24:58,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:24:58,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:24:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560982301] [2024-09-25 10:24:58,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:24:58,201 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:24:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:24:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:24:58,202 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:58,231 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-09-25 10:24:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:24:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2024-09-25 10:24:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:58,232 INFO L225 Difference]: With dead ends: 18 [2024-09-25 10:24:58,233 INFO L226 Difference]: Without dead ends: 13 [2024-09-25 10:24:58,233 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:24:58,234 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:58,234 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-25 10:24:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-25 10:24:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-09-25 10:24:58,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2024-09-25 10:24:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:58,238 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-09-25 10:24:58,238 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:58,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-09-25 10:24:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 10:24:58,239 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:58,239 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:58,239 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:24:58,239 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:58,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 375865698, now seen corresponding path program 1 times [2024-09-25 10:24:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120161871] [2024-09-25 10:24:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:58,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:58,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:58,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120161871] [2024-09-25 10:24:58,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120161871] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:24:58,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006734564] [2024-09-25 10:24:58,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:58,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:58,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:58,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:24:58,344 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:24:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:58,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:24:58,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:24:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:58,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:24:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:58,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006734564] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:24:58,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:24:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2024-09-25 10:24:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213556881] [2024-09-25 10:24:58,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:24:58,470 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:24:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:24:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:24:58,471 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:58,493 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-09-25 10:24:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:24:58,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 10:24:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:58,494 INFO L225 Difference]: With dead ends: 20 [2024-09-25 10:24:58,494 INFO L226 Difference]: Without dead ends: 15 [2024-09-25 10:24:58,495 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:24:58,496 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:58,496 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-25 10:24:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-25 10:24:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-09-25 10:24:58,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2024-09-25 10:24:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:58,500 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-09-25 10:24:58,500 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:58,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-09-25 10:24:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:24:58,501 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:58,501 INFO L216 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:58,514 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:24:58,703 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:58,707 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:58,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash 473568226, now seen corresponding path program 2 times [2024-09-25 10:24:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:58,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986613171] [2024-09-25 10:24:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:58,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:58,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:58,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986613171] [2024-09-25 10:24:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986613171] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:24:58,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924178471] [2024-09-25 10:24:58,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:24:58,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:58,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:58,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:24:58,833 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:24:58,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:24:58,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:24:58,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:24:58,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:24:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:58,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:24:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:59,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924178471] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:24:59,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:24:59,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-25 10:24:59,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227836000] [2024-09-25 10:24:59,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:24:59,025 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:24:59,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:59,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:24:59,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:24:59,027 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:59,109 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-09-25 10:24:59,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:24:59,110 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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-25 10:24:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:59,110 INFO L225 Difference]: With dead ends: 24 [2024-09-25 10:24:59,110 INFO L226 Difference]: Without dead ends: 19 [2024-09-25 10:24:59,111 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:24:59,111 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:59,111 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-25 10:24:59,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-25 10:24:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-09-25 10:24:59,115 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2024-09-25 10:24:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:59,115 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-09-25 10:24:59,116 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:59,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-09-25 10:24:59,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 10:24:59,117 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:59,117 INFO L216 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:59,129 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:24:59,317 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:59,318 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:59,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1539823842, now seen corresponding path program 3 times [2024-09-25 10:24:59,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:59,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710335386] [2024-09-25 10:24:59,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:59,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:59,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:59,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710335386] [2024-09-25 10:24:59,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710335386] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:24:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726363513] [2024-09-25 10:24:59,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:24:59,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:59,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:59,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:24:59,435 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:24:59,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-25 10:24:59,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:24:59,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:24:59,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:24:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:59,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:24:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:59,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726363513] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:24:59,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:24:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-09-25 10:24:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455058823] [2024-09-25 10:24:59,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:24:59,663 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 10:24:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:59,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 10:24:59,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-09-25 10:24:59,664 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:59,911 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-09-25 10:24:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 10:24:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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 18 [2024-09-25 10:24:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:59,912 INFO L225 Difference]: With dead ends: 32 [2024-09-25 10:24:59,912 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 10:24:59,913 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=339, Invalid=717, Unknown=0, NotChecked=0, Total=1056 [2024-09-25 10:24:59,913 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:59,913 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 10:24:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-25 10:24:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-09-25 10:24:59,918 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 18 [2024-09-25 10:24:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:59,918 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-09-25 10:24:59,918 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:24:59,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-09-25 10:24:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 10:24:59,919 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:59,919 INFO L216 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:59,932 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:25:00,123 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:00,124 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:00,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash -253500702, now seen corresponding path program 4 times [2024-09-25 10:25:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:00,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626740285] [2024-09-25 10:25:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:00,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:00,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:00,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626740285] [2024-09-25 10:25:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626740285] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:00,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999323544] [2024-09-25 10:25:00,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:25:00,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:00,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:00,392 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:25:00,396 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:25:00,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:25:00,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:25:00,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 10:25:00,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:00,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999323544] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:01,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2024-09-25 10:25:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906151693] [2024-09-25 10:25:01,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:01,027 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-25 10:25:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-25 10:25:01,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=842, Unknown=0, NotChecked=0, Total=1260 [2024-09-25 10:25:01,028 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:01,775 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2024-09-25 10:25:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-25 10:25:01,779 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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 26 [2024-09-25 10:25:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:01,780 INFO L225 Difference]: With dead ends: 48 [2024-09-25 10:25:01,780 INFO L226 Difference]: Without dead ends: 43 [2024-09-25 10:25:01,781 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1375, Invalid=2785, Unknown=0, NotChecked=0, Total=4160 [2024-09-25 10:25:01,782 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:01,782 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:25:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-25 10:25:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-25 10:25:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2024-09-25 10:25:01,796 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 26 [2024-09-25 10:25:01,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:01,797 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2024-09-25 10:25:01,797 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:01,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2024-09-25 10:25:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-25 10:25:01,798 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:01,798 INFO L216 NwaCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:01,811 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:25:01,998 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:01,998 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:01,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash -702679326, now seen corresponding path program 5 times [2024-09-25 10:25:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:01,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713151421] [2024-09-25 10:25:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:02,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:02,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713151421] [2024-09-25 10:25:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713151421] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:02,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139675496] [2024-09-25 10:25:02,791 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:25:02,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:02,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:02,793 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:25:02,801 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:25:02,849 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-09-25 10:25:02,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:25:02,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-25 10:25:02,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:03,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:04,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139675496] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:04,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:04,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 68 [2024-09-25 10:25:04,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275497990] [2024-09-25 10:25:04,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:04,385 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-09-25 10:25:04,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:04,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-09-25 10:25:04,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1594, Invalid=2962, Unknown=0, NotChecked=0, Total=4556 [2024-09-25 10:25:04,387 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 68 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:07,165 INFO L93 Difference]: Finished difference Result 80 states and 111 transitions. [2024-09-25 10:25:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-09-25 10:25:07,165 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 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 42 [2024-09-25 10:25:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:07,166 INFO L225 Difference]: With dead ends: 80 [2024-09-25 10:25:07,166 INFO L226 Difference]: Without dead ends: 75 [2024-09-25 10:25:07,170 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5559, Invalid=10953, Unknown=0, NotChecked=0, Total=16512 [2024-09-25 10:25:07,171 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:07,171 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:25:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-09-25 10:25:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-09-25 10:25:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2024-09-25 10:25:07,198 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 42 [2024-09-25 10:25:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:07,198 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2024-09-25 10:25:07,198 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:07,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2024-09-25 10:25:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-25 10:25:07,200 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:07,200 INFO L216 NwaCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:07,216 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:25:07,401 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:25:07,401 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:07,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1533403422, now seen corresponding path program 6 times [2024-09-25 10:25:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:07,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236026939] [2024-09-25 10:25:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:09,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236026939] [2024-09-25 10:25:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236026939] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:09,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796293633] [2024-09-25 10:25:09,672 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:25:09,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:09,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:09,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:25:09,675 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:25:09,734 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2024-09-25 10:25:09,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:25:09,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-09-25 10:25:09,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:09,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796293633] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:14,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 132 [2024-09-25 10:25:14,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327570861] [2024-09-25 10:25:14,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:14,440 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2024-09-25 10:25:14,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:14,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2024-09-25 10:25:14,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6250, Invalid=11042, Unknown=0, NotChecked=0, Total=17292 [2024-09-25 10:25:14,444 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 132 states, 132 states have (on average 1.053030303030303) internal successors, (139), 132 states have internal predecessors, (139), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:27,371 INFO L93 Difference]: Finished difference Result 144 states and 207 transitions. [2024-09-25 10:25:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-09-25 10:25:27,372 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.053030303030303) internal successors, (139), 132 states have internal predecessors, (139), 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 74 [2024-09-25 10:25:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:27,374 INFO L225 Difference]: With dead ends: 144 [2024-09-25 10:25:27,374 INFO L226 Difference]: Without dead ends: 139 [2024-09-25 10:25:27,379 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13678 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=22375, Invalid=43417, Unknown=0, NotChecked=0, Total=65792 [2024-09-25 10:25:27,380 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:27,380 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:25:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-09-25 10:25:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-09-25 10:25:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2024-09-25 10:25:27,397 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 74 [2024-09-25 10:25:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:27,397 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2024-09-25 10:25:27,397 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.053030303030303) internal successors, (139), 132 states have internal predecessors, (139), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:27,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2024-09-25 10:25:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-25 10:25:27,399 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:27,399 INFO L216 NwaCegarLoop]: trace histogram [127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:27,415 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:25:27,599 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:27,599 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:27,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash 296906466, now seen corresponding path program 7 times [2024-09-25 10:25:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:27,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954874418] [2024-09-25 10:25:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:34,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:34,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:34,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954874418] [2024-09-25 10:25:34,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954874418] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:34,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715605088] [2024-09-25 10:25:34,775 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:25:34,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:34,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:34,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:25:34,777 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:25:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:36,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 130 conjuncts are in the unsatisfiable core [2024-09-25 10:25:36,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:36,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:52,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715605088] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:52,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:52,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130, 130] total 260 [2024-09-25 10:25:52,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944802846] [2024-09-25 10:25:52,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:52,777 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 260 states [2024-09-25 10:25:52,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:52,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 260 interpolants. [2024-09-25 10:25:52,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24778, Invalid=42562, Unknown=0, NotChecked=0, Total=67340 [2024-09-25 10:25:52,788 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand has 260 states, 260 states have (on average 1.0269230769230768) internal successors, (267), 260 states have internal predecessors, (267), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:03,543 INFO L93 Difference]: Finished difference Result 272 states and 399 transitions. [2024-09-25 10:27:03,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2024-09-25 10:27:03,544 INFO L78 Accepts]: Start accepts. Automaton has has 260 states, 260 states have (on average 1.0269230769230768) internal successors, (267), 260 states have internal predecessors, (267), 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 138 [2024-09-25 10:27:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:03,546 INFO L225 Difference]: With dead ends: 272 [2024-09-25 10:27:03,546 INFO L226 Difference]: Without dead ends: 267 [2024-09-25 10:27:03,557 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56014 ImplicationChecksByTransitivity, 90.8s TimeCoverageRelationStatistics Valid=89799, Invalid=172857, Unknown=0, NotChecked=0, Total=262656 [2024-09-25 10:27:03,558 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:03,558 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:27:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-09-25 10:27:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-09-25 10:27:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.0038167938931297) internal successors, (263), 262 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2024-09-25 10:27:03,581 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 138 [2024-09-25 10:27:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:03,581 INFO L474 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2024-09-25 10:27:03,581 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 260 states, 260 states have (on average 1.0269230769230768) internal successors, (267), 260 states have internal predecessors, (267), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:03,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2024-09-25 10:27:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-09-25 10:27:03,584 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:03,584 INFO L216 NwaCegarLoop]: trace histogram [255, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:03,597 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 10:27:03,784 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:03,785 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:03,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash 744689378, now seen corresponding path program 8 times [2024-09-25 10:27:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:03,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807267042] [2024-09-25 10:27:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:30,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32640 backedges. 0 proven. 32640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807267042] [2024-09-25 10:27:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807267042] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042097812] [2024-09-25 10:27:30,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:27:30,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:30,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:30,852 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:30,853 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:27:38,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:27:38,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:44,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 258 conjuncts are in the unsatisfiable core [2024-09-25 10:27:44,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 32640 backedges. 0 proven. 32640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:45,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:28:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 32640 backedges. 0 proven. 32640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:28:52,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042097812] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:28:52,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:28:52,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [258, 258, 258] total 515 [2024-09-25 10:28:52,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775400062] [2024-09-25 10:28:52,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:28:52,777 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 515 states [2024-09-25 10:28:52,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:28:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 515 interpolants. [2024-09-25 10:28:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98186, Invalid=166524, Unknown=0, NotChecked=0, Total=264710 [2024-09-25 10:28:52,796 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand has 515 states, 515 states have (on average 1.0135922330097087) internal successors, (522), 515 states have internal predecessors, (522), 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)