./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/mine2017-ex4.6.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/mine2017-ex4.6.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 1fa7c9a8ed8874a508931184bf09b1ee30162cb6ccbf87de6b2ebe54845cfa76 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 12:04:05,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:04:05,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:04:05,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:04:05,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:04:05,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:04:05,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:04:05,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:04:05,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:04:05,345 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:04:05,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:04:05,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:04:05,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:04:05,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:04:05,349 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:04:05,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:04:05,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:04:05,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:04:05,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:04:05,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:04:05,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:04:05,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:04:05,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:04:05,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:04:05,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:04:05,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:04:05,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:04:05,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:04:05,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:04:05,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:04:05,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:04:05,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:04:05,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:04:05,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:04:05,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:04:05,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:04:05,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:04:05,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:04:05,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:04:05,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:04:05,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:04:05,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:04:05,363 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 -> 1fa7c9a8ed8874a508931184bf09b1ee30162cb6ccbf87de6b2ebe54845cfa76 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 12:04:05,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:04:05,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:04:05,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:04:05,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:04:05,589 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:04:05,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/mine2017-ex4.6.i [2024-09-20 12:04:07,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:04:07,301 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:04:07,303 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/mine2017-ex4.6.i [2024-09-20 12:04:07,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7240fa3c5/580d4edfd7f44ef9bc86179a15679f04/FLAG94b8c8b6d [2024-09-20 12:04:07,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7240fa3c5/580d4edfd7f44ef9bc86179a15679f04 [2024-09-20 12:04:07,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:04:07,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:04:07,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:04:07,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:04:07,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:04:07,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:07,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8d2505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07, skipping insertion in model container [2024-09-20 12:04:07,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:07,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:04:07,896 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/mine2017-ex4.6.i[812,825] [2024-09-20 12:04:07,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:04:07,924 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:04:07,936 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/mine2017-ex4.6.i[812,825] [2024-09-20 12:04:07,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:04:07,968 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:04:07,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07 WrapperNode [2024-09-20 12:04:07,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:04:07,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:04:07,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:04:07,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:04:07,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:07,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:07,987 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:04:07,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:04:07,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:04:07,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:04:07,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:04:07,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:07,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:07,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:08,007 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-20 12:04:08,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:08,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:08,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:08,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:08,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:08,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:08,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:04:08,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:04:08,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:04:08,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:04:08,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (1/1) ... [2024-09-20 12:04:08,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:04:08,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:04:08,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 12:04:08,049 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 12:04:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:04:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:04:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:04:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:04:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:04:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:04:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:04:08,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:04:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:04:08,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:04:08,141 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:04:08,143 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:04:08,261 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-20 12:04:08,261 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:04:08,282 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:04:08,282 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 12:04:08,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:04:08 BoogieIcfgContainer [2024-09-20 12:04:08,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:04:08,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:04:08,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:04:08,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:04:08,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:04:07" (1/3) ... [2024-09-20 12:04:08,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f443ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:04:08, skipping insertion in model container [2024-09-20 12:04:08,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:04:07" (2/3) ... [2024-09-20 12:04:08,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f443ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:04:08, skipping insertion in model container [2024-09-20 12:04:08,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:04:08" (3/3) ... [2024-09-20 12:04:08,291 INFO L112 eAbstractionObserver]: Analyzing ICFG mine2017-ex4.6.i [2024-09-20 12:04:08,308 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:04:08,309 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:04:08,352 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:04:08,358 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;@595b36c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:04:08,358 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:04:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 12:04:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-20 12:04:08,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:04:08,367 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:04:08,368 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:04:08,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1435463689, now seen corresponding path program 1 times [2024-09-20 12:04:08,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:04:08,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062547987] [2024-09-20 12:04:08,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:04:08,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:04:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:08,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:04:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:04:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:04:08,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062547987] [2024-09-20 12:04:08,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062547987] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:04:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:04:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 12:04:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178961577] [2024-09-20 12:04:08,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:04:08,483 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 12:04:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:04:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 12:04:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:04:08,500 INFO L87 Difference]: Start difference. First operand has 20 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:04:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:04:08,517 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-09-20 12:04:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 12:04:08,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-20 12:04:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:04:08,524 INFO L225 Difference]: With dead ends: 35 [2024-09-20 12:04:08,524 INFO L226 Difference]: Without dead ends: 16 [2024-09-20 12:04:08,526 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:04:08,529 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:04:08,530 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:04:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-20 12:04:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-20 12:04:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 12:04:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-20 12:04:08,556 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2024-09-20 12:04:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:04:08,556 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-20 12:04:08,557 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:04:08,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-20 12:04:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-20 12:04:08,558 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:04:08,558 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:04:08,559 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:04:08,559 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:04:08,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1428999042, now seen corresponding path program 1 times [2024-09-20 12:04:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:04:08,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518242000] [2024-09-20 12:04:08,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:04:08,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:04:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:08,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:04:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:04:08,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:04:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518242000] [2024-09-20 12:04:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518242000] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:04:08,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:04:08,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:04:08,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776771056] [2024-09-20 12:04:08,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:04:08,606 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:04:08,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:04:08,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:04:08,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:04:08,607 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:04:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:04:08,619 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-09-20 12:04:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:04:08,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-20 12:04:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:04:08,620 INFO L225 Difference]: With dead ends: 26 [2024-09-20 12:04:08,621 INFO L226 Difference]: Without dead ends: 19 [2024-09-20 12:04:08,621 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:04:08,622 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:04:08,622 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:04:08,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-20 12:04:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-09-20 12:04:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 12:04:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-09-20 12:04:08,628 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2024-09-20 12:04:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:04:08,628 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-09-20 12:04:08,628 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:04:08,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-09-20 12:04:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-20 12:04:08,629 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:04:08,629 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:04:08,629 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:04:08,630 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:04:08,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1430726920, now seen corresponding path program 1 times [2024-09-20 12:04:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:04:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902753642] [2024-09-20 12:04:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:04:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:04:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:08,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:04:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:04:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:04:08,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902753642] [2024-09-20 12:04:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902753642] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:04:08,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:04:08,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 12:04:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200902281] [2024-09-20 12:04:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:04:08,794 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:04:08,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:04:08,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:04:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:04:08,795 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:04:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:04:08,832 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-09-20 12:04:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:04:08,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-20 12:04:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:04:08,833 INFO L225 Difference]: With dead ends: 23 [2024-09-20 12:04:08,833 INFO L226 Difference]: Without dead ends: 21 [2024-09-20 12:04:08,834 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:04:08,835 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:04:08,835 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:04:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-20 12:04:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-20 12:04:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 12:04:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-20 12:04:08,840 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 10 [2024-09-20 12:04:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:04:08,840 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-20 12:04:08,840 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 12:04:08,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-20 12:04:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 12:04:08,841 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:04:08,841 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:04:08,841 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:04:08,842 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:04:08,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -539910847, now seen corresponding path program 1 times [2024-09-20 12:04:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:04:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323680933] [2024-09-20 12:04:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:04:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:04:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:08,915 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:04:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:08,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:04:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:04:08,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:04:08,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323680933] [2024-09-20 12:04:08,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323680933] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:04:08,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:04:08,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:04:08,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31418223] [2024-09-20 12:04:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:04:08,927 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:04:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:04:08,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:04:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:04:08,928 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-20 12:04:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:04:08,971 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-09-20 12:04:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:04:08,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-09-20 12:04:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:04:08,977 INFO L225 Difference]: With dead ends: 38 [2024-09-20 12:04:08,977 INFO L226 Difference]: Without dead ends: 31 [2024-09-20 12:04:08,978 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:04:08,979 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:04:08,979 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:04:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-20 12:04:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-09-20 12:04:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 12:04:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-20 12:04:08,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 16 [2024-09-20 12:04:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:04:08,987 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-20 12:04:08,987 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-20 12:04:08,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-20 12:04:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 12:04:08,988 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:04:08,988 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:04:08,988 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 12:04:08,988 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:04:08,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2007510129, now seen corresponding path program 1 times [2024-09-20 12:04:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:04:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680874508] [2024-09-20 12:04:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:04:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:04:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:04:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:04:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 12:04:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-20 12:04:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 12:04:09,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:04:09,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680874508] [2024-09-20 12:04:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680874508] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:04:09,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203500871] [2024-09-20 12:04:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:04:09,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:04:09,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:04:09,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:04:09,112 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 12:04:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 12:04:09,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:04:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 12:04:09,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:04:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 12:04:09,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203500871] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:04:09,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:04:09,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-09-20 12:04:09,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344597634] [2024-09-20 12:04:09,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:04:09,431 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 12:04:09,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:04:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 12:04:09,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-20 12:04:09,436 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 7 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-20 12:04:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:04:09,536 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-09-20 12:04:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 12:04:09,537 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 7 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 28 [2024-09-20 12:04:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:04:09,538 INFO L225 Difference]: With dead ends: 52 [2024-09-20 12:04:09,538 INFO L226 Difference]: Without dead ends: 43 [2024-09-20 12:04:09,539 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-09-20 12:04:09,540 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:04:09,540 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:04:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-20 12:04:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-20 12:04:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-20 12:04:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-09-20 12:04:09,550 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 28 [2024-09-20 12:04:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:04:09,551 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-09-20 12:04:09,551 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 7 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-20 12:04:09,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-09-20 12:04:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-20 12:04:09,554 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:04:09,554 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:04:09,573 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 12:04:09,754 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-20 12:04:09,756 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:04:09,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1324907378, now seen corresponding path program 1 times [2024-09-20 12:04:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:04:09,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428448073] [2024-09-20 12:04:09,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:04:09,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:04:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:04:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:04:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 12:04:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-20 12:04:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-20 12:04:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-20 12:04:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 12:04:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-20 12:04:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-20 12:04:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 12:04:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-20 12:04:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:04:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-09-20 12:04:09,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:04:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428448073] [2024-09-20 12:04:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428448073] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:04:09,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:04:09,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 12:04:09,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349706245] [2024-09-20 12:04:09,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:04:09,890 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:04:09,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:04:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:04:09,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:04:09,891 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 12:04:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:04:09,913 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-09-20 12:04:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:04:09,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2024-09-20 12:04:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:04:09,915 INFO L225 Difference]: With dead ends: 43 [2024-09-20 12:04:09,915 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 12:04:09,915 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:04:09,916 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:04:09,917 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:04:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 12:04:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 12:04:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 12:04:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 12:04:09,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2024-09-20 12:04:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:04:09,918 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 12:04:09,918 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 12:04:09,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:04:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 12:04:09,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 12:04:09,922 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 12:04:09,922 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 12:04:09,926 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-20 12:04:09,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 12:04:10,106 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 12:04:10,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:04:10 BoogieIcfgContainer [2024-09-20 12:04:10,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 12:04:10,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 12:04:10,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 12:04:10,127 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 12:04:10,128 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:04:08" (3/4) ... [2024-09-20 12:04:10,129 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 12:04:10,180 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 12:04:10,181 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 12:04:10,181 INFO L158 Benchmark]: Toolchain (without parser) took 2471.88ms. Allocated memory was 172.0MB in the beginning and 237.0MB in the end (delta: 65.0MB). Free memory was 99.7MB in the beginning and 101.2MB in the end (delta: -1.4MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2024-09-20 12:04:10,182 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory was 123.0MB in the beginning and 122.7MB in the end (delta: 244.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:04:10,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.66ms. Allocated memory was 172.0MB in the beginning and 237.0MB in the end (delta: 65.0MB). Free memory was 99.5MB in the beginning and 208.8MB in the end (delta: -109.2MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-09-20 12:04:10,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.31ms. Allocated memory is still 237.0MB. Free memory was 208.8MB in the beginning and 207.8MB in the end (delta: 984.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:04:10,185 INFO L158 Benchmark]: Boogie Preprocessor took 26.95ms. Allocated memory is still 237.0MB. Free memory was 207.8MB in the beginning and 206.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:04:10,185 INFO L158 Benchmark]: RCFGBuilder took 267.03ms. Allocated memory is still 237.0MB. Free memory was 205.7MB in the beginning and 194.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 12:04:10,185 INFO L158 Benchmark]: TraceAbstraction took 1841.39ms. Allocated memory is still 237.0MB. Free memory was 193.1MB in the beginning and 103.3MB in the end (delta: 89.9MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2024-09-20 12:04:10,185 INFO L158 Benchmark]: Witness Printer took 54.17ms. Allocated memory is still 237.0MB. Free memory was 103.3MB in the beginning and 101.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:04:10,190 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.16ms. Allocated memory is still 172.0MB. Free memory was 123.0MB in the beginning and 122.7MB in the end (delta: 244.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.66ms. Allocated memory was 172.0MB in the beginning and 237.0MB in the end (delta: 65.0MB). Free memory was 99.5MB in the beginning and 208.8MB in the end (delta: -109.2MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.31ms. Allocated memory is still 237.0MB. Free memory was 208.8MB in the beginning and 207.8MB in the end (delta: 984.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.95ms. Allocated memory is still 237.0MB. Free memory was 207.8MB in the beginning and 206.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 267.03ms. Allocated memory is still 237.0MB. Free memory was 205.7MB in the beginning and 194.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1841.39ms. Allocated memory is still 237.0MB. Free memory was 193.1MB in the beginning and 103.3MB in the end (delta: 89.9MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. * Witness Printer took 54.17ms. Allocated memory is still 237.0MB. Free memory was 103.3MB in the beginning and 101.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 90 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 290 SizeOfPredicates, 1 NumberOfNonLiveVariables, 68 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 301/313 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: 16]: Loop Invariant Derived loop invariant: ((0 <= x) && (x <= 40)) - 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-20 12:04:10,224 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE