This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 05:27:02,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:27:02,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:27:02,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:27:02,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:27:02,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:27:02,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:27:02,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:27:02,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:27:02,186 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:27:02,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:27:02,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:27:02,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:27:02,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:27:02,190 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:27:02,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:27:02,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:27:02,191 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:27:02,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:27:02,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:27:02,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:27:02,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:27:02,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:27:02,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:27:02,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:27:02,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:27:02,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:27:02,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:27:02,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:27:02,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:27:02,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:27:02,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:27:02,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:27:02,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:27:02,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:27:02,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:27:02,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:27:02,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:27:02,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:27:02,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:27:02,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:27:02,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:27:02,203 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 05:27:02,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:27:02,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:27:02,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:27:02,484 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:27:02,485 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:27:02,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/divbin2_unwindbound1.yml/witness-2.1.yml [2024-09-13 05:27:02,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:27:02,575 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:27:02,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound1.i [2024-09-13 05:27:03,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:27:04,106 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:27:04,107 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound1.i [2024-09-13 05:27:04,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ba3c08a85/ebc3baeca0e147f089ab378df5929622/FLAG7cf4c6389 [2024-09-13 05:27:04,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ba3c08a85/ebc3baeca0e147f089ab378df5929622 [2024-09-13 05:27:04,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:27:04,128 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:27:04,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:27:04,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:27:04,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:27:04,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:27:02" (1/2) ... [2024-09-13 05:27:04,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c64a16a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:27:04, skipping insertion in model container [2024-09-13 05:27:04,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:27:02" (1/2) ... [2024-09-13 05:27:04,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6881ade5 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:27:04, skipping insertion in model container [2024-09-13 05:27:04,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:27:04" (2/2) ... [2024-09-13 05:27:04,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c64a16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04, skipping insertion in model container [2024-09-13 05:27:04,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:27:04" (2/2) ... [2024-09-13 05:27:04,144 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:27:04,144 INFO L1541 ArrayList]: Loop invariant at [L34-L37] ((\old(counter) == 0) && ((((A == r) && (counter == 0)) && (q == 0)) || (((A == r) && (1 <= counter)) && (q == 0)))) [2024-09-13 05:27:04,144 INFO L1541 ArrayList]: Loop invariant at [L38-L47] ((((A == r) && (1 <= counter)) && (\old(counter) == 0)) && (q == 0)) [2024-09-13 05:27:04,144 INFO L1541 ArrayList]: Function contract at [L26]: requires (counter == 0), ensures (\old(counter) == 0) [2024-09-13 05:27:04,144 INFO L1541 ArrayList]: Function contract at [L18]: requires ((1 <= counter) && (1 <= \old(cond))), ensures ((1 <= counter) && (1 <= \old(cond))) [2024-09-13 05:27:04,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:27:04,319 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound1.i[951,964] [2024-09-13 05:27:04,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:27:04,360 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-13 05:27:04,400 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound1.i[951,964] Start Parsing Global Start Parsing Global Start Parsing Local Start Parsing Local [2024-09-13 05:27:04,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:27:04,430 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:27:04,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04 WrapperNode [2024-09-13 05:27:04,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:27:04,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:27:04,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:27:04,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:27:04,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,476 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2024-09-13 05:27:04,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:27:04,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:27:04,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:27:04,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:27:04,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,503 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure __VERIFIER_assert is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 05:27:04,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:27:04,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:27:04,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:27:04,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:27:04,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (1/1) ... [2024-09-13 05:27:04,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:27:04,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:27:04,547 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-13 05:27:04,549 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-13 05:27:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:27:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:27:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:27:04,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:27:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:27:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:27:04,634 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:27:04,636 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:27:04,776 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:27:04,797 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-09-13 05:27:04,797 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:27:04,829 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:27:04,829 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 05:27:04,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:27:04 BoogieIcfgContainer [2024-09-13 05:27:04,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:27:04,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:27:04,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:27:04,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:27:04,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:27:02" (1/4) ... [2024-09-13 05:27:04,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2826b5a6 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:27:04, skipping insertion in model container [2024-09-13 05:27:04,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:27:04" (2/4) ... [2024-09-13 05:27:04,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2826b5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:27:04, skipping insertion in model container [2024-09-13 05:27:04,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:27:04" (3/4) ... [2024-09-13 05:27:04,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2826b5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:27:04, skipping insertion in model container [2024-09-13 05:27:04,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:27:04" (4/4) ... [2024-09-13 05:27:04,843 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound1.i [2024-09-13 05:27:04,860 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:27:04,861 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-09-13 05:27:04,914 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:27:04,923 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=None, 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;@4366ea66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:27:04,924 INFO L337 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-09-13 05:27:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.736842105263158) internal successors, (33), 25 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 05:27:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-13 05:27:04,935 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:27:04,935 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-13 05:27:04,936 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:27:04,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:27:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash 3320, now seen corresponding path program 1 times [2024-09-13 05:27:04,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:27:04,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495593552] [2024-09-13 05:27:04,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:27:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:27:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:27:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:27:05,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:27:05,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495593552] [2024-09-13 05:27:05,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495593552] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:27:05,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:27:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-13 05:27:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812272377] [2024-09-13 05:27:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:27:05,121 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:27:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:27:05,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:27:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:27:05,164 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.736842105263158) internal successors, (33), 25 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-13 05:27:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:27:05,254 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-09-13 05:27:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:27:05,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2024-09-13 05:27:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:27:05,264 INFO L225 Difference]: With dead ends: 31 [2024-09-13 05:27:05,264 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 05:27:05,265 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:27:05,270 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:27:05,272 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:27:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 05:27:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-09-13 05:27:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 05:27:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-09-13 05:27:05,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 2 [2024-09-13 05:27:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:27:05,307 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-09-13 05:27:05,307 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-13 05:27:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-09-13 05:27:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-09-13 05:27:05,307 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:27:05,308 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-09-13 05:27:05,308 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:27:05,308 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:27:05,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:27:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash 102957, now seen corresponding path program 1 times [2024-09-13 05:27:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:27:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171597882] [2024-09-13 05:27:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:27:05,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:27:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:27:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:27:05,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:27:05,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171597882] [2024-09-13 05:27:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171597882] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:27:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:27:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:27:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341374310] [2024-09-13 05:27:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:27:05,620 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:27:05,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:27:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:27:05,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:27:05,623 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-13 05:27:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:27:05,685 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-13 05:27:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:27:05,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-09-13 05:27:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:27:05,687 INFO L225 Difference]: With dead ends: 29 [2024-09-13 05:27:05,687 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 05:27:05,688 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:27:05,689 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:27:05,691 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:27:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 05:27:05,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-09-13 05:27:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 05:27:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-09-13 05:27:05,698 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 3 [2024-09-13 05:27:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:27:05,699 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-09-13 05:27:05,699 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-13 05:27:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-09-13 05:27:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-13 05:27:05,700 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:27:05,700 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-13 05:27:05,700 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:27:05,701 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:27:05,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:27:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1227734488, now seen corresponding path program 1 times [2024-09-13 05:27:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:27:05,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469042203] [2024-09-13 05:27:05,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:27:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:27:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:27:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:27:05,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:27:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469042203] [2024-09-13 05:27:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469042203] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:27:05,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:27:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:27:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041885351] [2024-09-13 05:27:05,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:27:05,794 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:27:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:27:05,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:27:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:27:05,797 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-13 05:27:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:27:05,836 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-09-13 05:27:05,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:27:05,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2024-09-13 05:27:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:27:05,837 INFO L225 Difference]: With dead ends: 30 [2024-09-13 05:27:05,837 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 05:27:05,838 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:27:05,840 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:27:05,841 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:27:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 05:27:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 05:27:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 05:27:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-09-13 05:27:05,849 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 6 [2024-09-13 05:27:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:27:05,849 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-09-13 05:27:05,850 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-13 05:27:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-09-13 05:27:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-13 05:27:05,850 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:27:05,850 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:27:05,851 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 05:27:05,851 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:27:05,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:27:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash 594938297, now seen corresponding path program 1 times [2024-09-13 05:27:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:27:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318462824] [2024-09-13 05:27:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:27:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:27:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:27:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:27:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:27:06,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318462824] [2024-09-13 05:27:06,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318462824] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:27:06,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:27:06,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:27:06,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181286233] [2024-09-13 05:27:06,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:27:06,108 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:27:06,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:27:06,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:27:06,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:27:06,109 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-13 05:27:10,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:14,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:18,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:22,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:26,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:30,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:34,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:38,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:42,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:46,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:50,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:54,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:27:58,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:28:02,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:28:06,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:28:10,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:28:14,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:28:18,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:28:22,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:28:26,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:28:30,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:28:31,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:28:35,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:28:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:28:35,675 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-13 05:28:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:28:35,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Word has length 7 [2024-09-13 05:28:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:28:35,676 INFO L225 Difference]: With dead ends: 29 [2024-09-13 05:28:35,676 INFO L226 Difference]: Without dead ends: 27 [2024-09-13 05:28:35,676 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:28:35,677 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.5s IncrementalHoareTripleChecker+Time [2024-09-13 05:28:35,677 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 33 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 89.5s Time] [2024-09-13 05:28:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-13 05:28:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-13 05:28:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 05:28:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-09-13 05:28:35,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 7 [2024-09-13 05:28:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:28:35,684 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-09-13 05:28:35,685 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-13 05:28:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-09-13 05:28:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-13 05:28:35,685 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:28:35,685 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:28:35,685 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:28:35,685 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:28:35,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:28:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1523164968, now seen corresponding path program 1 times [2024-09-13 05:28:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:28:35,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023007933] [2024-09-13 05:28:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:28:35,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:28:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:28:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783850208] [2024-09-13 05:28:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:28:35,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:28:35,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:28:35,708 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-13 05:28:35,709 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-13 05:28:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:28:35,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-13 05:28:35,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:28:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:28:35,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:28:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:28:35,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023007933] [2024-09-13 05:28:35,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:28:35,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783850208] [2024-09-13 05:28:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783850208] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:28:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:28:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 05:28:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363360276] [2024-09-13 05:28:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:28:35,974 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:28:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:28:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:28:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:28:35,975 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-13 05:28:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:28:36,079 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-09-13 05:28:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:28:36,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) Word has length 10 [2024-09-13 05:28:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:28:36,082 INFO L225 Difference]: With dead ends: 35 [2024-09-13 05:28:36,085 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 05:28:36,085 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:28:36,086 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:28:36,086 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:28:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 05:28:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-09-13 05:28:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 05:28:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-13 05:28:36,095 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 10 [2024-09-13 05:28:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:28:36,095 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-13 05:28:36,096 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-13 05:28:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-13 05:28:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-13 05:28:36,096 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:28:36,096 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:28:36,112 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 05:28:36,300 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:28:36,301 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:28:36,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:28:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1523164922, now seen corresponding path program 1 times [2024-09-13 05:28:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:28:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910344994] [2024-09-13 05:28:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:28:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:28:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:28:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:28:36,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:28:36,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910344994] [2024-09-13 05:28:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910344994] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:28:36,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:28:36,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:28:36,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776418442] [2024-09-13 05:28:36,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:28:36,366 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:28:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:28:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:28:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:28:36,367 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-13 05:28:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:28:36,396 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-09-13 05:28:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:28:36,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2024-09-13 05:28:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:28:36,397 INFO L225 Difference]: With dead ends: 26 [2024-09-13 05:28:36,397 INFO L226 Difference]: Without dead ends: 25 [2024-09-13 05:28:36,397 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:28:36,398 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:28:36,398 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 27 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:28:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-13 05:28:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-13 05:28:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:28:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-09-13 05:28:36,401 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2024-09-13 05:28:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:28:36,401 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-09-13 05:28:36,401 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-13 05:28:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-09-13 05:28:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-13 05:28:36,402 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:28:36,402 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:28:36,402 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 05:28:36,402 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:28:36,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:28:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -277376700, now seen corresponding path program 1 times [2024-09-13 05:28:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:28:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15478890] [2024-09-13 05:28:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:28:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:28:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:28:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:28:36,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:28:36,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15478890] [2024-09-13 05:28:36,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15478890] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:28:36,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:28:36,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:28:36,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702100101] [2024-09-13 05:28:36,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:28:36,453 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:28:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:28:36,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:28:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:28:36,454 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:28:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:28:36,471 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-09-13 05:28:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:28:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-09-13 05:28:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:28:36,472 INFO L225 Difference]: With dead ends: 24 [2024-09-13 05:28:36,472 INFO L226 Difference]: Without dead ends: 23 [2024-09-13 05:28:36,473 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:28:36,473 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:28:36,474 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:28:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-13 05:28:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-13 05:28:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:28:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-09-13 05:28:36,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 13 [2024-09-13 05:28:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:28:36,479 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-09-13 05:28:36,479 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:28:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-09-13 05:28:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-13 05:28:36,479 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:28:36,479 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:28:36,479 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 05:28:36,480 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:28:36,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:28:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash -277376861, now seen corresponding path program 1 times [2024-09-13 05:28:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:28:36,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223433665] [2024-09-13 05:28:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:28:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:28:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:28:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:28:36,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:28:36,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223433665] [2024-09-13 05:28:36,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223433665] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:28:36,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:28:36,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:28:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914275214] [2024-09-13 05:28:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:28:36,536 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:28:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:28:36,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:28:36,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:28:36,538 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:28:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:28:36,543 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-09-13 05:28:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:28:36,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-09-13 05:28:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:28:36,548 INFO L225 Difference]: With dead ends: 21 [2024-09-13 05:28:36,548 INFO L226 Difference]: Without dead ends: 15 [2024-09-13 05:28:36,548 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:28:36,549 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:28:36,549 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:28:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-13 05:28:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-13 05:28:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-13 05:28:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-09-13 05:28:36,550 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2024-09-13 05:28:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:28:36,550 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-09-13 05:28:36,551 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:28:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-09-13 05:28:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-13 05:28:36,551 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:28:36,551 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:28:36,551 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 05:28:36,552 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:28:36,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:28:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1332402048, now seen corresponding path program 1 times [2024-09-13 05:28:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:28:36,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019491388] [2024-09-13 05:28:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:28:36,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:28:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:28:36,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351815286] [2024-09-13 05:28:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:28:36,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:28:36,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:28:36,565 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-13 05:28:36,566 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-13 05:28:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:28:36,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 05:28:36,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:28:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 05:28:36,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:28:36,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:28:36,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019491388] [2024-09-13 05:28:36,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:28:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351815286] [2024-09-13 05:28:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351815286] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:28:36,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:28:36,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 05:28:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110686304] [2024-09-13 05:28:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:28:36,755 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:28:36,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:28:36,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:28:36,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:28:36,756 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-13 05:28:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:28:36,792 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-09-13 05:28:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:28:36,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 13 [2024-09-13 05:28:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:28:36,793 INFO L225 Difference]: With dead ends: 19 [2024-09-13 05:28:36,793 INFO L226 Difference]: Without dead ends: 15 [2024-09-13 05:28:36,794 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:28:36,794 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:28:36,794 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:28:36,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-13 05:28:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-13 05:28:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-13 05:28:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-09-13 05:28:36,796 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2024-09-13 05:28:36,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:28:36,798 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-09-13 05:28:36,799 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-13 05:28:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-09-13 05:28:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 05:28:36,799 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:28:36,800 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:28:36,815 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 05:28:37,000 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:28:37,001 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-09-13 05:28:37,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:28:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1695880513, now seen corresponding path program 1 times [2024-09-13 05:28:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:28:37,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048954857] [2024-09-13 05:28:37,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:28:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:28:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:28:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:28:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:28:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048954857] [2024-09-13 05:28:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048954857] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:28:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761910897] [2024-09-13 05:28:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:28:37,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:28:37,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:28:37,097 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-13 05:28:37,100 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-13 05:28:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:28:37,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 05:28:37,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:28:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:28:37,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:28:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:28:37,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761910897] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:28:37,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:28:37,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-09-13 05:28:37,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658956789] [2024-09-13 05:28:37,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:28:37,203 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:28:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:28:37,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:28:37,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:28:37,204 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-13 05:28:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:28:37,230 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2024-09-13 05:28:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:28:37,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) Word has length 14 [2024-09-13 05:28:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:28:37,230 INFO L225 Difference]: With dead ends: 9 [2024-09-13 05:28:37,230 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 05:28:37,231 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-13 05:28:37,231 INFO L434 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:28:37,232 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:28:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 05:28:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 05:28:37,232 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-13 05:28:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 05:28:37,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2024-09-13 05:28:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:28:37,233 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 05:28:37,233 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-13 05:28:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 05:28:37,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 05:28:37,236 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION (7 of 8 remaining) [2024-09-13 05:28:37,236 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-09-13 05:28:37,236 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-09-13 05:28:37,237 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (4 of 8 remaining) [2024-09-13 05:28:37,237 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (3 of 8 remaining) [2024-09-13 05:28:37,237 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONPOST_CONDITION (2 of 8 remaining) [2024-09-13 05:28:37,237 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-09-13 05:28:37,237 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 8 remaining) [2024-09-13 05:28:37,253 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 05:28:37,441 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-13 05:28:37,444 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:28:37,446 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:28:37,447 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 05:28:37,447 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 05:28:37,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:28:37 BoogieIcfgContainer [2024-09-13 05:28:37,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:28:37,448 INFO L158 Benchmark]: Toolchain (without parser) took 93320.74ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 77.2MB in the beginning and 93.0MB in the end (delta: -15.7MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-09-13 05:28:37,448 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:28:37,449 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 151.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:28:37,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.54ms. Allocated memory is still 151.0MB. Free memory was 77.1MB in the beginning and 63.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 05:28:37,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.65ms. Allocated memory is still 151.0MB. Free memory was 63.2MB in the beginning and 119.8MB in the end (delta: -56.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-09-13 05:28:37,449 INFO L158 Benchmark]: Boogie Preprocessor took 44.61ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 119.7MB in the beginning and 164.4MB in the end (delta: -44.7MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-09-13 05:28:37,449 INFO L158 Benchmark]: RCFGBuilder took 307.00ms. Allocated memory is still 192.9MB. Free memory was 164.4MB in the beginning and 149.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 05:28:37,450 INFO L158 Benchmark]: TraceAbstraction took 92613.89ms. Allocated memory is still 192.9MB. Free memory was 149.7MB in the beginning and 93.0MB in the end (delta: 56.8MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2024-09-13 05:28:37,451 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.71ms. Allocated memory is still 151.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.54ms. Allocated memory is still 151.0MB. Free memory was 77.1MB in the beginning and 63.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.65ms. Allocated memory is still 151.0MB. Free memory was 63.2MB in the beginning and 119.8MB in the end (delta: -56.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.61ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 119.7MB in the beginning and 164.4MB in the end (delta: -44.7MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.00ms. Allocated memory is still 192.9MB. Free memory was 164.4MB in the beginning and 149.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 92613.89ms. Allocated memory is still 192.9MB. Free memory was 149.7MB in the beginning and 93.0MB in the end (delta: 56.8MB). Peak memory consumption was 56.8MB. 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: 26]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 34]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 38]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 18]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 18]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 26]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 18]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 92.6s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 90.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 89.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 89.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 154 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=5, InterpolantAutomatonStates: 45, 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, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 516 SizeOfPredicates, 3 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 10/15 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 05:28:37,500 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...