./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound1.c --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 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound1.c -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 008f13fd1550f54b25db8c20ee30759d3819e45d65744da9f4f77718b68e7e66 --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-6908dde-m [2024-09-24 23:32:56,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:32:57,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:32:57,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:32:57,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:32:57,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:32:57,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:32:57,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:32:57,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:32:57,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:32:57,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:32:57,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:32:57,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:32:57,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:32:57,050 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:32:57,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:32:57,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:32:57,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:32:57,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:32:57,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:32:57,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:32:57,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:32:57,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:32:57,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:32:57,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:32:57,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:32:57,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:32:57,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:32:57,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:32:57,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:32:57,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:32:57,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:32:57,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:32:57,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:32:57,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:32:57,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:32:57,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:32:57,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:32:57,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:32:57,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:32:57,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:32:57,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:32:57,056 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 -> 008f13fd1550f54b25db8c20ee30759d3819e45d65744da9f4f77718b68e7e66 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-24 23:32:57,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:32:57,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:32:57,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:32:57,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:32:57,269 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:32:57,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound1.c [2024-09-24 23:32:58,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:32:58,764 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:32:58,764 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound1.c [2024-09-24 23:32:58,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1a38e3605/4adfa72a9164490aa15ce15e6f4d0ab8/FLAG2823590ac [2024-09-24 23:32:59,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1a38e3605/4adfa72a9164490aa15ce15e6f4d0ab8 [2024-09-24 23:32:59,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:32:59,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:32:59,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:32:59,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:32:59,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:32:59,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10440589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59, skipping insertion in model container [2024-09-24 23:32:59,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:32:59,387 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/nla-digbench-scaling/egcd-ll_valuebound1.c[489,502] [2024-09-24 23:32:59,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:32:59,414 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:32:59,423 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/nla-digbench-scaling/egcd-ll_valuebound1.c[489,502] [2024-09-24 23:32:59,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:32:59,443 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:32:59,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59 WrapperNode [2024-09-24 23:32:59,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:32:59,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:32:59,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:32:59,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:32:59,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,463 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:32:59,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:32:59,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:32:59,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:32:59,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:32:59,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,499 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-24 23:32:59,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:32:59,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:32:59,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:32:59,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:32:59,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (1/1) ... [2024-09-24 23:32:59,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:32:59,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:32:59,544 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-24 23:32:59,547 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-24 23:32:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:32:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:32:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:32:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:32:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:32:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:32:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:32:59,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:32:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:32:59,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:32:59,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:32:59,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:32:59,641 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:32:59,643 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:32:59,767 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-24 23:32:59,768 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:32:59,784 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:32:59,784 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-24 23:32:59,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:32:59 BoogieIcfgContainer [2024-09-24 23:32:59,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:32:59,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:32:59,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:32:59,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:32:59,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:32:59" (1/3) ... [2024-09-24 23:32:59,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f0b117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:32:59, skipping insertion in model container [2024-09-24 23:32:59,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:32:59" (2/3) ... [2024-09-24 23:32:59,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f0b117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:32:59, skipping insertion in model container [2024-09-24 23:32:59,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:32:59" (3/3) ... [2024-09-24 23:32:59,791 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound1.c [2024-09-24 23:32:59,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:32:59,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:32:59,847 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:32:59,853 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;@516d002e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:32:59,853 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:32:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-24 23:32:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-24 23:32:59,863 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:32:59,863 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:32:59,864 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:32:59,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:32:59,868 INFO L85 PathProgramCache]: Analyzing trace with hash 963610160, now seen corresponding path program 1 times [2024-09-24 23:32:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:32:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392405552] [2024-09-24 23:32:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:32:59,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:32:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:00,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:33:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:00,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:33:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:00,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:33:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:00,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:33:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:00,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:33:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:33:00,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:33:00,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392405552] [2024-09-24 23:33:00,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392405552] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:33:00,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:33:00,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 23:33:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618879199] [2024-09-24 23:33:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:33:00,066 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 23:33:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:33:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 23:33:00,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:33:00,093 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:33:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:33:00,138 INFO L93 Difference]: Finished difference Result 64 states and 102 transitions. [2024-09-24 23:33:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 23:33:00,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-24 23:33:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:33:00,155 INFO L225 Difference]: With dead ends: 64 [2024-09-24 23:33:00,155 INFO L226 Difference]: Without dead ends: 31 [2024-09-24 23:33:00,163 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-24 23:33:00,167 INFO L434 NwaCegarLoop]: 43 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, 43 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-24 23:33:00,168 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:33:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-24 23:33:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-24 23:33:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-24 23:33:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-24 23:33:00,234 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 32 [2024-09-24 23:33:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:33:00,234 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-24 23:33:00,234 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:33:00,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-24 23:33:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-24 23:33:00,236 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:33:00,236 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:33:00,236 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:33:00,237 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:33:00,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash -914175556, now seen corresponding path program 1 times [2024-09-24 23:33:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:33:00,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266367746] [2024-09-24 23:33:00,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:00,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:33:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:33:00,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191017749] [2024-09-24 23:33:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:00,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:00,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:33:00,280 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-24 23:33:00,283 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-24 23:33:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:00,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-24 23:33:00,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:33:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:33:00,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:33:00,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:33:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266367746] [2024-09-24 23:33:00,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:33:00,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191017749] [2024-09-24 23:33:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191017749] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:33:00,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:33:00,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:33:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419324104] [2024-09-24 23:33:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:33:00,430 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:33:00,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:33:00,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:33:00,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:33:00,432 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-24 23:33:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:33:00,491 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2024-09-24 23:33:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:33:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2024-09-24 23:33:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:33:00,493 INFO L225 Difference]: With dead ends: 47 [2024-09-24 23:33:00,493 INFO L226 Difference]: Without dead ends: 45 [2024-09-24 23:33:00,494 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-24 23:33:00,494 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:33:00,496 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:33:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-24 23:33:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-09-24 23:33:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-24 23:33:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2024-09-24 23:33:00,507 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 32 [2024-09-24 23:33:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:33:00,507 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2024-09-24 23:33:00,507 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-24 23:33:00,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2024-09-24 23:33:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-24 23:33:00,512 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:33:00,513 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:33:00,525 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-24 23:33:00,713 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:00,714 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:33:00,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash 737940505, now seen corresponding path program 1 times [2024-09-24 23:33:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:33:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284523981] [2024-09-24 23:33:00,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:33:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:33:00,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937077663] [2024-09-24 23:33:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:00,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:00,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:33:00,753 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-24 23:33:00,757 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-24 23:33:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:00,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-24 23:33:00,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:33:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:33:00,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:33:00,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:33:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284523981] [2024-09-24 23:33:00,844 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:33:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937077663] [2024-09-24 23:33:00,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937077663] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:33:00,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:33:00,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:33:00,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319920661] [2024-09-24 23:33:00,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:33:00,845 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:33:00,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:33:00,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:33:00,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:33:00,846 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:33:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:33:00,895 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-24 23:33:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:33:00,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-24 23:33:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:33:00,896 INFO L225 Difference]: With dead ends: 51 [2024-09-24 23:33:00,896 INFO L226 Difference]: Without dead ends: 49 [2024-09-24 23:33:00,897 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-24 23:33:00,897 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:33:00,898 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:33:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-24 23:33:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-09-24 23:33:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-24 23:33:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-09-24 23:33:00,906 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 37 [2024-09-24 23:33:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:33:00,907 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-09-24 23:33:00,907 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:33:00,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-09-24 23:33:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-24 23:33:00,908 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:33:00,908 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:33:00,920 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 23:33:01,112 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:01,113 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:33:01,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1385223068, now seen corresponding path program 1 times [2024-09-24 23:33:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:33:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235454793] [2024-09-24 23:33:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:33:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:33:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132250926] [2024-09-24 23:33:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:01,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:01,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:33:01,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:33:01,147 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-24 23:33:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-24 23:33:01,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:33:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-24 23:33:01,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:33:01,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:33:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235454793] [2024-09-24 23:33:01,262 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:33:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132250926] [2024-09-24 23:33:01,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132250926] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:33:01,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:33:01,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:33:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709531630] [2024-09-24 23:33:01,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:33:01,263 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:33:01,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:33:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:33:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:33:01,265 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-24 23:33:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:33:01,324 INFO L93 Difference]: Finished difference Result 73 states and 104 transitions. [2024-09-24 23:33:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:33:01,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2024-09-24 23:33:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:33:01,328 INFO L225 Difference]: With dead ends: 73 [2024-09-24 23:33:01,328 INFO L226 Difference]: Without dead ends: 69 [2024-09-24 23:33:01,329 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-24 23:33:01,331 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:33:01,331 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 130 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:33:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-24 23:33:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-09-24 23:33:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-24 23:33:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-09-24 23:33:01,353 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 42 [2024-09-24 23:33:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:33:01,354 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-09-24 23:33:01,354 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-24 23:33:01,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-09-24 23:33:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-24 23:33:01,355 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:33:01,355 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:33:01,381 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-24 23:33:01,555 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:01,556 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:33:01,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1071635405, now seen corresponding path program 1 times [2024-09-24 23:33:01,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:33:01,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950953199] [2024-09-24 23:33:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:33:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,715 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:33:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:33:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:33:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:33:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:33:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:33:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,740 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:33:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-24 23:33:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-24 23:33:01,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:33:01,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950953199] [2024-09-24 23:33:01,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950953199] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:33:01,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:33:01,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:33:01,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403516097] [2024-09-24 23:33:01,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:33:01,750 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:33:01,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:33:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:33:01,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:33:01,751 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-24 23:33:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:33:01,797 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2024-09-24 23:33:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:33:01,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 48 [2024-09-24 23:33:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:33:01,800 INFO L225 Difference]: With dead ends: 75 [2024-09-24 23:33:01,801 INFO L226 Difference]: Without dead ends: 73 [2024-09-24 23:33:01,802 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-24 23:33:01,802 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:33:01,803 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 140 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:33:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-24 23:33:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-24 23:33:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-24 23:33:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2024-09-24 23:33:01,827 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 48 [2024-09-24 23:33:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:33:01,828 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2024-09-24 23:33:01,828 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-24 23:33:01,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2024-09-24 23:33:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-24 23:33:01,830 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:33:01,830 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:33:01,831 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-24 23:33:01,831 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:33:01,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1501538128, now seen corresponding path program 1 times [2024-09-24 23:33:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:33:01,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732577336] [2024-09-24 23:33:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:33:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:33:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,019 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:33:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:33:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:33:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:33:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:33:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:33:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-24 23:33:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:33:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:33:02,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732577336] [2024-09-24 23:33:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732577336] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:33:02,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022044486] [2024-09-24 23:33:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:02,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:02,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:33:02,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:33:02,079 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-24 23:33:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 23:33:02,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:33:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-09-24 23:33:02,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:33:02,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022044486] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:33:02,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:33:02,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-09-24 23:33:02,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97096811] [2024-09-24 23:33:02,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:33:02,208 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:33:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:33:02,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:33:02,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:33:02,208 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-24 23:33:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:33:02,244 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2024-09-24 23:33:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:33:02,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2024-09-24 23:33:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:33:02,246 INFO L225 Difference]: With dead ends: 83 [2024-09-24 23:33:02,246 INFO L226 Difference]: Without dead ends: 80 [2024-09-24 23:33:02,246 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-24 23:33:02,247 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:33:02,247 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 132 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:33:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-24 23:33:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-09-24 23:33:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-24 23:33:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-09-24 23:33:02,259 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 50 [2024-09-24 23:33:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:33:02,260 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-09-24 23:33:02,260 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-24 23:33:02,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-09-24 23:33:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-24 23:33:02,261 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:33:02,261 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:33:02,273 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-24 23:33:02,465 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:02,467 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:33:02,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:02,467 INFO L85 PathProgramCache]: Analyzing trace with hash 789508930, now seen corresponding path program 1 times [2024-09-24 23:33:02,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:33:02,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445624980] [2024-09-24 23:33:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:02,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:33:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,702 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:33:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:33:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:33:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:33:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:33:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:33:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:33:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-24 23:33:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-24 23:33:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-09-24 23:33:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:33:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445624980] [2024-09-24 23:33:02,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445624980] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:33:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141854657] [2024-09-24 23:33:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:02,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:02,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:33:02,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:33:02,750 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-24 23:33:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:02,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 23:33:02,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:33:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-09-24 23:33:02,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:33:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141854657] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:33:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:33:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-09-24 23:33:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984987073] [2024-09-24 23:33:02,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:33:02,882 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:33:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:33:02,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:33:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-09-24 23:33:02,883 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-24 23:33:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:33:02,981 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2024-09-24 23:33:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:33:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 53 [2024-09-24 23:33:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:33:02,982 INFO L225 Difference]: With dead ends: 91 [2024-09-24 23:33:02,983 INFO L226 Difference]: Without dead ends: 87 [2024-09-24 23:33:02,984 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-09-24 23:33:02,984 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:33:02,984 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 157 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:33:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-24 23:33:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-09-24 23:33:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 50 states have internal predecessors, (55), 27 states have call successors, (27), 12 states have call predecessors, (27), 11 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-24 23:33:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2024-09-24 23:33:02,997 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 53 [2024-09-24 23:33:02,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:33:02,997 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2024-09-24 23:33:02,999 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-24 23:33:02,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2024-09-24 23:33:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-24 23:33:03,000 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:33:03,001 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:33:03,013 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-24 23:33:03,201 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-24 23:33:03,202 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:33:03,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:03,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1427018501, now seen corresponding path program 2 times [2024-09-24 23:33:03,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:33:03,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122223758] [2024-09-24 23:33:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:03,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:33:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:33:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:33:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,334 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:33:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:33:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:33:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:33:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:33:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-24 23:33:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-24 23:33:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-24 23:33:03,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:33:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122223758] [2024-09-24 23:33:03,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122223758] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:33:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607071109] [2024-09-24 23:33:03,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 23:33:03,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:03,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:33:03,372 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:33:03,374 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-24 23:33:03,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 23:33:03,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:33:03,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-24 23:33:03,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:33:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-24 23:33:03,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:33:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-24 23:33:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607071109] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:33:03,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:33:03,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-09-24 23:33:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354045351] [2024-09-24 23:33:03,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:33:03,578 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-24 23:33:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:33:03,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-24 23:33:03,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-09-24 23:33:03,579 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-24 23:33:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:33:03,672 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2024-09-24 23:33:03,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:33:03,673 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) Word has length 55 [2024-09-24 23:33:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:33:03,673 INFO L225 Difference]: With dead ends: 110 [2024-09-24 23:33:03,673 INFO L226 Difference]: Without dead ends: 74 [2024-09-24 23:33:03,674 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-09-24 23:33:03,674 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 36 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:33:03,674 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 200 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:33:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-24 23:33:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-09-24 23:33:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-24 23:33:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2024-09-24 23:33:03,689 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 55 [2024-09-24 23:33:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:33:03,690 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2024-09-24 23:33:03,690 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-24 23:33:03,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2024-09-24 23:33:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-24 23:33:03,691 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:33:03,691 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:33:03,707 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-24 23:33:03,895 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:03,896 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:33:03,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1563984878, now seen corresponding path program 1 times [2024-09-24 23:33:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:33:03,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640202617] [2024-09-24 23:33:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:33:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:33:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:33:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:33:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:33:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:33:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:33:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:33:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-24 23:33:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-24 23:33:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-24 23:33:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-24 23:33:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:33:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640202617] [2024-09-24 23:33:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640202617] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:33:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903229443] [2024-09-24 23:33:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:33:04,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:04,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:33:04,057 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:33:04,058 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-24 23:33:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:33:04,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-24 23:33:04,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:33:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-09-24 23:33:04,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:33:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-24 23:33:04,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903229443] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:33:04,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:33:04,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-09-24 23:33:04,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20293429] [2024-09-24 23:33:04,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:33:04,276 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 23:33:04,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:33:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 23:33:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-24 23:33:04,277 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-09-24 23:33:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:33:04,349 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2024-09-24 23:33:04,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:33:04,349 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 60 [2024-09-24 23:33:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:33:04,350 INFO L225 Difference]: With dead ends: 78 [2024-09-24 23:33:04,350 INFO L226 Difference]: Without dead ends: 0 [2024-09-24 23:33:04,351 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-09-24 23:33:04,351 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:33:04,351 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:33:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-24 23:33:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-24 23:33:04,352 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-24 23:33:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-24 23:33:04,352 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2024-09-24 23:33:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:33:04,352 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-24 23:33:04,353 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-09-24 23:33:04,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:33:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-24 23:33:04,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-24 23:33:04,355 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-24 23:33:04,368 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-24 23:33:04,556 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:33:04,559 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:33:04,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-24 23:33:04,790 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 23:33:04,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 11:33:04 BoogieIcfgContainer [2024-09-24 23:33:04,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-24 23:33:04,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-24 23:33:04,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-24 23:33:04,802 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-24 23:33:04,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:32:59" (3/4) ... [2024-09-24 23:33:04,804 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-24 23:33:04,843 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-24 23:33:04,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-24 23:33:04,843 INFO L158 Benchmark]: Toolchain (without parser) took 5645.14ms. Allocated memory was 224.4MB in the beginning and 283.1MB in the end (delta: 58.7MB). Free memory was 153.1MB in the beginning and 166.7MB in the end (delta: -13.6MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-09-24 23:33:04,843 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 23:33:04,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.11ms. Allocated memory is still 224.4MB. Free memory was 153.1MB in the beginning and 141.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-24 23:33:04,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.55ms. Allocated memory is still 224.4MB. Free memory was 141.3MB in the beginning and 140.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:33:04,844 INFO L158 Benchmark]: Boogie Preprocessor took 47.41ms. Allocated memory is still 224.4MB. Free memory was 140.2MB in the beginning and 138.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:33:04,844 INFO L158 Benchmark]: RCFGBuilder took 273.15ms. Allocated memory is still 224.4MB. Free memory was 138.4MB in the beginning and 124.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-24 23:33:04,844 INFO L158 Benchmark]: TraceAbstraction took 5015.17ms. Allocated memory was 224.4MB in the beginning and 283.1MB in the end (delta: 58.7MB). Free memory was 124.0MB in the beginning and 168.8MB in the end (delta: -44.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-09-24 23:33:04,844 INFO L158 Benchmark]: Witness Printer took 41.00ms. Allocated memory is still 283.1MB. Free memory was 168.8MB in the beginning and 166.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:33:04,845 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.15ms. Allocated memory is still 123.7MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.11ms. Allocated memory is still 224.4MB. Free memory was 153.1MB in the beginning and 141.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.55ms. Allocated memory is still 224.4MB. Free memory was 141.3MB in the beginning and 140.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.41ms. Allocated memory is still 224.4MB. Free memory was 140.2MB in the beginning and 138.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 273.15ms. Allocated memory is still 224.4MB. Free memory was 138.4MB in the beginning and 124.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5015.17ms. Allocated memory was 224.4MB in the beginning and 283.1MB in the end (delta: 58.7MB). Free memory was 124.0MB in the beginning and 168.8MB in the end (delta: -44.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Witness Printer took 41.00ms. Allocated memory is still 283.1MB. Free memory was 168.8MB in the beginning and 166.7MB 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 5 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 1207 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 896 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 311 mSDtfsCounter, 389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 589 GetRequests, 522 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=7, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 738 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 727 ConstructedInterpolants, 0 QuantifiedInterpolants, 1528 SizeOfPredicates, 13 NumberOfNonLiveVariables, 830 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 710/759 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: 35]: Loop Invariant Derived loop invariant: ((((((((r == 0) && (y == 1)) && (s == 1)) && (x == 1)) && (b == y)) && (q == 0)) && (a == x)) && (p == 1)) - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 10]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-24 23:33:04,863 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