./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex3.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 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-lit/hh2012-ex3.i ../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex3.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-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 20:10:55,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 20:10:55,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 20:10:55,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 20:10:55,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 20:10:55,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 20:10:55,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 20:10:55,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 20:10:55,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 20:10:55,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 20:10:55,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 20:10:55,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 20:10:55,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 20:10:55,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 20:10:55,734 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 20:10:55,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 20:10:55,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 20:10:55,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 20:10:55,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 20:10:55,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 20:10:55,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 20:10:55,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 20:10:55,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 20:10:55,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 20:10:55,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 20:10:55,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 20:10:55,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 20:10:55,742 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 20:10:55,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 20:10:55,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 20:10:55,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 20:10:55,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 20:10:55,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:55,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 20:10:55,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 20:10:55,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 20:10:55,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 20:10:55,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 20:10:55,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 20:10:55,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 20:10:55,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 20:10:55,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 20:10:55,750 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-15 20:10:56,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 20:10:56,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 20:10:56,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 20:10:56,112 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-15 20:10:56,113 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-15 20:10:56,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex3.yml/witness-2.1.yml [2024-09-15 20:10:56,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 20:10:56,178 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 20:10:56,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-15 20:10:57,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 20:10:57,895 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 20:10:57,896 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-15 20:10:57,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7f476cd31/bb73189c68454a8daeb3ede8ae88490f/FLAG3e4abb43b [2024-09-15 20:10:57,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7f476cd31/bb73189c68454a8daeb3ede8ae88490f [2024-09-15 20:10:57,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 20:10:57,925 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-15 20:10:57,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:57,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 20:10:57,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 20:10:57,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:56" (1/2) ... [2024-09-15 20:10:57,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10200bd1 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57, skipping insertion in model container [2024-09-15 20:10:57,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:56" (1/2) ... [2024-09-15 20:10:57,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@549f8824 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57, skipping insertion in model container [2024-09-15 20:10:57,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:57" (2/2) ... [2024-09-15 20:10:57,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10200bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:57, skipping insertion in model container [2024-09-15 20:10:57,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:57" (2/2) ... [2024-09-15 20:10:57,953 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-15 20:10:57,954 INFO L1541 ArrayList]: Loop invariant at [L18-L25] ((((j == 0) && (0 <= i)) && (i <= 3)) || ((((i <= ((long long) j + 3)) && (1 <= j)) && (j <= i)) && (j <= 4))) [2024-09-15 20:10:57,954 INFO L1541 ArrayList]: Loop invariant at [L16-L31] ((i <= 4) && (0 <= i)) [2024-09-15 20:10:57,954 INFO L1541 ArrayList]: Function contract at [L13]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-15 20:10:57,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 20:10:58,139 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i[799,812] [2024-09-15 20:10:58,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:58,174 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-15 20:10:58,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i[799,812] Start Parsing Local Start Parsing Local [2024-09-15 20:10:58,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:58,254 INFO L204 MainTranslator]: Completed translation [2024-09-15 20:10:58,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58 WrapperNode [2024-09-15 20:10:58,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:58,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:58,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 20:10:58,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 20:10:58,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,292 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-09-15 20:10:58,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:58,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 20:10:58,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 20:10:58,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 20:10:58,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,329 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-15 20:10:58,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 20:10:58,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 20:10:58,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 20:10:58,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 20:10:58,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (1/1) ... [2024-09-15 20:10:58,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:58,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:10:58,376 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-15 20:10:58,383 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-15 20:10:58,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 20:10:58,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-15 20:10:58,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 20:10:58,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 20:10:58,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 20:10:58,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 20:10:58,516 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 20:10:58,521 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 20:10:58,669 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-15 20:10:58,693 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-09-15 20:10:58,694 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 20:10:58,723 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 20:10:58,724 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-15 20:10:58,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:58 BoogieIcfgContainer [2024-09-15 20:10:58,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 20:10:58,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 20:10:58,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 20:10:58,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 20:10:58,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:56" (1/4) ... [2024-09-15 20:10:58,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ae5ae0 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:10:58, skipping insertion in model container [2024-09-15 20:10:58,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:10:57" (2/4) ... [2024-09-15 20:10:58,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ae5ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:10:58, skipping insertion in model container [2024-09-15 20:10:58,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:58" (3/4) ... [2024-09-15 20:10:58,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ae5ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:10:58, skipping insertion in model container [2024-09-15 20:10:58,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:58" (4/4) ... [2024-09-15 20:10:58,739 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-09-15 20:10:58,758 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 20:10:58,758 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-15 20:10:58,810 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 20:10:58,817 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;@4f06ca85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 20:10:58,817 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-15 20:10:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 20:10:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-15 20:10:58,827 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,827 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-15 20:10:58,828 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:10:58,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash 3507, now seen corresponding path program 1 times [2024-09-15 20:10:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:58,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146525711] [2024-09-15 20:10:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,024 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-15 20:10:59,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146525711] [2024-09-15 20:10:59,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146525711] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:59,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-15 20:10:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662292899] [2024-09-15 20:10:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,038 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:10:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:10:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:59,075 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:59,153 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-09-15 20:10:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:10:59,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-09-15 20:10:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:59,161 INFO L225 Difference]: With dead ends: 44 [2024-09-15 20:10:59,162 INFO L226 Difference]: Without dead ends: 42 [2024-09-15 20:10:59,164 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:59,169 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:59,170 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-15 20:10:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2024-09-15 20:10:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 20:10:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-09-15 20:10:59,211 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 2 [2024-09-15 20:10:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:59,211 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-09-15 20:10:59,212 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-09-15 20:10:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-15 20:10:59,213 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:59,213 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-15 20:10:59,213 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 20:10:59,214 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:10:59,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,215 INFO L85 PathProgramCache]: Analyzing trace with hash 3371606, now seen corresponding path program 1 times [2024-09-15 20:10:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88169691] [2024-09-15 20:10:59,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,343 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-15 20:10:59,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88169691] [2024-09-15 20:10:59,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88169691] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:59,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:59,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:10:59,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971220020] [2024-09-15 20:10:59,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,349 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:59,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:59,352 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-15 20:10:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:59,404 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-09-15 20:10:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:59,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-09-15 20:10:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:59,406 INFO L225 Difference]: With dead ends: 35 [2024-09-15 20:10:59,406 INFO L226 Difference]: Without dead ends: 35 [2024-09-15 20:10:59,406 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:59,407 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:59,408 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-15 20:10:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-15 20:10:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 20:10:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-09-15 20:10:59,417 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 4 [2024-09-15 20:10:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:59,417 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-09-15 20:10:59,418 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-15 20:10:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-09-15 20:10:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-15 20:10:59,418 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:59,421 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-15 20:10:59,421 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 20:10:59,421 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:10:59,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1054852199, now seen corresponding path program 1 times [2024-09-15 20:10:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389985913] [2024-09-15 20:10:59,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,542 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-15 20:10:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389985913] [2024-09-15 20:10:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389985913] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:59,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:59,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:59,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837830844] [2024-09-15 20:10:59,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,545 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:59,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:59,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:59,547 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:59,616 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-09-15 20:10:59,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:59,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-09-15 20:10:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:59,617 INFO L225 Difference]: With dead ends: 35 [2024-09-15 20:10:59,618 INFO L226 Difference]: Without dead ends: 35 [2024-09-15 20:10:59,618 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:59,619 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:59,619 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-15 20:10:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-09-15 20:10:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 20:10:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-15 20:10:59,628 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 6 [2024-09-15 20:10:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:59,629 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-15 20:10:59,629 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-15 20:10:59,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-15 20:10:59,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:59,630 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:59,630 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 20:10:59,630 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:10:59,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1175088790, now seen corresponding path program 1 times [2024-09-15 20:10:59,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430558050] [2024-09-15 20:10:59,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,678 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-15 20:10:59,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430558050] [2024-09-15 20:10:59,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430558050] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:59,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:59,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162616843] [2024-09-15 20:10:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,680 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:10:59,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:10:59,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:59,681 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-15 20:10:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:59,689 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-09-15 20:10:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:10:59,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-09-15 20:10:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:59,691 INFO L225 Difference]: With dead ends: 32 [2024-09-15 20:10:59,691 INFO L226 Difference]: Without dead ends: 32 [2024-09-15 20:10:59,691 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-15 20:10:59,692 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 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-15 20:10:59,693 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-15 20:10:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-15 20:10:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 20:10:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-15 20:10:59,698 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 9 [2024-09-15 20:10:59,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:59,698 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-15 20:10:59,698 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-15 20:10:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-15 20:10:59,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-15 20:10:59,699 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:59,699 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:59,699 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 20:10:59,699 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:10:59,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1175088951, now seen corresponding path program 1 times [2024-09-15 20:10:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880988917] [2024-09-15 20:10:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,730 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-15 20:10:59,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880988917] [2024-09-15 20:10:59,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880988917] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:59,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:59,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:10:59,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783128409] [2024-09-15 20:10:59,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,732 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:10:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:10:59,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:59,733 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 20:10:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:59,781 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-09-15 20:10:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:10:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-09-15 20:10:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:59,783 INFO L225 Difference]: With dead ends: 31 [2024-09-15 20:10:59,783 INFO L226 Difference]: Without dead ends: 31 [2024-09-15 20:10:59,784 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-15 20:10:59,785 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:59,785 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-15 20:10:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-15 20:10:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 20:10:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-09-15 20:10:59,794 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 9 [2024-09-15 20:10:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:59,794 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-09-15 20:10:59,797 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 20:10:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-09-15 20:10:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-15 20:10:59,798 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:59,798 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:59,798 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 20:10:59,798 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:10:59,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash -315915824, now seen corresponding path program 1 times [2024-09-15 20:10:59,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110721931] [2024-09-15 20:10:59,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:10:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,935 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-15 20:10:59,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110721931] [2024-09-15 20:10:59,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110721931] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:59,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:59,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101559771] [2024-09-15 20:10:59,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,941 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:59,942 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-15 20:11:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:00,028 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-09-15 20:11:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-09-15 20:11:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:00,030 INFO L225 Difference]: With dead ends: 30 [2024-09-15 20:11:00,030 INFO L226 Difference]: Without dead ends: 30 [2024-09-15 20:11:00,031 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:00,032 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:00,035 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:11:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-15 20:11:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-09-15 20:11:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 20:11:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-09-15 20:11:00,039 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2024-09-15 20:11:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:00,040 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-09-15 20:11:00,040 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-15 20:11:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-09-15 20:11:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 20:11:00,045 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:00,045 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:00,045 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 20:11:00,046 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:11:00,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1628866105, now seen corresponding path program 1 times [2024-09-15 20:11:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:00,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857356926] [2024-09-15 20:11:00,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:11:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-15 20:11:00,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:00,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857356926] [2024-09-15 20:11:00,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857356926] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:00,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:00,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:11:00,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033687674] [2024-09-15 20:11:00,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:00,139 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:00,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:00,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:00,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:00,140 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:11:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:00,197 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2024-09-15 20:11:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:00,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-15 20:11:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:00,198 INFO L225 Difference]: With dead ends: 41 [2024-09-15 20:11:00,198 INFO L226 Difference]: Without dead ends: 41 [2024-09-15 20:11:00,198 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:00,199 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:00,200 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:11:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-15 20:11:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-09-15 20:11:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-15 20:11:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2024-09-15 20:11:00,208 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 16 [2024-09-15 20:11:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:00,208 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2024-09-15 20:11:00,208 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:11:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2024-09-15 20:11:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-15 20:11:00,210 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:00,210 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:00,210 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 20:11:00,210 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:11:00,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:00,211 INFO L85 PathProgramCache]: Analyzing trace with hash 781900720, now seen corresponding path program 1 times [2024-09-15 20:11:00,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:00,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084138965] [2024-09-15 20:11:00,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:00,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:11:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:11:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 20:11:00,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:00,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084138965] [2024-09-15 20:11:00,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084138965] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:00,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:00,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:00,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467827956] [2024-09-15 20:11:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:00,292 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:11:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:11:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:11:00,293 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:11:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:00,336 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2024-09-15 20:11:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:11:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-15 20:11:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:00,339 INFO L225 Difference]: With dead ends: 51 [2024-09-15 20:11:00,339 INFO L226 Difference]: Without dead ends: 51 [2024-09-15 20:11:00,339 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-15 20:11:00,340 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:00,344 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:11:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-15 20:11:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-15 20:11:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-15 20:11:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 81 transitions. [2024-09-15 20:11:00,355 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 81 transitions. Word has length 21 [2024-09-15 20:11:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:00,355 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 81 transitions. [2024-09-15 20:11:00,364 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:11:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 81 transitions. [2024-09-15 20:11:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-15 20:11:00,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:00,367 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:00,368 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-15 20:11:00,368 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:11:00,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 177494214, now seen corresponding path program 1 times [2024-09-15 20:11:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:00,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641305811] [2024-09-15 20:11:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:11:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:11:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-15 20:11:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-15 20:11:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641305811] [2024-09-15 20:11:00,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641305811] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:11:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718628702] [2024-09-15 20:11:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:00,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:00,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:11:00,523 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-15 20:11:00,525 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-15 20:11:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-15 20:11:00,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:11:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-15 20:11:00,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:11:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-15 20:11:00,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718628702] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:11:00,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:11:00,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-15 20:11:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681554512] [2024-09-15 20:11:00,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:11:00,852 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 20:11:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:00,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 20:11:00,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-15 20:11:00,853 INFO L87 Difference]: Start difference. First operand 51 states and 81 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-15 20:11:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:00,986 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2024-09-15 20:11:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 20:11:00,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 26 [2024-09-15 20:11:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:00,988 INFO L225 Difference]: With dead ends: 59 [2024-09-15 20:11:00,988 INFO L226 Difference]: Without dead ends: 59 [2024-09-15 20:11:00,989 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-09-15 20:11:00,991 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:00,991 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:11:00,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-15 20:11:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-09-15 20:11:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-09-15 20:11:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 90 transitions. [2024-09-15 20:11:01,002 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 90 transitions. Word has length 26 [2024-09-15 20:11:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:01,003 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 90 transitions. [2024-09-15 20:11:01,003 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-15 20:11:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 90 transitions. [2024-09-15 20:11:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-15 20:11:01,005 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:01,006 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:01,019 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 20:11:01,206 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:01,207 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:11:01,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1814981713, now seen corresponding path program 1 times [2024-09-15 20:11:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:01,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302488744] [2024-09-15 20:11:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:01,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:11:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:11:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-15 20:11:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,339 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-15 20:11:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-15 20:11:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,346 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-15 20:11:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,350 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-15 20:11:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-15 20:11:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-15 20:11:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-15 20:11:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-15 20:11:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-15 20:11:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-15 20:11:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-15 20:11:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-15 20:11:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-15 20:11:01,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:01,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302488744] [2024-09-15 20:11:01,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302488744] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:11:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243119242] [2024-09-15 20:11:01,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:01,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:01,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:11:01,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:11:01,422 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-15 20:11:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-15 20:11:01,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:11:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 193 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-09-15 20:11:01,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:11:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-15 20:11:01,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243119242] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:11:01,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:11:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-09-15 20:11:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362269441] [2024-09-15 20:11:01,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:11:01,677 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 20:11:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:01,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 20:11:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:11:01,678 INFO L87 Difference]: Start difference. First operand 58 states and 90 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-09-15 20:11:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:01,730 INFO L93 Difference]: Finished difference Result 76 states and 124 transitions. [2024-09-15 20:11:01,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 20:11:01,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 93 [2024-09-15 20:11:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:01,732 INFO L225 Difference]: With dead ends: 76 [2024-09-15 20:11:01,732 INFO L226 Difference]: Without dead ends: 76 [2024-09-15 20:11:01,732 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:11:01,733 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:01,733 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:11:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-15 20:11:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-09-15 20:11:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-15 20:11:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 124 transitions. [2024-09-15 20:11:01,744 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 124 transitions. Word has length 93 [2024-09-15 20:11:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:01,745 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 124 transitions. [2024-09-15 20:11:01,746 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-09-15 20:11:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 124 transitions. [2024-09-15 20:11:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-15 20:11:01,752 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:01,753 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:01,766 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-15 20:11:01,954 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-15 20:11:01,955 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:11:01,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash -743486657, now seen corresponding path program 2 times [2024-09-15 20:11:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:01,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997933177] [2024-09-15 20:11:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:01,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:11:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:11:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-15 20:11:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-15 20:11:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-15 20:11:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-15 20:11:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-15 20:11:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-15 20:11:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-15 20:11:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-15 20:11:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-15 20:11:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-15 20:11:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-15 20:11:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-15 20:11:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-15 20:11:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-15 20:11:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-15 20:11:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-15 20:11:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-15 20:11:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-09-15 20:11:02,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:02,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997933177] [2024-09-15 20:11:02,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997933177] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:11:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766651406] [2024-09-15 20:11:02,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 20:11:02,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:02,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:11:02,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:11:02,322 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-15 20:11:02,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 20:11:02,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 20:11:02,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-15 20:11:02,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:11:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-09-15 20:11:02,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:11:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-09-15 20:11:03,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766651406] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:11:03,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:11:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2024-09-15 20:11:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346154654] [2024-09-15 20:11:03,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:11:03,226 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-15 20:11:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-15 20:11:03,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-09-15 20:11:03,228 INFO L87 Difference]: Start difference. First operand 76 states and 124 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 15 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-09-15 20:11:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:03,713 INFO L93 Difference]: Finished difference Result 118 states and 200 transitions. [2024-09-15 20:11:03,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-15 20:11:03,714 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 15 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) Word has length 115 [2024-09-15 20:11:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:03,715 INFO L225 Difference]: With dead ends: 118 [2024-09-15 20:11:03,715 INFO L226 Difference]: Without dead ends: 118 [2024-09-15 20:11:03,716 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2024-09-15 20:11:03,717 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:03,717 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 196 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:11:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-09-15 20:11:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2024-09-15 20:11:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-09-15 20:11:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2024-09-15 20:11:03,731 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 153 transitions. Word has length 115 [2024-09-15 20:11:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:03,732 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-09-15 20:11:03,732 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 15 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-09-15 20:11:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 153 transitions. [2024-09-15 20:11:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-09-15 20:11:03,734 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:03,734 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:03,752 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-15 20:11:03,938 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-15 20:11:03,938 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:11:03,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1526104862, now seen corresponding path program 1 times [2024-09-15 20:11:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:03,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275533420] [2024-09-15 20:11:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,012 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:11:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:11:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-15 20:11:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-15 20:11:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-15 20:11:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-15 20:11:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-15 20:11:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-15 20:11:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,025 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-15 20:11:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-15 20:11:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-15 20:11:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-15 20:11:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-15 20:11:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-15 20:11:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-15 20:11:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-15 20:11:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,038 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-15 20:11:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-15 20:11:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-15 20:11:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-09-15 20:11:04,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275533420] [2024-09-15 20:11:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275533420] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:04,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:04,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189301982] [2024-09-15 20:11:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:04,044 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:11:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:04,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:11:04,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:11:04,045 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-15 20:11:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:04,077 INFO L93 Difference]: Finished difference Result 95 states and 151 transitions. [2024-09-15 20:11:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:11:04,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 117 [2024-09-15 20:11:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:04,078 INFO L225 Difference]: With dead ends: 95 [2024-09-15 20:11:04,078 INFO L226 Difference]: Without dead ends: 95 [2024-09-15 20:11:04,079 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-15 20:11:04,079 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:04,079 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:11:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-15 20:11:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-09-15 20:11:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-09-15 20:11:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 151 transitions. [2024-09-15 20:11:04,086 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 151 transitions. Word has length 117 [2024-09-15 20:11:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:04,087 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 151 transitions. [2024-09-15 20:11:04,087 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-15 20:11:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 151 transitions. [2024-09-15 20:11:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-09-15 20:11:04,089 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:04,089 INFO L216 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:04,089 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-15 20:11:04,089 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:11:04,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1309061714, now seen corresponding path program 2 times [2024-09-15 20:11:04,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938856893] [2024-09-15 20:11:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:11:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:11:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-15 20:11:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-15 20:11:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-15 20:11:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,385 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-15 20:11:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-15 20:11:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-15 20:11:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-15 20:11:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-15 20:11:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-15 20:11:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-15 20:11:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-15 20:11:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-15 20:11:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-15 20:11:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-15 20:11:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-15 20:11:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-15 20:11:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-15 20:11:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-15 20:11:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,422 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-09-15 20:11:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-09-15 20:11:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-09-15 20:11:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-09-15 20:11:04,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938856893] [2024-09-15 20:11:04,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938856893] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:11:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971323818] [2024-09-15 20:11:04,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 20:11:04,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:04,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:11:04,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:11:04,436 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-15 20:11:04,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 20:11:04,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 20:11:04,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-15 20:11:04,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:11:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-09-15 20:11:04,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:11:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1148 trivial. 0 not checked. [2024-09-15 20:11:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971323818] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:11:05,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:11:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 6] total 20 [2024-09-15 20:11:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568515571] [2024-09-15 20:11:05,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:11:05,051 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-15 20:11:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-15 20:11:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-09-15 20:11:05,052 INFO L87 Difference]: Start difference. First operand 95 states and 151 transitions. Second operand has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 12 states have call predecessors, (56), 12 states have call successors, (56) [2024-09-15 20:11:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:05,434 INFO L93 Difference]: Finished difference Result 140 states and 225 transitions. [2024-09-15 20:11:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-15 20:11:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 12 states have call predecessors, (56), 12 states have call successors, (56) Word has length 139 [2024-09-15 20:11:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:05,437 INFO L225 Difference]: With dead ends: 140 [2024-09-15 20:11:05,437 INFO L226 Difference]: Without dead ends: 140 [2024-09-15 20:11:05,438 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2024-09-15 20:11:05,439 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:05,439 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 275 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:11:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-15 20:11:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-09-15 20:11:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-09-15 20:11:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 224 transitions. [2024-09-15 20:11:05,461 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 224 transitions. Word has length 139 [2024-09-15 20:11:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:05,462 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 224 transitions. [2024-09-15 20:11:05,462 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 12 states have call predecessors, (56), 12 states have call successors, (56) [2024-09-15 20:11:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 224 transitions. [2024-09-15 20:11:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-09-15 20:11:05,473 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:05,474 INFO L216 NwaCegarLoop]: trace histogram [64, 64, 64, 16, 13, 13, 13, 13, 13, 13, 13, 13, 13, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2024-09-15 20:11:05,492 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-15 20:11:05,677 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:05,678 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:11:05,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash 362318034, now seen corresponding path program 3 times [2024-09-15 20:11:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:05,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211944551] [2024-09-15 20:11:05,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:05,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:11:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,717 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:11:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-15 20:11:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-15 20:11:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-15 20:11:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-15 20:11:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-15 20:11:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-15 20:11:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-15 20:11:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-15 20:11:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,743 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-15 20:11:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-15 20:11:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-15 20:11:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-15 20:11:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-15 20:11:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-15 20:11:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-15 20:11:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-15 20:11:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-15 20:11:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-15 20:11:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-09-15 20:11:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,775 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-09-15 20:11:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-09-15 20:11:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-09-15 20:11:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-09-15 20:11:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-09-15 20:11:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-09-15 20:11:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-09-15 20:11:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-09-15 20:11:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-09-15 20:11:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-09-15 20:11:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-09-15 20:11:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-09-15 20:11:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-09-15 20:11:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-09-15 20:11:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-09-15 20:11:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-09-15 20:11:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-09-15 20:11:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-09-15 20:11:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-09-15 20:11:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-09-15 20:11:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-09-15 20:11:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-09-15 20:11:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-09-15 20:11:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-09-15 20:11:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-09-15 20:11:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-09-15 20:11:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-09-15 20:11:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-09-15 20:11:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-09-15 20:11:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-09-15 20:11:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-09-15 20:11:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-09-15 20:11:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-09-15 20:11:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-09-15 20:11:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-09-15 20:11:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-09-15 20:11:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-09-15 20:11:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-09-15 20:11:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-09-15 20:11:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-09-15 20:11:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-09-15 20:11:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-09-15 20:11:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8659 backedges. 24 proven. 520 refuted. 0 times theorem prover too weak. 8115 trivial. 0 not checked. [2024-09-15 20:11:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:06,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211944551] [2024-09-15 20:11:06,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211944551] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:11:06,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518278889] [2024-09-15 20:11:06,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-15 20:11:06,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:06,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:11:06,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:11:06,907 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-15 20:11:06,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-15 20:11:06,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 20:11:06,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-15 20:11:06,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:11:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8659 backedges. 96 proven. 1 refuted. 0 times theorem prover too weak. 8562 trivial. 0 not checked. [2024-09-15 20:11:07,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:11:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8659 backedges. 96 proven. 1 refuted. 0 times theorem prover too weak. 8562 trivial. 0 not checked. [2024-09-15 20:11:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518278889] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:11:07,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:11:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 21 [2024-09-15 20:11:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321736421] [2024-09-15 20:11:07,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:11:07,424 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-15 20:11:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:07,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-15 20:11:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-09-15 20:11:07,426 INFO L87 Difference]: Start difference. First operand 139 states and 224 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 13 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) [2024-09-15 20:11:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:08,328 INFO L93 Difference]: Finished difference Result 159 states and 251 transitions. [2024-09-15 20:11:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-15 20:11:08,329 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 13 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) Word has length 365 [2024-09-15 20:11:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:08,330 INFO L225 Difference]: With dead ends: 159 [2024-09-15 20:11:08,330 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 20:11:08,331 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 859 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2024-09-15 20:11:08,331 INFO L434 NwaCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:08,331 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1054 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-15 20:11:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 20:11:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 20:11:08,332 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-15 20:11:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 20:11:08,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 365 [2024-09-15 20:11:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:08,332 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 20:11:08,333 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 13 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) [2024-09-15 20:11:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 20:11:08,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 20:11:08,335 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-15 20:11:08,335 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 12 remaining) [2024-09-15 20:11:08,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-15 20:11:08,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-15 20:11:08,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (7 of 12 remaining) [2024-09-15 20:11:08,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-15 20:11:08,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-15 20:11:08,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-15 20:11:08,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-15 20:11:08,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION (2 of 12 remaining) [2024-09-15 20:11:08,337 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-15 20:11:08,337 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-15 20:11:08,354 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-15 20:11:08,544 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-15 20:11:08,547 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:08,549 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 20:11:08,550 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-15 20:11:08,550 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-15 20:11:08,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:11:08 BoogieIcfgContainer [2024-09-15 20:11:08,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 20:11:08,551 INFO L158 Benchmark]: Toolchain (without parser) took 10626.68ms. Allocated memory was 77.6MB in the beginning and 207.6MB in the end (delta: 130.0MB). Free memory was 53.8MB in the beginning and 81.0MB in the end (delta: -27.2MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2024-09-15 20:11:08,551 INFO L158 Benchmark]: Witness Parser took 0.22ms. Allocated memory is still 54.5MB. Free memory is still 27.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:11:08,552 INFO L158 Benchmark]: CDTParser took 1.85ms. Allocated memory is still 77.6MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:11:08,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.44ms. Allocated memory is still 77.6MB. Free memory was 53.6MB in the beginning and 40.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-15 20:11:08,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.50ms. Allocated memory is still 77.6MB. Free memory was 40.4MB in the beginning and 38.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:11:08,552 INFO L158 Benchmark]: Boogie Preprocessor took 48.44ms. Allocated memory is still 77.6MB. Free memory was 38.9MB in the beginning and 37.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:11:08,552 INFO L158 Benchmark]: RCFGBuilder took 381.85ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 37.2MB in the beginning and 62.5MB in the end (delta: -25.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-15 20:11:08,553 INFO L158 Benchmark]: TraceAbstraction took 9823.37ms. Allocated memory was 94.4MB in the beginning and 207.6MB in the end (delta: 113.2MB). Free memory was 61.6MB in the beginning and 81.0MB in the end (delta: -19.3MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2024-09-15 20:11:08,554 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 54.5MB. Free memory is still 27.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 1.85ms. Allocated memory is still 77.6MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.44ms. Allocated memory is still 77.6MB. Free memory was 53.6MB in the beginning and 40.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.50ms. Allocated memory is still 77.6MB. Free memory was 40.4MB in the beginning and 38.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.44ms. Allocated memory is still 77.6MB. Free memory was 38.9MB in the beginning and 37.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 381.85ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 37.2MB in the beginning and 62.5MB in the end (delta: -25.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9823.37ms. Allocated memory was 94.4MB in the beginning and 207.6MB in the end (delta: 113.2MB). Free memory was 61.6MB in the beginning and 81.0MB in the end (delta: -19.3MB). Peak memory consumption was 93.0MB. 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: 16]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 18]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 13]: 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, 33 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 14, TraceHistogramMax: 64, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 2080 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1576 mSDsCounter, 409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2394 IncrementalHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 409 mSolverCounterUnsat, 504 mSDtfsCounter, 2394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1884 GetRequests, 1755 SyntacticMatches, 5 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=13, InterpolantAutomatonStates: 116, 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, 14 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1671 NumberOfCodeBlocks, 1327 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 898 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 33441/34355 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-15 20:11:08,579 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