./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex3.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/bh2017-ex3.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 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:23:01,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:23:01,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:23:01,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:23:01,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:23:01,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:23:01,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:23:01,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:23:01,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:23:01,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:23:01,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:23:01,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:23:01,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:23:01,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:23:01,250 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:23:01,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:23:01,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:23:01,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:23:01,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:23:01,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:23:01,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:23:01,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:23:01,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:23:01,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:23:01,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:23:01,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:23:01,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:23:01,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:23:01,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:23:01,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:23:01,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:23:01,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:23:01,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:23:01,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:23:01,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:23:01,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:23:01,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:23:01,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:23:01,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:23:01,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:23:01,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:23:01,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:23:01,262 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 -> 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 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-11 19:23:01,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:23:01,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:23:01,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:23:01,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:23:01,566 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:23:01,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/bh2017-ex3.i [2024-09-11 19:23:02,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:23:03,149 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:23:03,150 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/bh2017-ex3.i [2024-09-11 19:23:03,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/90beba182/8b2b10a22682447696fd55733c529a86/FLAG65d80ae76 [2024-09-11 19:23:03,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/90beba182/8b2b10a22682447696fd55733c529a86 [2024-09-11 19:23:03,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:23:03,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:23:03,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:03,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:23:03,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:23:03,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb25e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03, skipping insertion in model container [2024-09-11 19:23:03,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:23:03,704 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/bh2017-ex3.i[799,812] [2024-09-11 19:23:03,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:03,729 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:23:03,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/bh2017-ex3.i[799,812] [2024-09-11 19:23:03,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:03,761 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:23:03,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03 WrapperNode [2024-09-11 19:23:03,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:03,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:03,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:23:03,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:23:03,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,793 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-09-11 19:23:03,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:03,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:23:03,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:23:03,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:23:03,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,815 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-11 19:23:03,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:23:03,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:23:03,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:23:03,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:23:03,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (1/1) ... [2024-09-11 19:23:03,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:23:03,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:03,858 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-11 19:23:03,861 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-11 19:23:03,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:23:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:23:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:23:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:23:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:23:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:23:03,951 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:23:03,953 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:23:04,069 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-11 19:23:04,069 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:23:04,090 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:23:04,090 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 19:23:04,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:04 BoogieIcfgContainer [2024-09-11 19:23:04,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:23:04,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:23:04,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:23:04,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:23:04,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:23:03" (1/3) ... [2024-09-11 19:23:04,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee452fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:23:04, skipping insertion in model container [2024-09-11 19:23:04,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:03" (2/3) ... [2024-09-11 19:23:04,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee452fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:23:04, skipping insertion in model container [2024-09-11 19:23:04,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:04" (3/3) ... [2024-09-11 19:23:04,100 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex3.i [2024-09-11 19:23:04,114 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:23:04,114 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:23:04,162 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:23:04,168 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;@5fc00b90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:23:04,185 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:23:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:23:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-11 19:23:04,194 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:04,195 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-11 19:23:04,195 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:04,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1248097640, now seen corresponding path program 1 times [2024-09-11 19:23:04,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:04,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751252144] [2024-09-11 19:23:04,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:04,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:04,447 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-11 19:23:04,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:04,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751252144] [2024-09-11 19:23:04,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751252144] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:04,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:04,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:23:04,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058272614] [2024-09-11 19:23:04,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:04,456 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:23:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:04,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:23:04,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:23:04,474 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:04,540 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions. [2024-09-11 19:23:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:23:04,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-09-11 19:23:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:04,549 INFO L225 Difference]: With dead ends: 45 [2024-09-11 19:23:04,549 INFO L226 Difference]: Without dead ends: 24 [2024-09-11 19:23:04,552 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:04,555 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:04,556 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-11 19:23:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-11 19:23:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:23:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-09-11 19:23:04,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 6 [2024-09-11 19:23:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:04,593 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-09-11 19:23:04,594 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:04,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-09-11 19:23:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 19:23:04,595 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:04,596 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:04,596 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:23:04,596 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:04,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 675454336, now seen corresponding path program 1 times [2024-09-11 19:23:04,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:04,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191785258] [2024-09-11 19:23:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:04,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:04,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:04,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:04,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191785258] [2024-09-11 19:23:04,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191785258] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:04,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:04,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:23:04,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606581772] [2024-09-11 19:23:04,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:04,758 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:23:04,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:04,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:23:04,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:23:04,760 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:23:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:04,819 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-09-11 19:23:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:23:04,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-11 19:23:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:04,822 INFO L225 Difference]: With dead ends: 30 [2024-09-11 19:23:04,822 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 19:23:04,823 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:04,824 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:04,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 19:23:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 19:23:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:23:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-11 19:23:04,844 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2024-09-11 19:23:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:04,844 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-11 19:23:04,844 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:23:04,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-11 19:23:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 19:23:04,846 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:04,846 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:04,846 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:23:04,846 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:04,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash 715879520, now seen corresponding path program 1 times [2024-09-11 19:23:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:04,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065635729] [2024-09-11 19:23:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:04,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:04,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:23:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065635729] [2024-09-11 19:23:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065635729] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:23:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116987003] [2024-09-11 19:23:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:04,963 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:04,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:04,965 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:23:04,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:04,987 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-09-11 19:23:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:04,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-11 19:23:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:04,989 INFO L225 Difference]: With dead ends: 66 [2024-09-11 19:23:04,992 INFO L226 Difference]: Without dead ends: 39 [2024-09-11 19:23:04,992 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11 19:23:04,993 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:04,995 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-11 19:23:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-11 19:23:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:23:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-09-11 19:23:05,017 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 20 [2024-09-11 19:23:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:05,017 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-09-11 19:23:05,017 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:23:05,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-09-11 19:23:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 19:23:05,019 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:05,019 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:05,019 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:23:05,021 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:05,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1791028434, now seen corresponding path program 1 times [2024-09-11 19:23:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50061136] [2024-09-11 19:23:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:23:05,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:05,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50061136] [2024-09-11 19:23:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50061136] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:05,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:23:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847554893] [2024-09-11 19:23:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:05,102 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:05,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:05,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:05,103 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:23:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:05,126 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2024-09-11 19:23:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:05,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-11 19:23:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:05,128 INFO L225 Difference]: With dead ends: 97 [2024-09-11 19:23:05,130 INFO L226 Difference]: Without dead ends: 59 [2024-09-11 19:23:05,130 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11 19:23:05,132 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:05,133 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-11 19:23:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-11 19:23:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-11 19:23:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2024-09-11 19:23:05,163 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 20 [2024-09-11 19:23:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:05,163 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2024-09-11 19:23:05,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:23:05,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2024-09-11 19:23:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 19:23:05,165 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:05,165 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:05,165 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:23:05,168 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:05,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1325115391, now seen corresponding path program 1 times [2024-09-11 19:23:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:05,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413195026] [2024-09-11 19:23:05,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,233 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:23:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 19:23:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:05,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:05,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413195026] [2024-09-11 19:23:05,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413195026] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:05,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960866222] [2024-09-11 19:23:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:05,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:05,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:05,246 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-11 19:23:05,248 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-11 19:23:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-11 19:23:05,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:05,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960866222] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:05,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:05,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-11 19:23:05,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052344362] [2024-09-11 19:23:05,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:05,428 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:23:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:05,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:23:05,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:05,430 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:23:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:05,514 INFO L93 Difference]: Finished difference Result 177 states and 269 transitions. [2024-09-11 19:23:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:05,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 35 [2024-09-11 19:23:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:05,517 INFO L225 Difference]: With dead ends: 177 [2024-09-11 19:23:05,517 INFO L226 Difference]: Without dead ends: 119 [2024-09-11 19:23:05,517 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 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-11 19:23:05,518 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:05,519 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 93 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-09-11 19:23:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-09-11 19:23:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-11 19:23:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2024-09-11 19:23:05,553 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 35 [2024-09-11 19:23:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:05,554 INFO L474 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-09-11 19:23:05,554 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:23:05,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2024-09-11 19:23:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 19:23:05,556 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:05,556 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:05,572 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:23:05,760 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:05,761 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:05,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1704439485, now seen corresponding path program 1 times [2024-09-11 19:23:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:05,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925288268] [2024-09-11 19:23:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:05,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:23:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 19:23:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:05,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:05,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925288268] [2024-09-11 19:23:05,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925288268] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:05,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590881902] [2024-09-11 19:23:05,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:05,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:05,872 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-11 19:23:05,874 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-11 19:23:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:05,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-11 19:23:05,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:05,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590881902] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:06,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:06,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-11 19:23:06,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539270694] [2024-09-11 19:23:06,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:06,028 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:23:06,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:06,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:23:06,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:06,029 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:23:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:06,154 INFO L93 Difference]: Finished difference Result 378 states and 596 transitions. [2024-09-11 19:23:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:06,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 35 [2024-09-11 19:23:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:06,158 INFO L225 Difference]: With dead ends: 378 [2024-09-11 19:23:06,158 INFO L226 Difference]: Without dead ends: 260 [2024-09-11 19:23:06,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 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-11 19:23:06,166 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:06,166 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 104 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-09-11 19:23:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-09-11 19:23:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 196 states have (on average 1.4387755102040816) internal successors, (282), 196 states have internal predecessors, (282), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-09-11 19:23:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 402 transitions. [2024-09-11 19:23:06,253 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 402 transitions. Word has length 35 [2024-09-11 19:23:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:06,253 INFO L474 AbstractCegarLoop]: Abstraction has 260 states and 402 transitions. [2024-09-11 19:23:06,253 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:23:06,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 402 transitions. [2024-09-11 19:23:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-09-11 19:23:06,257 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:06,257 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-09-11 19:23:06,274 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 19:23:06,461 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 19:23:06,462 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:06,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash -563554144, now seen corresponding path program 2 times [2024-09-11 19:23:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:06,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705433208] [2024-09-11 19:23:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:06,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:23:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 19:23:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 19:23:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 19:23:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-11 19:23:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-11 19:23:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-11 19:23:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-11 19:23:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-09-11 19:23:06,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705433208] [2024-09-11 19:23:06,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705433208] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:06,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:06,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:23:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652163889] [2024-09-11 19:23:06,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:06,652 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:23:06,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:06,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:23:06,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:06,653 INFO L87 Difference]: Start difference. First operand 260 states and 402 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:23:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:06,720 INFO L93 Difference]: Finished difference Result 266 states and 407 transitions. [2024-09-11 19:23:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:06,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 80 [2024-09-11 19:23:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:06,724 INFO L225 Difference]: With dead ends: 266 [2024-09-11 19:23:06,724 INFO L226 Difference]: Without dead ends: 264 [2024-09-11 19:23:06,725 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:06,725 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:06,726 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-09-11 19:23:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-09-11 19:23:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 199 states have (on average 1.4321608040201006) internal successors, (285), 199 states have internal predecessors, (285), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-09-11 19:23:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 405 transitions. [2024-09-11 19:23:06,776 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 405 transitions. Word has length 80 [2024-09-11 19:23:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:06,777 INFO L474 AbstractCegarLoop]: Abstraction has 264 states and 405 transitions. [2024-09-11 19:23:06,777 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:23:06,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 405 transitions. [2024-09-11 19:23:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-09-11 19:23:06,780 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:06,780 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-09-11 19:23:06,780 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 19:23:06,781 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:06,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1289698158, now seen corresponding path program 2 times [2024-09-11 19:23:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166628316] [2024-09-11 19:23:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:06,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:23:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 19:23:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 19:23:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 19:23:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-11 19:23:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-11 19:23:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-11 19:23:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-11 19:23:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-09-11 19:23:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:06,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166628316] [2024-09-11 19:23:06,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166628316] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:06,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:06,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:23:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334126684] [2024-09-11 19:23:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:06,931 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:23:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:23:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:06,932 INFO L87 Difference]: Start difference. First operand 264 states and 405 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:23:07,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:07,008 INFO L93 Difference]: Finished difference Result 264 states and 405 transitions. [2024-09-11 19:23:07,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 80 [2024-09-11 19:23:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:07,010 INFO L225 Difference]: With dead ends: 264 [2024-09-11 19:23:07,010 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:23:07,011 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:07,012 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:07,012 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 77 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:23:07,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:23:07,013 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-11 19:23:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:23:07,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-09-11 19:23:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:07,014 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:23:07,014 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:23:07,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:23:07,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:23:07,017 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:23:07,017 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 19:23:07,020 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-09-11 19:23:07,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:23:08,052 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:23:08,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:23:08 BoogieIcfgContainer [2024-09-11 19:23:08,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:23:08,068 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:23:08,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:23:08,068 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:23:08,069 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:04" (3/4) ... [2024-09-11 19:23:08,071 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:23:08,074 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 19:23:08,077 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-11 19:23:08,077 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 19:23:08,077 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:23:08,077 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:23:08,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:23:08,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:23:08,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:23:08,167 INFO L158 Benchmark]: Toolchain (without parser) took 4634.26ms. Allocated memory was 172.0MB in the beginning and 226.5MB in the end (delta: 54.5MB). Free memory was 114.8MB in the beginning and 73.8MB in the end (delta: 40.9MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. [2024-09-11 19:23:08,167 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 172.0MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:23:08,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.13ms. Allocated memory is still 172.0MB. Free memory was 114.8MB in the beginning and 103.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:23:08,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.65ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 102.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:23:08,168 INFO L158 Benchmark]: Boogie Preprocessor took 30.60ms. Allocated memory is still 172.0MB. Free memory was 101.7MB in the beginning and 100.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:23:08,168 INFO L158 Benchmark]: RCFGBuilder took 265.88ms. Allocated memory is still 172.0MB. Free memory was 100.1MB in the beginning and 89.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:23:08,169 INFO L158 Benchmark]: TraceAbstraction took 3974.04ms. Allocated memory was 172.0MB in the beginning and 226.5MB in the end (delta: 54.5MB). Free memory was 88.4MB in the beginning and 78.0MB in the end (delta: 10.3MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2024-09-11 19:23:08,169 INFO L158 Benchmark]: Witness Printer took 98.80ms. Allocated memory is still 226.5MB. Free memory was 78.0MB in the beginning and 73.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 19:23:08,170 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.21ms. Allocated memory is still 172.0MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.13ms. Allocated memory is still 172.0MB. Free memory was 114.8MB in the beginning and 103.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.65ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 102.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.60ms. Allocated memory is still 172.0MB. Free memory was 101.7MB in the beginning and 100.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 265.88ms. Allocated memory is still 172.0MB. Free memory was 100.1MB in the beginning and 89.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3974.04ms. Allocated memory was 172.0MB in the beginning and 226.5MB in the end (delta: 54.5MB). Free memory was 88.4MB in the beginning and 78.0MB in the end (delta: 10.3MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. * Witness Printer took 98.80ms. Allocated memory is still 226.5MB. Free memory was 78.0MB in the beginning and 73.8MB 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: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 603 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 409 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 194 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 162 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 750/792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:23:08,199 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