./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/apache-escape-absolute.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i ../results/automizer-verification-files/SV-COMP24_unreach-call/apache-escape-absolute.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:12:19,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:12:19,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:12:19,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:12:19,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:12:19,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:12:19,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:12:19,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:12:19,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:12:19,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:12:19,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:12:19,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:12:19,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:12:19,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:12:19,235 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:12:19,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:12:19,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:12:19,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:12:19,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:12:19,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:12:19,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:12:19,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:12:19,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:12:19,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:12:19,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:12:19,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:12:19,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:12:19,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:12:19,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:12:19,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:12:19,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:12:19,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:12:19,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:12:19,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:12:19,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:12:19,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:12:19,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:12:19,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:12:19,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:12:19,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:12:19,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:12:19,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:12:19,247 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 10:12:19,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:12:19,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:12:19,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:12:19,519 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:12:19,519 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:12:19,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/apache-escape-absolute.yml/witness-2.1.yml [2024-09-13 10:12:19,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:12:19,622 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:12:19,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-09-13 10:12:21,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:12:21,188 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:12:21,189 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-09-13 10:12:21,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/546c680e9/ba321d54bcba45519748ca6de515a254/FLAGa75d45d12 [2024-09-13 10:12:21,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/546c680e9/ba321d54bcba45519748ca6de515a254 [2024-09-13 10:12:21,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:12:21,592 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:12:21,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:12:21,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:12:21,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:12:21,602 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 10:12:19" (1/2) ... [2024-09-13 10:12:21,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f31e2f6 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:12:21, skipping insertion in model container [2024-09-13 10:12:21,603 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 10:12:19" (1/2) ... [2024-09-13 10:12:21,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@49d19208 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:12:21, skipping insertion in model container [2024-09-13 10:12:21,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:12:21" (2/2) ... [2024-09-13 10:12:21,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f31e2f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21, skipping insertion in model container [2024-09-13 10:12:21,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:12:21" (2/2) ... [2024-09-13 10:12:21,619 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:12:21,620 INFO L1541 ArrayList]: Loop invariant at [L47-L52] ((((long long) cp + 1) <= urilen) && (1 <= cp)) [2024-09-13 10:12:21,620 INFO L1541 ArrayList]: Loop invariant at [L65-L77] ((((((long long) cp + 1) <= urilen) && (c == 0)) && (1 <= cp)) || (((1 <= c) && (((long long) cp + 1) <= urilen)) && (1 <= cp))) [2024-09-13 10:12:21,620 INFO L1541 ArrayList]: Function contract at [L17]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-13 10:12:21,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:12:21,800 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2024-09-13 10:12:21,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:12:21,832 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-13 10:12:21,868 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] Start Parsing Local Start Parsing Local [2024-09-13 10:12:21,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:12:21,900 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:12:21,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21 WrapperNode [2024-09-13 10:12:21,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:12:21,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:12:21,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:12:21,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:12:21,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,935 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2024-09-13 10:12:21,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:12:21,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:12:21,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:12:21,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:12:21,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,958 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 10:12:21,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:12:21,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:12:21,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:12:21,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:12:21,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (1/1) ... [2024-09-13 10:12:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:12:21,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:12:21,997 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 10:12:21,999 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 10:12:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:12:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:12:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:12:22,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:12:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 10:12:22,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 10:12:22,094 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:12:22,095 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:12:22,288 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:12:22,331 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-09-13 10:12:22,331 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:12:22,358 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:12:22,358 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 10:12:22,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:12:22 BoogieIcfgContainer [2024-09-13 10:12:22,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:12:22,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:12:22,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:12:22,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:12:22,368 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 10:12:19" (1/4) ... [2024-09-13 10:12:22,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174f051 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:12:22, skipping insertion in model container [2024-09-13 10:12:22,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:12:21" (2/4) ... [2024-09-13 10:12:22,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174f051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:12:22, skipping insertion in model container [2024-09-13 10:12:22,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:21" (3/4) ... [2024-09-13 10:12:22,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174f051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:12:22, skipping insertion in model container [2024-09-13 10:12:22,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:12:22" (4/4) ... [2024-09-13 10:12:22,373 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2024-09-13 10:12:22,387 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:12:22,387 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-09-13 10:12:22,427 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:12:22,432 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;@6eadf0ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:12:22,432 INFO L337 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-09-13 10:12:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 53 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:12:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-13 10:12:22,441 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:22,441 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:22,442 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:22,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1418037106, now seen corresponding path program 1 times [2024-09-13 10:12:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350300213] [2024-09-13 10:12:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:22,685 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 10:12:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:22,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350300213] [2024-09-13 10:12:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350300213] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:12:22,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575484930] [2024-09-13 10:12:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:22,694 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:12:22,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:22,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:12:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:12:22,749 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 53 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 10:12:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:22,869 INFO L93 Difference]: Finished difference Result 67 states and 99 transitions. [2024-09-13 10:12:22,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:12:22,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-09-13 10:12:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:22,880 INFO L225 Difference]: With dead ends: 67 [2024-09-13 10:12:22,880 INFO L226 Difference]: Without dead ends: 62 [2024-09-13 10:12:22,882 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 10:12:22,885 INFO L434 NwaCegarLoop]: 73 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:22,887 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 109 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-13 10:12:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-09-13 10:12:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:12:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2024-09-13 10:12:22,937 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 9 [2024-09-13 10:12:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:22,938 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2024-09-13 10:12:22,939 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 10:12:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2024-09-13 10:12:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-13 10:12:22,940 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:22,940 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:22,940 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:12:22,940 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:22,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash -551249728, now seen corresponding path program 1 times [2024-09-13 10:12:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:22,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444900138] [2024-09-13 10:12:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,036 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 10:12:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:23,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444900138] [2024-09-13 10:12:23,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444900138] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:23,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:23,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:23,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391141384] [2024-09-13 10:12:23,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:23,040 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:12:23,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:12:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:12:23,043 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 10:12:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:23,062 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2024-09-13 10:12:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:12:23,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-09-13 10:12:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:23,065 INFO L225 Difference]: With dead ends: 59 [2024-09-13 10:12:23,066 INFO L226 Difference]: Without dead ends: 59 [2024-09-13 10:12:23,067 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 10:12:23,068 INFO L434 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:23,068 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:12:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-13 10:12:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-13 10:12:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.162162162162162) internal successors, (43), 42 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:12:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-09-13 10:12:23,082 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 12 [2024-09-13 10:12:23,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:23,082 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-09-13 10:12:23,082 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 10:12:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-09-13 10:12:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-13 10:12:23,083 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:23,083 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:23,084 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:12:23,084 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:23,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -551249567, now seen corresponding path program 1 times [2024-09-13 10:12:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:23,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719044181] [2024-09-13 10:12:23,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,142 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 10:12:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719044181] [2024-09-13 10:12:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719044181] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:23,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:23,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:12:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477033690] [2024-09-13 10:12:23,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:23,143 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:12:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:12:23,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:12:23,146 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 10:12:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:23,250 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-09-13 10:12:23,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:12:23,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-09-13 10:12:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:23,253 INFO L225 Difference]: With dead ends: 58 [2024-09-13 10:12:23,253 INFO L226 Difference]: Without dead ends: 58 [2024-09-13 10:12:23,254 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 10:12:23,254 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:23,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-13 10:12:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-13 10:12:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.135135135135135) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:12:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-09-13 10:12:23,270 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 12 [2024-09-13 10:12:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:23,270 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-09-13 10:12:23,270 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 10:12:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-09-13 10:12:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 10:12:23,271 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:23,271 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:23,271 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 10:12:23,272 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:23,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1469852467, now seen corresponding path program 1 times [2024-09-13 10:12:23,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:23,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818510324] [2024-09-13 10:12:23,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,411 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 10:12:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818510324] [2024-09-13 10:12:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818510324] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:23,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:23,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151004337] [2024-09-13 10:12:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:23,413 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:23,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:23,414 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:12:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:23,476 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2024-09-13 10:12:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:23,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-13 10:12:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:23,478 INFO L225 Difference]: With dead ends: 50 [2024-09-13 10:12:23,479 INFO L226 Difference]: Without dead ends: 50 [2024-09-13 10:12:23,480 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 10:12:23,481 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:23,483 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 132 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-13 10:12:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-09-13 10:12:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 33 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:12:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-09-13 10:12:23,492 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 14 [2024-09-13 10:12:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:23,493 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-09-13 10:12:23,494 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:12:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-09-13 10:12:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-13 10:12:23,496 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:23,496 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:23,496 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:12:23,497 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:23,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1163595571, now seen corresponding path program 1 times [2024-09-13 10:12:23,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141607891] [2024-09-13 10:12:23,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:23,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:12:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,641 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:12:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 10:12:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141607891] [2024-09-13 10:12:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141607891] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:23,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:23,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:23,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481957663] [2024-09-13 10:12:23,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:23,650 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:23,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:23,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:23,651 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 10:12:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:23,689 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2024-09-13 10:12:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-09-13 10:12:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:23,690 INFO L225 Difference]: With dead ends: 51 [2024-09-13 10:12:23,690 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 10:12:23,690 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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 10:12:23,691 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:23,691 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 141 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:12:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 10:12:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 10:12:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:12:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-09-13 10:12:23,698 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 31 [2024-09-13 10:12:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:23,698 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-09-13 10:12:23,698 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 10:12:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-09-13 10:12:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 10:12:23,699 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:23,700 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:23,700 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:12:23,700 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:23,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:23,701 INFO L85 PathProgramCache]: Analyzing trace with hash -371231729, now seen corresponding path program 1 times [2024-09-13 10:12:23,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:23,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503302605] [2024-09-13 10:12:23,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,755 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:12:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:12:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 10:12:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 10:12:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-13 10:12:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503302605] [2024-09-13 10:12:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503302605] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:23,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:23,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509474852] [2024-09-13 10:12:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:23,786 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:12:23,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:23,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:12:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:12:23,788 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 10:12:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:23,822 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2024-09-13 10:12:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:12:23,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-09-13 10:12:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:23,823 INFO L225 Difference]: With dead ends: 54 [2024-09-13 10:12:23,823 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 10:12:23,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 10:12:23,825 INFO L434 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 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.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:23,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:12:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 10:12:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 10:12:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:12:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2024-09-13 10:12:23,831 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 44 [2024-09-13 10:12:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:23,831 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2024-09-13 10:12:23,832 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 10:12:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2024-09-13 10:12:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-13 10:12:23,833 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:23,833 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:23,833 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 10:12:23,833 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:23,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:23,834 INFO L85 PathProgramCache]: Analyzing trace with hash 663179677, now seen corresponding path program 1 times [2024-09-13 10:12:23,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:23,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699048959] [2024-09-13 10:12:23,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:23,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,915 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:12:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:12:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 10:12:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:12:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-13 10:12:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:23,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699048959] [2024-09-13 10:12:23,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699048959] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:23,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:23,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024035377] [2024-09-13 10:12:23,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:23,944 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:23,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:23,946 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 10:12:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:24,017 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2024-09-13 10:12:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:24,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-09-13 10:12:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:24,019 INFO L225 Difference]: With dead ends: 51 [2024-09-13 10:12:24,019 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 10:12:24,019 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 10:12:24,020 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:24,021 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 81 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 10:12:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-09-13 10:12:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:12:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2024-09-13 10:12:24,029 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 45 [2024-09-13 10:12:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:24,030 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2024-09-13 10:12:24,030 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 10:12:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2024-09-13 10:12:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-13 10:12:24,033 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:24,035 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:24,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 10:12:24,036 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:24,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:24,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1923684362, now seen corresponding path program 1 times [2024-09-13 10:12:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:24,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509507744] [2024-09-13 10:12:24,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:12:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:12:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 10:12:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:12:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-13 10:12:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509507744] [2024-09-13 10:12:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509507744] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539656083] [2024-09-13 10:12:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:24,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:24,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:24,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:24,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:24,221 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 10:12:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:24,317 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2024-09-13 10:12:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 10:12:24,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-09-13 10:12:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:24,318 INFO L225 Difference]: With dead ends: 61 [2024-09-13 10:12:24,318 INFO L226 Difference]: Without dead ends: 61 [2024-09-13 10:12:24,319 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:12:24,320 INFO L434 NwaCegarLoop]: 70 mSDtfsCounter, 25 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:24,320 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 180 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-13 10:12:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2024-09-13 10:12:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:12:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-09-13 10:12:24,325 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 45 [2024-09-13 10:12:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:24,326 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-09-13 10:12:24,326 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 10:12:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-09-13 10:12:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-13 10:12:24,327 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:24,327 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:24,327 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 10:12:24,327 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:24,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1124997950, now seen corresponding path program 1 times [2024-09-13 10:12:24,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:24,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732896273] [2024-09-13 10:12:24,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:12:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:12:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 10:12:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:12:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-13 10:12:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:12:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,489 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:12:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,495 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:12:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-09-13 10:12:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732896273] [2024-09-13 10:12:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732896273] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:24,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:24,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:12:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414036811] [2024-09-13 10:12:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:24,502 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 10:12:24,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:24,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 10:12:24,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:12:24,503 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-13 10:12:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:24,636 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2024-09-13 10:12:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:12:24,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 67 [2024-09-13 10:12:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:24,638 INFO L225 Difference]: With dead ends: 68 [2024-09-13 10:12:24,638 INFO L226 Difference]: Without dead ends: 68 [2024-09-13 10:12:24,638 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:12:24,639 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:24,639 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 113 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-13 10:12:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2024-09-13 10:12:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-13 10:12:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-09-13 10:12:24,647 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 67 [2024-09-13 10:12:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:24,648 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-09-13 10:12:24,648 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-13 10:12:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-09-13 10:12:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-13 10:12:24,649 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:24,651 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:24,651 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 10:12:24,652 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:24,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1959119514, now seen corresponding path program 1 times [2024-09-13 10:12:24,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:24,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325448197] [2024-09-13 10:12:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,775 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:12:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:12:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 10:12:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,780 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:12:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-13 10:12:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:12:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:12:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:12:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-13 10:12:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-13 10:12:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-13 10:12:24,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325448197] [2024-09-13 10:12:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325448197] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:24,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:24,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:24,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97478824] [2024-09-13 10:12:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:24,798 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:24,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:24,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:24,802 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-09-13 10:12:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:24,838 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2024-09-13 10:12:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2024-09-13 10:12:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:24,839 INFO L225 Difference]: With dead ends: 58 [2024-09-13 10:12:24,839 INFO L226 Difference]: Without dead ends: 58 [2024-09-13 10:12:24,840 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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 10:12:24,840 INFO L434 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:24,840 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 153 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:12:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-13 10:12:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-09-13 10:12:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-13 10:12:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-09-13 10:12:24,848 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 81 [2024-09-13 10:12:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:24,849 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-09-13 10:12:24,849 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-09-13 10:12:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-09-13 10:12:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-09-13 10:12:24,850 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:24,850 INFO L216 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:24,854 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 10:12:24,854 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:24,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:24,854 INFO L85 PathProgramCache]: Analyzing trace with hash 3523265, now seen corresponding path program 1 times [2024-09-13 10:12:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310312620] [2024-09-13 10:12:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:24,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,948 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:12:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,951 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:12:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 10:12:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:12:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-13 10:12:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:12:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:12:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:12:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-13 10:12:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-13 10:12:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-13 10:12:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-13 10:12:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310312620] [2024-09-13 10:12:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310312620] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:24,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805869528] [2024-09-13 10:12:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:24,990 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:24,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:24,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:24,991 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-13 10:12:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:25,033 INFO L93 Difference]: Finished difference Result 52 states and 74 transitions. [2024-09-13 10:12:25,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:25,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 86 [2024-09-13 10:12:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:25,035 INFO L225 Difference]: With dead ends: 52 [2024-09-13 10:12:25,035 INFO L226 Difference]: Without dead ends: 52 [2024-09-13 10:12:25,035 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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 10:12:25,036 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:25,036 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 167 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:12:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-13 10:12:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-13 10:12:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-13 10:12:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-09-13 10:12:25,040 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 86 [2024-09-13 10:12:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:25,041 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-09-13 10:12:25,041 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-13 10:12:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-09-13 10:12:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-09-13 10:12:25,042 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:25,042 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:25,043 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 10:12:25,043 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-13 10:12:25,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1371400769, now seen corresponding path program 1 times [2024-09-13 10:12:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:25,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731694868] [2024-09-13 10:12:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:12:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:12:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 10:12:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:12:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-13 10:12:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:12:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:12:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:12:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-13 10:12:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-13 10:12:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-13 10:12:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,353 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-13 10:12:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-13 10:12:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-13 10:12:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-13 10:12:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:25,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731694868] [2024-09-13 10:12:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731694868] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:12:25,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125189796] [2024-09-13 10:12:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:12:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:12:25,371 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 10:12:25,373 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 10:12:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-13 10:12:25,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:12:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-13 10:12:25,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:12:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-13 10:12:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125189796] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 10:12:25,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:12:25,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 8] total 12 [2024-09-13 10:12:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839370051] [2024-09-13 10:12:25,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:25,958 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 10:12:25,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:25,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 10:12:25,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-09-13 10:12:25,959 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-13 10:12:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:26,048 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2024-09-13 10:12:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:12:26,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 102 [2024-09-13 10:12:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:26,049 INFO L225 Difference]: With dead ends: 57 [2024-09-13 10:12:26,050 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:12:26,050 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-09-13 10:12:26,050 INFO L434 NwaCegarLoop]: 72 mSDtfsCounter, 7 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:26,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:12:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:12:26,051 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 10:12:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:12:26,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2024-09-13 10:12:26,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:26,051 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:12:26,051 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-13 10:12:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:12:26,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:12:26,055 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION (21 of 22 remaining) [2024-09-13 10:12:26,055 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (20 of 22 remaining) [2024-09-13 10:12:26,055 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (19 of 22 remaining) [2024-09-13 10:12:26,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (18 of 22 remaining) [2024-09-13 10:12:26,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 22 remaining) [2024-09-13 10:12:26,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (16 of 22 remaining) [2024-09-13 10:12:26,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (15 of 22 remaining) [2024-09-13 10:12:26,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (14 of 22 remaining) [2024-09-13 10:12:26,056 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (13 of 22 remaining) [2024-09-13 10:12:26,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION (12 of 22 remaining) [2024-09-13 10:12:26,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION (11 of 22 remaining) [2024-09-13 10:12:26,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION (10 of 22 remaining) [2024-09-13 10:12:26,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION (9 of 22 remaining) [2024-09-13 10:12:26,057 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 22 remaining) [2024-09-13 10:12:26,058 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONPRE_CONDITION (7 of 22 remaining) [2024-09-13 10:12:26,058 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION (6 of 22 remaining) [2024-09-13 10:12:26,058 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION (5 of 22 remaining) [2024-09-13 10:12:26,058 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION (4 of 22 remaining) [2024-09-13 10:12:26,058 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION (3 of 22 remaining) [2024-09-13 10:12:26,058 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONPRE_CONDITION (2 of 22 remaining) [2024-09-13 10:12:26,059 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 22 remaining) [2024-09-13 10:12:26,059 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 22 remaining) [2024-09-13 10:12:26,077 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 10:12:26,259 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-13 10:12:26,263 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:26,265 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:12:26,267 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 10:12:26,267 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 10:12:26,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:12:26 BoogieIcfgContainer [2024-09-13 10:12:26,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:12:26,268 INFO L158 Benchmark]: Toolchain (without parser) took 4677.14ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 72.4MB in the beginning and 136.7MB in the end (delta: -64.3MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-09-13 10:12:26,269 INFO L158 Benchmark]: Witness Parser took 0.22ms. Allocated memory is still 146.8MB. Free memory was 96.9MB in the beginning and 96.7MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:12:26,269 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 146.8MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:12:26,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.32ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 72.1MB in the beginning and 155.3MB in the end (delta: -83.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-09-13 10:12:26,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.96ms. Allocated memory is still 190.8MB. Free memory was 155.3MB in the beginning and 154.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:12:26,270 INFO L158 Benchmark]: Boogie Preprocessor took 32.95ms. Allocated memory is still 190.8MB. Free memory was 154.2MB in the beginning and 152.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:12:26,270 INFO L158 Benchmark]: RCFGBuilder took 388.27ms. Allocated memory is still 190.8MB. Free memory was 152.1MB in the beginning and 133.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-13 10:12:26,271 INFO L158 Benchmark]: TraceAbstraction took 3905.15ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 132.2MB in the beginning and 136.7MB in the end (delta: -4.5MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-09-13 10:12:26,272 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.22ms. Allocated memory is still 146.8MB. Free memory was 96.9MB in the beginning and 96.7MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.87ms. Allocated memory is still 146.8MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.32ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 72.1MB in the beginning and 155.3MB in the end (delta: -83.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.96ms. Allocated memory is still 190.8MB. Free memory was 155.3MB in the beginning and 154.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.95ms. Allocated memory is still 190.8MB. Free memory was 154.2MB in the beginning and 152.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.27ms. Allocated memory is still 190.8MB. Free memory was 152.1MB in the beginning and 133.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3905.15ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 132.2MB in the beginning and 136.7MB in the end (delta: -4.5MB). Peak memory consumption was 35.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: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 47]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 65]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 17]: 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, 70 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 1657 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 880 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 777 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, InterpolantAutomatonStates: 53, 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, 12 MinimizatonAttempts, 36 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1487 SizeOfPredicates, 1 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2402/2404 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 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 10:12:26,298 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE