./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007b.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 27b49876 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/gj2007b.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 a5dbdf40c5c8abdf745ea2973f48a7f1bd1d56b53cd410b7a2d364d83fc651a9 --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-27b4987-m [2024-09-21 11:25:09,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 11:25:09,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 11:25:09,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 11:25:09,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 11:25:09,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 11:25:09,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 11:25:09,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 11:25:09,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 11:25:09,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 11:25:09,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 11:25:09,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 11:25:09,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 11:25:09,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 11:25:09,419 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 11:25:09,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 11:25:09,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 11:25:09,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 11:25:09,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 11:25:09,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 11:25:09,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 11:25:09,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 11:25:09,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 11:25:09,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 11:25:09,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 11:25:09,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 11:25:09,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 11:25:09,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 11:25:09,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 11:25:09,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 11:25:09,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 11:25:09,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 11:25:09,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:25:09,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 11:25:09,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 11:25:09,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 11:25:09,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 11:25:09,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 11:25:09,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 11:25:09,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 11:25:09,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 11:25:09,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 11:25:09,427 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 -> a5dbdf40c5c8abdf745ea2973f48a7f1bd1d56b53cd410b7a2d364d83fc651a9 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-21 11:25:09,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 11:25:09,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 11:25:09,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 11:25:09,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 11:25:09,700 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 11:25:09,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gj2007b.i [2024-09-21 11:25:11,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 11:25:11,277 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 11:25:11,278 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007b.i [2024-09-21 11:25:11,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6859279f0/6cad3d711c424df496ad56a20a2b36f1/FLAGf9ec6a0f4 [2024-09-21 11:25:11,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6859279f0/6cad3d711c424df496ad56a20a2b36f1 [2024-09-21 11:25:11,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 11:25:11,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 11:25:11,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 11:25:11,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 11:25:11,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 11:25:11,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b24464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11, skipping insertion in model container [2024-09-21 11:25:11,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 11:25:11,454 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/gj2007b.i[895,908] [2024-09-21 11:25:11,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:25:11,472 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 11:25:11,486 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/gj2007b.i[895,908] [2024-09-21 11:25:11,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:25:11,507 INFO L204 MainTranslator]: Completed translation [2024-09-21 11:25:11,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11 WrapperNode [2024-09-21 11:25:11,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 11:25:11,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 11:25:11,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 11:25:11,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 11:25:11,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,536 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 11:25:11,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 11:25:11,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 11:25:11,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 11:25:11,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 11:25:11,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,568 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-21 11:25:11,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 11:25:11,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 11:25:11,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 11:25:11,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 11:25:11,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (1/1) ... [2024-09-21 11:25:11,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:25:11,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:11,616 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-21 11:25:11,619 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-21 11:25:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 11:25:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 11:25:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 11:25:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 11:25:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 11:25:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 11:25:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 11:25:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 11:25:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-21 11:25:11,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-21 11:25:11,720 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 11:25:11,722 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 11:25:11,853 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-21 11:25:11,854 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 11:25:11,871 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 11:25:11,871 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-21 11:25:11,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:25:11 BoogieIcfgContainer [2024-09-21 11:25:11,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 11:25:11,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 11:25:11,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 11:25:11,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 11:25:11,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:25:11" (1/3) ... [2024-09-21 11:25:11,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b952b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:25:11, skipping insertion in model container [2024-09-21 11:25:11,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:11" (2/3) ... [2024-09-21 11:25:11,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b952b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:25:11, skipping insertion in model container [2024-09-21 11:25:11,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:25:11" (3/3) ... [2024-09-21 11:25:11,880 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2024-09-21 11:25:11,893 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 11:25:11,894 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 11:25:11,936 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 11:25:11,945 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;@4f7c2ad0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 11:25:11,945 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 11:25:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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-21 11:25:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-21 11:25:11,962 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:11,963 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:11,965 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:11,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -404102897, now seen corresponding path program 1 times [2024-09-21 11:25:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:11,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973333269] [2024-09-21 11:25:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:11,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:12,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:12,124 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-21 11:25:12,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:12,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973333269] [2024-09-21 11:25:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973333269] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:12,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:25:12,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-21 11:25:12,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424347052] [2024-09-21 11:25:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:12,129 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-21 11:25:12,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:12,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-21 11:25:12,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-21 11:25:12,149 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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) 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-21 11:25:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:12,168 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-09-21 11:25:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-21 11:25:12,170 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-21 11:25:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:12,175 INFO L225 Difference]: With dead ends: 32 [2024-09-21 11:25:12,175 INFO L226 Difference]: Without dead ends: 16 [2024-09-21 11:25:12,177 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-21 11:25:12,180 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-21 11:25:12,181 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-21 11:25:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-21 11:25:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-21 11:25:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:25:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-21 11:25:12,207 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2024-09-21 11:25:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:12,207 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-21 11:25:12,207 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-21 11:25:12,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-21 11:25:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-21 11:25:12,208 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:12,208 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:12,209 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 11:25:12,209 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:12,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash -414261628, now seen corresponding path program 1 times [2024-09-21 11:25:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354595713] [2024-09-21 11:25:12,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:12,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:12,480 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-21 11:25:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354595713] [2024-09-21 11:25:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354595713] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:12,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:25:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-21 11:25:12,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699350013] [2024-09-21 11:25:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:12,482 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-21 11:25:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-21 11:25:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-21 11:25:12,484 INFO L87 Difference]: Start difference. First operand 16 states and 18 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-21 11:25:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:12,553 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-21 11:25:12,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-21 11:25:12,555 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-21 11:25:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:12,555 INFO L225 Difference]: With dead ends: 27 [2024-09-21 11:25:12,556 INFO L226 Difference]: Without dead ends: 25 [2024-09-21 11:25:12,556 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-21 11:25:12,557 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:12,557 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 48 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-21 11:25:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-09-21 11:25:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-21 11:25:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-21 11:25:12,571 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 10 [2024-09-21 11:25:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:12,571 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-21 11:25:12,572 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-21 11:25:12,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-21 11:25:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-21 11:25:12,574 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:12,574 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:12,574 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 11:25:12,575 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:12,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1076437400, now seen corresponding path program 1 times [2024-09-21 11:25:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:12,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194986537] [2024-09-21 11:25:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:12,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:12,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:12,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194986537] [2024-09-21 11:25:12,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194986537] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542665042] [2024-09-21 11:25:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:12,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:12,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:12,739 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-21 11:25:12,741 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-21 11:25:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:12,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-21 11:25:12,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:12,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542665042] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:12,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-09-21 11:25:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28246739] [2024-09-21 11:25:12,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:12,933 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-21 11:25:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:12,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-21 11:25:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-21 11:25:12,934 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:13,017 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-09-21 11:25:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-21 11:25:13,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-21 11:25:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:13,019 INFO L225 Difference]: With dead ends: 34 [2024-09-21 11:25:13,019 INFO L226 Difference]: Without dead ends: 30 [2024-09-21 11:25:13,020 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-21 11:25:13,021 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:13,021 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 62 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 11:25:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-21 11:25:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2024-09-21 11:25:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:25:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-09-21 11:25:13,027 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2024-09-21 11:25:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:13,027 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-09-21 11:25:13,028 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:13,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-09-21 11:25:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-21 11:25:13,029 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:13,029 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:13,046 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-21 11:25:13,229 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:13,230 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:13,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1109553914, now seen corresponding path program 1 times [2024-09-21 11:25:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778979143] [2024-09-21 11:25:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:13,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:13,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 11:25:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:13,329 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-21 11:25:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:13,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778979143] [2024-09-21 11:25:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778979143] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:13,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:25:13,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 11:25:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363364089] [2024-09-21 11:25:13,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:13,330 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 11:25:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 11:25:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-21 11:25:13,332 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:25:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:13,376 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-09-21 11:25:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 11:25:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-09-21 11:25:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:13,378 INFO L225 Difference]: With dead ends: 31 [2024-09-21 11:25:13,378 INFO L226 Difference]: Without dead ends: 21 [2024-09-21 11:25:13,378 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:25:13,379 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:13,379 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-21 11:25:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-09-21 11:25:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:25:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-09-21 11:25:13,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2024-09-21 11:25:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:13,385 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-09-21 11:25:13,386 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:25:13,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-09-21 11:25:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-21 11:25:13,387 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:13,387 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:13,387 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-21 11:25:13,387 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:13,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1322434966, now seen corresponding path program 1 times [2024-09-21 11:25:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310792949] [2024-09-21 11:25:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:13,495 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:13,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-21 11:25:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310792949] [2024-09-21 11:25:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310792949] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247824754] [2024-09-21 11:25:13,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:13,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:13,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:13,511 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-21 11:25:13,513 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-21 11:25:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:13,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-21 11:25:13,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:13,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:13,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247824754] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:13,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-21 11:25:13,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 9] total 14 [2024-09-21 11:25:13,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348832790] [2024-09-21 11:25:13,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:13,781 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 11:25:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:13,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 11:25:13,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-09-21 11:25:13,782 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:25:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:13,839 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-09-21 11:25:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 11:25:13,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-21 11:25:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:13,840 INFO L225 Difference]: With dead ends: 19 [2024-09-21 11:25:13,840 INFO L226 Difference]: Without dead ends: 0 [2024-09-21 11:25:13,841 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-09-21 11:25:13,845 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:13,845 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-21 11:25:13,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-21 11:25:13,846 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-21 11:25:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-21 11:25:13,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2024-09-21 11:25:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:13,846 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-21 11:25:13,846 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:25:13,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-21 11:25:13,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-21 11:25:13,850 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-21 11:25:13,867 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-21 11:25:14,054 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:14,058 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-21 11:25:14,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-21 11:25:14,345 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-21 11:25:14,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 11:25:14 BoogieIcfgContainer [2024-09-21 11:25:14,357 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-21 11:25:14,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-21 11:25:14,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-21 11:25:14,358 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-21 11:25:14,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:25:11" (3/4) ... [2024-09-21 11:25:14,361 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-21 11:25:14,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-21 11:25:14,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-21 11:25:14,413 INFO L158 Benchmark]: Toolchain (without parser) took 3111.36ms. Allocated memory is still 199.2MB. Free memory was 129.9MB in the beginning and 134.4MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:25:14,415 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:25:14,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.63ms. Allocated memory is still 199.2MB. Free memory was 129.5MB in the beginning and 118.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-21 11:25:14,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.49ms. Allocated memory is still 199.2MB. Free memory was 118.2MB in the beginning and 117.4MB in the end (delta: 834.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:25:14,416 INFO L158 Benchmark]: Boogie Preprocessor took 42.89ms. Allocated memory is still 199.2MB. Free memory was 117.4MB in the beginning and 115.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:25:14,416 INFO L158 Benchmark]: RCFGBuilder took 289.71ms. Allocated memory is still 199.2MB. Free memory was 115.5MB in the beginning and 168.4MB in the end (delta: -52.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-09-21 11:25:14,416 INFO L158 Benchmark]: TraceAbstraction took 2483.67ms. Allocated memory is still 199.2MB. Free memory was 167.9MB in the beginning and 137.6MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-09-21 11:25:14,416 INFO L158 Benchmark]: Witness Printer took 55.35ms. Allocated memory is still 199.2MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:25:14,418 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 115.3MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.63ms. Allocated memory is still 199.2MB. Free memory was 129.5MB in the beginning and 118.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.49ms. Allocated memory is still 199.2MB. Free memory was 118.2MB in the beginning and 117.4MB in the end (delta: 834.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.89ms. Allocated memory is still 199.2MB. Free memory was 117.4MB in the beginning and 115.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 289.71ms. Allocated memory is still 199.2MB. Free memory was 115.5MB in the beginning and 168.4MB in the end (delta: -52.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2483.67ms. Allocated memory is still 199.2MB. Free memory was 167.9MB in the beginning and 137.6MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Witness Printer took 55.35ms. Allocated memory is still 199.2MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 64 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=2, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 SizeOfPredicates, 5 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 8/14 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: 28]: Loop Invariant Derived loop invariant: ((((m < n) || (n < 1)) && (0 <= m)) && (0 <= x)) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-21 11:25:14,448 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