./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gj2007.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 e210f4af0021f1e0c887bbfa24b18aad98424108efaad4cfc57802fd9fd5ce53 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 21:43:13,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:43:13,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:43:13,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:43:13,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:43:13,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:43:13,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:43:13,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:43:13,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:43:13,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:43:13,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:43:13,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:43:13,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:43:13,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:43:13,983 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:43:13,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:43:13,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:43:13,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:43:13,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:43:13,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:43:13,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:43:13,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:43:13,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:43:13,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:43:13,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:43:13,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:43:13,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:43:13,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:43:13,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:43:13,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:43:13,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:43:13,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:43:13,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:43:13,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:43:13,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:43:13,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:43:13,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:43:13,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:43:13,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:43:13,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:43:13,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:43:13,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:43:13,989 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 -> e210f4af0021f1e0c887bbfa24b18aad98424108efaad4cfc57802fd9fd5ce53 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 21:43:14,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:43:14,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:43:14,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:43:14,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:43:14,180 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:43:14,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gj2007.i [2024-09-12 21:43:15,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:43:15,541 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:43:15,542 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.i [2024-09-12 21:43:15,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/dc44edb41/27610a9cf2774ee59cdd06d01ebd2397/FLAG4624bcc14 [2024-09-12 21:43:15,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/dc44edb41/27610a9cf2774ee59cdd06d01ebd2397 [2024-09-12 21:43:15,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:43:15,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:43:15,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:43:15,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:43:15,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:43:15,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43971c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15, skipping insertion in model container [2024-09-12 21:43:15,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:43:15,715 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.i[895,908] [2024-09-12 21:43:15,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:43:15,729 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:43:15,740 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.i[895,908] [2024-09-12 21:43:15,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:43:15,752 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:43:15,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15 WrapperNode [2024-09-12 21:43:15,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:43:15,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:43:15,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:43:15,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:43:15,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,774 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:43:15,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:43:15,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:43:15,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:43:15,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:43:15,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,790 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 21:43:15,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:43:15,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:43:15,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:43:15,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:43:15,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (1/1) ... [2024-09-12 21:43:15,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:43:15,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:15,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 21:43:15,828 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 21:43:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:43:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:43:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:43:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:43:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:43:15,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:43:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:43:15,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:43:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 21:43:15,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 21:43:15,933 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:43:15,934 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:43:16,063 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-12 21:43:16,063 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:43:16,087 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:43:16,087 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 21:43:16,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:43:16 BoogieIcfgContainer [2024-09-12 21:43:16,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:43:16,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:43:16,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:43:16,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:43:16,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:43:15" (1/3) ... [2024-09-12 21:43:16,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4c1215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:43:16, skipping insertion in model container [2024-09-12 21:43:16,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:43:15" (2/3) ... [2024-09-12 21:43:16,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4c1215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:43:16, skipping insertion in model container [2024-09-12 21:43:16,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:43:16" (3/3) ... [2024-09-12 21:43:16,099 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.i [2024-09-12 21:43:16,114 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:43:16,115 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 21:43:16,168 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:43:16,174 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;@4b678e70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:43:16,176 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 21:43:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-12 21:43:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 21:43:16,186 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:16,186 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:16,187 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:16,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1957128844, now seen corresponding path program 1 times [2024-09-12 21:43:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:16,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980483118] [2024-09-12 21:43:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:16,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:16,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:16,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980483118] [2024-09-12 21:43:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980483118] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:16,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 21:43:16,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173872171] [2024-09-12 21:43:16,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:16,330 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 21:43:16,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:16,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 21:43:16,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 21:43:16,349 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:16,371 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-09-12 21:43:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 21:43:16,372 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 21:43:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:16,377 INFO L225 Difference]: With dead ends: 29 [2024-09-12 21:43:16,377 INFO L226 Difference]: Without dead ends: 12 [2024-09-12 21:43:16,379 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-12 21:43:16,383 INFO L434 NwaCegarLoop]: 17 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, 17 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-12 21:43:16,384 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:43:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-12 21:43:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-12 21:43:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 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-12 21:43:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-09-12 21:43:16,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-09-12 21:43:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:16,411 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-09-12 21:43:16,411 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:16,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-09-12 21:43:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 21:43:16,412 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:16,412 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:16,412 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:43:16,412 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:16,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:16,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1947893634, now seen corresponding path program 1 times [2024-09-12 21:43:16,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:16,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024252506] [2024-09-12 21:43:16,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:16,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:16,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:16,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:16,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024252506] [2024-09-12 21:43:16,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024252506] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:16,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:16,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 21:43:16,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267463294] [2024-09-12 21:43:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:16,500 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 21:43:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 21:43:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:43:16,502 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:16,522 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-09-12 21:43:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 21:43:16,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 21:43:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:16,523 INFO L225 Difference]: With dead ends: 21 [2024-09-12 21:43:16,523 INFO L226 Difference]: Without dead ends: 14 [2024-09-12 21:43:16,523 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:43:16,524 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:16,526 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:43:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-12 21:43:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-09-12 21:43:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-12 21:43:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-09-12 21:43:16,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2024-09-12 21:43:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:16,532 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-09-12 21:43:16,532 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:16,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-09-12 21:43:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 21:43:16,533 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:16,533 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:16,533 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:43:16,534 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:16,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash 365820639, now seen corresponding path program 1 times [2024-09-12 21:43:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:16,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683891575] [2024-09-12 21:43:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:16,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:16,587 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-12 21:43:16,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:16,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683891575] [2024-09-12 21:43:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683891575] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:16,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453768335] [2024-09-12 21:43:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:16,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:16,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:16,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:16,592 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 21:43:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:16,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 21:43:16,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:16,679 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-12 21:43:16,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:16,712 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-12 21:43:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453768335] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:16,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 21:43:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854827721] [2024-09-12 21:43:16,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:16,713 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:43:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:43:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:43:16,714 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:16,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:16,744 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-09-12 21:43:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:43:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 12 [2024-09-12 21:43:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:16,744 INFO L225 Difference]: With dead ends: 26 [2024-09-12 21:43:16,744 INFO L226 Difference]: Without dead ends: 19 [2024-09-12 21:43:16,745 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:43:16,745 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:16,746 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:43:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-12 21:43:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-12 21:43:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-12 21:43:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-09-12 21:43:16,749 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2024-09-12 21:43:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:16,749 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-09-12 21:43:16,749 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:16,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-09-12 21:43:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 21:43:16,750 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:16,750 INFO L216 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:16,763 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 21:43:16,953 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-12 21:43:16,954 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:16,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1810326642, now seen corresponding path program 1 times [2024-09-12 21:43:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:16,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642880484] [2024-09-12 21:43:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:17,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:43:17,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642880484] [2024-09-12 21:43:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642880484] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795768866] [2024-09-12 21:43:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:17,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:17,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:17,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:17,036 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 21:43:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:17,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 21:43:17,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:43:17,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:43:17,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795768866] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:17,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:17,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-12 21:43:17,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717500794] [2024-09-12 21:43:17,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:17,121 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 21:43:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:17,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 21:43:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:43:17,122 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:17,149 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-09-12 21:43:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:43:17,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-12 21:43:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:17,150 INFO L225 Difference]: With dead ends: 37 [2024-09-12 21:43:17,150 INFO L226 Difference]: Without dead ends: 27 [2024-09-12 21:43:17,150 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:43:17,151 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:17,151 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:43:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-12 21:43:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-12 21:43:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-12 21:43:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-09-12 21:43:17,157 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2024-09-12 21:43:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:17,157 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-09-12 21:43:17,157 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:17,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-09-12 21:43:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 21:43:17,158 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:17,158 INFO L216 NwaCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:17,170 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 21:43:17,359 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-12 21:43:17,359 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:17,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1138297446, now seen corresponding path program 2 times [2024-09-12 21:43:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:17,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714124811] [2024-09-12 21:43:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:17,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:43:17,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714124811] [2024-09-12 21:43:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714124811] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397828372] [2024-09-12 21:43:17,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 21:43:17,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:17,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:17,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:17,496 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 21:43:17,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 21:43:17,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:17,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 21:43:17,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:43:17,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:43:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397828372] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:17,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-09-12 21:43:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535457275] [2024-09-12 21:43:17,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:17,664 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 21:43:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 21:43:17,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-09-12 21:43:17,666 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:17,722 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-09-12 21:43:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 21:43:17,724 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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-12 21:43:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:17,724 INFO L225 Difference]: With dead ends: 53 [2024-09-12 21:43:17,724 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 21:43:17,725 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-09-12 21:43:17,725 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:17,726 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:43:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 21:43:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-12 21:43:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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-12 21:43:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2024-09-12 21:43:17,752 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 26 [2024-09-12 21:43:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:17,752 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2024-09-12 21:43:17,752 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:17,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2024-09-12 21:43:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-12 21:43:17,755 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:17,755 INFO L216 NwaCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:17,767 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 21:43:17,959 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-12 21:43:17,960 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:17,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 998160974, now seen corresponding path program 3 times [2024-09-12 21:43:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:17,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649818945] [2024-09-12 21:43:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:18,211 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:43:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649818945] [2024-09-12 21:43:18,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649818945] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929816783] [2024-09-12 21:43:18,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 21:43:18,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:18,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:18,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:18,219 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 21:43:18,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-12 21:43:18,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:18,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 21:43:18,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-09-12 21:43:18,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-09-12 21:43:18,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929816783] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:18,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:18,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 23 [2024-09-12 21:43:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363309089] [2024-09-12 21:43:18,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:18,357 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 21:43:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:18,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 21:43:18,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-09-12 21:43:18,358 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:18,432 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2024-09-12 21:43:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-12 21:43:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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-12 21:43:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:18,435 INFO L225 Difference]: With dead ends: 63 [2024-09-12 21:43:18,435 INFO L226 Difference]: Without dead ends: 53 [2024-09-12 21:43:18,435 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-09-12 21:43:18,436 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:18,436 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-12 21:43:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-12 21:43:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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-12 21:43:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-09-12 21:43:18,443 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 42 [2024-09-12 21:43:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:18,443 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-09-12 21:43:18,443 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:18,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-09-12 21:43:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-12 21:43:18,444 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:18,444 INFO L216 NwaCegarLoop]: trace histogram [21, 15, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:18,456 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 21:43:18,645 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-12 21:43:18,645 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:18,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash -327394665, now seen corresponding path program 4 times [2024-09-12 21:43:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:18,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647901289] [2024-09-12 21:43:18,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:18,915 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 176 proven. 240 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-12 21:43:18,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:18,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647901289] [2024-09-12 21:43:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647901289] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:18,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755455634] [2024-09-12 21:43:18,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 21:43:18,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:18,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:18,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:18,921 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 21:43:18,968 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 21:43:18,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:18,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 21:43:18,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 176 proven. 240 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-12 21:43:19,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 176 proven. 240 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-12 21:43:19,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755455634] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:19,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:19,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2024-09-12 21:43:19,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459031736] [2024-09-12 21:43:19,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:19,387 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-12 21:43:19,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-12 21:43:19,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 21:43:19,389 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:19,472 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2024-09-12 21:43:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-12 21:43:19,472 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 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 52 [2024-09-12 21:43:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:19,473 INFO L225 Difference]: With dead ends: 105 [2024-09-12 21:43:19,473 INFO L226 Difference]: Without dead ends: 87 [2024-09-12 21:43:19,474 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 21:43:19,474 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:19,474 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-12 21:43:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-12 21:43:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 82 states have internal predecessors, (89), 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-12 21:43:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-09-12 21:43:19,483 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 52 [2024-09-12 21:43:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:19,483 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-09-12 21:43:19,486 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:19,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-09-12 21:43:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-09-12 21:43:19,489 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:19,489 INFO L216 NwaCegarLoop]: trace histogram [38, 32, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:19,502 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 21:43:19,694 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-12 21:43:19,695 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:19,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 502729092, now seen corresponding path program 5 times [2024-09-12 21:43:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599287555] [2024-09-12 21:43:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:20,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 1056 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-12 21:43:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:20,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599287555] [2024-09-12 21:43:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599287555] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764535758] [2024-09-12 21:43:20,389 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 21:43:20,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:20,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:20,390 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-12 21:43:20,391 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-12 21:43:20,454 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2024-09-12 21:43:20,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:20,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-12 21:43:20,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 1056 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-12 21:43:20,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 1056 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-12 21:43:21,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764535758] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:21,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:21,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 53 [2024-09-12 21:43:21,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311005107] [2024-09-12 21:43:21,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:21,391 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-12 21:43:21,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:21,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-12 21:43:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2024-09-12 21:43:21,393 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:21,499 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2024-09-12 21:43:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-12 21:43:21,500 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 53 states have internal predecessors, (113), 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 86 [2024-09-12 21:43:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:21,501 INFO L225 Difference]: With dead ends: 141 [2024-09-12 21:43:21,501 INFO L226 Difference]: Without dead ends: 123 [2024-09-12 21:43:21,504 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 141 SyntacticMatches, 16 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2024-09-12 21:43:21,505 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:21,505 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-09-12 21:43:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-09-12 21:43:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0593220338983051) internal successors, (125), 118 states have internal predecessors, (125), 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-12 21:43:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2024-09-12 21:43:21,519 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 86 [2024-09-12 21:43:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:21,519 INFO L474 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2024-09-12 21:43:21,519 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:21,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2024-09-12 21:43:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-09-12 21:43:21,521 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:21,522 INFO L216 NwaCegarLoop]: trace histogram [56, 50, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:21,536 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 21:43:21,722 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-12 21:43:21,722 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:21,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash -175082034, now seen corresponding path program 6 times [2024-09-12 21:43:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:21,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537605544] [2024-09-12 21:43:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:23,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:23,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537605544] [2024-09-12 21:43:23,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537605544] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:23,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000873340] [2024-09-12 21:43:23,316 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 21:43:23,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:23,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:23,318 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-12 21:43:23,319 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-12 21:43:23,359 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2024-09-12 21:43:23,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:23,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 21:43:23,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2024-09-12 21:43:23,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2024-09-12 21:43:23,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000873340] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:23,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:23,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 9, 9] total 66 [2024-09-12 21:43:23,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831537789] [2024-09-12 21:43:23,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:23,627 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-09-12 21:43:23,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:23,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-09-12 21:43:23,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2024-09-12 21:43:23,630 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:23,774 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2024-09-12 21:43:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-09-12 21:43:23,775 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 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 122 [2024-09-12 21:43:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:23,776 INFO L225 Difference]: With dead ends: 144 [2024-09-12 21:43:23,776 INFO L226 Difference]: Without dead ends: 139 [2024-09-12 21:43:23,777 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2024-09-12 21:43:23,777 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:23,777 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:43:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-09-12 21:43:23,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-09-12 21:43:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 134 states have internal predecessors, (149), 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-12 21:43:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2024-09-12 21:43:23,791 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 122 [2024-09-12 21:43:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:23,791 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2024-09-12 21:43:23,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:23,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2024-09-12 21:43:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-12 21:43:23,794 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:23,794 INFO L216 NwaCegarLoop]: trace histogram [64, 50, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:23,809 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 21:43:23,995 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-12 21:43:23,995 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:23,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1078842790, now seen corresponding path program 7 times [2024-09-12 21:43:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453738747] [2024-09-12 21:43:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:23,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:25,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:25,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453738747] [2024-09-12 21:43:25,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453738747] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620240423] [2024-09-12 21:43:25,604 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-12 21:43:25,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:25,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:25,605 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-12 21:43:25,605 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-12 21:43:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:25,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-09-12 21:43:25,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:25,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:43:28,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620240423] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:28,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:28,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 103 [2024-09-12 21:43:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867671486] [2024-09-12 21:43:28,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:28,205 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-09-12 21:43:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:28,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-09-12 21:43:28,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-09-12 21:43:28,208 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 103 states, 103 states have (on average 2.1650485436893203) internal successors, (223), 103 states have internal predecessors, (223), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:28,713 INFO L93 Difference]: Finished difference Result 216 states and 301 transitions. [2024-09-12 21:43:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-09-12 21:43:28,715 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.1650485436893203) internal successors, (223), 103 states have internal predecessors, (223), 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-12 21:43:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:28,716 INFO L225 Difference]: With dead ends: 216 [2024-09-12 21:43:28,716 INFO L226 Difference]: Without dead ends: 211 [2024-09-12 21:43:28,718 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 213 SyntacticMatches, 30 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-09-12 21:43:28,718 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:28,718 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:43:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-09-12 21:43:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-09-12 21:43:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.2475728155339805) internal successors, (257), 206 states have internal predecessors, (257), 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-12 21:43:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 261 transitions. [2024-09-12 21:43:28,728 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 261 transitions. Word has length 138 [2024-09-12 21:43:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:28,728 INFO L474 AbstractCegarLoop]: Abstraction has 211 states and 261 transitions. [2024-09-12 21:43:28,729 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.1650485436893203) internal successors, (223), 103 states have internal predecessors, (223), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:28,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 261 transitions. [2024-09-12 21:43:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-09-12 21:43:28,730 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:28,730 INFO L216 NwaCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:28,742 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-12 21:43:28,934 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:28,935 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:28,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:28,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1537228046, now seen corresponding path program 8 times [2024-09-12 21:43:28,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:28,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99533612] [2024-09-12 21:43:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:30,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-09-12 21:43:30,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:30,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99533612] [2024-09-12 21:43:30,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99533612] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:43:30,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972765361] [2024-09-12 21:43:30,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 21:43:30,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:43:30,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:43:30,393 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:43:30,395 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-12 21:43:30,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 21:43:30,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:43:30,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-09-12 21:43:30,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:43:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-09-12 21:43:30,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:43:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-09-12 21:43:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972765361] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:43:30,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:43:30,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2024-09-12 21:43:30,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510085919] [2024-09-12 21:43:30,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:43:30,973 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-09-12 21:43:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:30,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-09-12 21:43:30,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2024-09-12 21:43:30,974 INFO L87 Difference]: Start difference. First operand 211 states and 261 transitions. Second operand has 57 states, 57 states have (on average 1.912280701754386) internal successors, (109), 55 states have internal predecessors, (109), 2 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-12 21:43:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:31,888 INFO L93 Difference]: Finished difference Result 2867 states and 4242 transitions. [2024-09-12 21:43:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-12 21:43:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.912280701754386) internal successors, (109), 55 states have internal predecessors, (109), 2 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 210 [2024-09-12 21:43:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:31,898 INFO L225 Difference]: With dead ends: 2867 [2024-09-12 21:43:31,898 INFO L226 Difference]: Without dead ends: 2862 [2024-09-12 21:43:31,900 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2024-09-12 21:43:31,900 INFO L434 NwaCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 5675 mSDsCounter, 0 mSdLazyCounter, 2864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 5785 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:31,900 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 5785 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2864 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-12 21:43:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2024-09-12 21:43:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 213. [2024-09-12 21:43:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.25) internal successors, (260), 208 states have internal predecessors, (260), 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-12 21:43:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 264 transitions. [2024-09-12 21:43:31,957 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 264 transitions. Word has length 210 [2024-09-12 21:43:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:31,957 INFO L474 AbstractCegarLoop]: Abstraction has 213 states and 264 transitions. [2024-09-12 21:43:31,957 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.912280701754386) internal successors, (109), 55 states have internal predecessors, (109), 2 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-12 21:43:31,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:31,958 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 264 transitions. [2024-09-12 21:43:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-09-12 21:43:31,959 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:43:31,959 INFO L216 NwaCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:43:31,971 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-12 21:43:32,159 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-12 21:43:32,159 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:43:32,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1295635341, now seen corresponding path program 9 times [2024-09-12 21:43:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:43:32,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997728654] [2024-09-12 21:43:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:43:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:43:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:33,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:43:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:43:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-09-12 21:43:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:43:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997728654] [2024-09-12 21:43:33,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997728654] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:43:33,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:43:33,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2024-09-12 21:43:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925773994] [2024-09-12 21:43:33,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:43:33,372 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-12 21:43:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:43:33,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-12 21:43:33,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-09-12 21:43:33,373 INFO L87 Difference]: Start difference. First operand 213 states and 264 transitions. Second operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:43:33,627 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2024-09-12 21:43:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-12 21:43:33,628 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 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 212 [2024-09-12 21:43:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:43:33,628 INFO L225 Difference]: With dead ends: 312 [2024-09-12 21:43:33,628 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 21:43:33,630 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-09-12 21:43:33,630 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:43:33,630 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:43:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 21:43:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 21:43:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 21:43:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 21:43:33,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2024-09-12 21:43:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:43:33,631 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 21:43:33,633 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:43:33,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:43:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 21:43:33,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 21:43:33,635 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 21:43:33,635 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 21:43:33,637 INFO L408 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1] [2024-09-12 21:43:33,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 21:43:36,877 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 21:43:36,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 09:43:36 BoogieIcfgContainer [2024-09-12 21:43:36,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 21:43:36,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 21:43:36,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 21:43:36,895 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 21:43:36,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:43:16" (3/4) ... [2024-09-12 21:43:36,896 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 21:43:36,899 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 21:43:36,899 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 21:43:36,899 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 21:43:36,901 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-09-12 21:43:36,901 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 21:43:36,902 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 21:43:36,902 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 21:43:36,967 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 21:43:36,968 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 21:43:36,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 21:43:36,968 INFO L158 Benchmark]: Toolchain (without parser) took 21399.92ms. Allocated memory was 178.3MB in the beginning and 545.3MB in the end (delta: 367.0MB). Free memory was 111.4MB in the beginning and 494.2MB in the end (delta: -382.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:43:36,968 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:43:36,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.89ms. Allocated memory is still 178.3MB. Free memory was 111.1MB in the beginning and 99.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 21:43:36,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.06ms. Allocated memory is still 178.3MB. Free memory was 99.9MB in the beginning and 98.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:43:36,969 INFO L158 Benchmark]: Boogie Preprocessor took 25.87ms. Allocated memory is still 178.3MB. Free memory was 98.9MB in the beginning and 97.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 21:43:36,969 INFO L158 Benchmark]: RCFGBuilder took 287.18ms. Allocated memory is still 178.3MB. Free memory was 97.3MB in the beginning and 144.3MB in the end (delta: -47.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-09-12 21:43:36,970 INFO L158 Benchmark]: TraceAbstraction took 20804.67ms. Allocated memory was 178.3MB in the beginning and 545.3MB in the end (delta: 367.0MB). Free memory was 144.3MB in the beginning and 498.4MB in the end (delta: -354.1MB). Peak memory consumption was 269.3MB. Max. memory is 16.1GB. [2024-09-12 21:43:36,970 INFO L158 Benchmark]: Witness Printer took 73.55ms. Allocated memory is still 545.3MB. Free memory was 498.4MB in the beginning and 494.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 21:43:36,971 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.89ms. Allocated memory is still 178.3MB. Free memory was 111.1MB in the beginning and 99.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.06ms. Allocated memory is still 178.3MB. Free memory was 99.9MB in the beginning and 98.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.87ms. Allocated memory is still 178.3MB. Free memory was 98.9MB in the beginning and 97.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 287.18ms. Allocated memory is still 178.3MB. Free memory was 97.3MB in the beginning and 144.3MB in the end (delta: -47.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20804.67ms. Allocated memory was 178.3MB in the beginning and 545.3MB in the end (delta: 367.0MB). Free memory was 144.3MB in the beginning and 498.4MB in the end (delta: -354.1MB). Peak memory consumption was 269.3MB. Max. memory is 16.1GB. * Witness Printer took 73.55ms. Allocated memory is still 545.3MB. Free memory was 498.4MB in the beginning and 494.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 12, TraceHistogramMax: 101, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 6122 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5902 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4129 IncrementalHoareTripleChecker+Invalid, 4418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 220 mSDtfsCounter, 4129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1754 GetRequests, 1302 SyntacticMatches, 48 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=11, InterpolantAutomatonStates: 419, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 2649 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 1644 NumberOfCodeBlocks, 1562 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 5604 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1586 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 26464/68563 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((x == 80) && (y == 80)) || ((x == 83) && (y == 83))) || ((67 == x) && (67 == y))) || ((x == 75) && (y == 75))) || ((x == 65) && (y == 65))) || ((66 == y) && (66 == x))) || ((94 == x) && (94 == y))) || ((81 == y) && (81 == x))) || ((57 == y) && (57 == x))) || ((51 == x) && (51 == y))) || ((y == 79) && (x == 79))) || ((y == 54) && (x == 54))) || ((98 == y) && (98 == x))) || ((x == 96) && (y == 96))) || ((92 == y) && (92 == x))) || ((y == 82) && (x == 82))) || ((77 == x) && (77 == y))) || ((88 == y) && (88 == x))) || ((x == 63) && (y == 63))) || ((59 == y) && (59 == x))) || ((x == 60) && (y == 60))) || ((y == 55) && (x == 55))) || ((y == 71) && (x == 71))) || ((x == 58) && (y == 58))) || ((y == 50) && (x <= 50))) || ((y == 62) && (x == 62))) || ((64 == y) && (64 == x))) || ((76 == y) && (76 == x))) || ((y == 93) && (x == 93))) || ((x == 69) && (y == 69))) || ((97 == x) && (97 == y))) || ((x == 61) && (y == 61))) || ((87 == y) && (87 == x))) || ((53 == y) && (53 == x))) || ((x == 70) && (y == 70))) || ((72 == y) && (72 == x))) || ((91 == y) && (91 == x))) || ((x == 74) && (y == 74))) || ((x == 52) && (y == 52))) || ((y == 99) && (x == 99))) || ((x == 73) && (y == 73))) || ((56 == y) && (56 == x))) || ((x == 78) && (y == 78))) || ((100 <= x) && (y == 100))) || ((84 == y) && (84 == x))) || ((68 == y) && (68 == x))) || ((95 == x) && (95 == y))) || ((y == 86) && (x == 86))) || ((x == 90) && (y == 90))) || ((y == 85) && (x == 85))) || ((x == 89) && (y == 89))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-12 21:43:36,995 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE