./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/prodbin-ll_valuebound2.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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/nla-digbench-scaling/prodbin-ll_valuebound2.c ../results/automizer-verification-files/SV-COMP24_unreach-call/prodbin-ll_valuebound2.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 06:21:45,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 06:21:45,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 06:21:45,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 06:21:45,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 06:21:45,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 06:21:45,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 06:21:45,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 06:21:45,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 06:21:45,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 06:21:45,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 06:21:45,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 06:21:45,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 06:21:45,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 06:21:45,853 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 06:21:45,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 06:21:45,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 06:21:45,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 06:21:45,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 06:21:45,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 06:21:45,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 06:21:45,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 06:21:45,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 06:21:45,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 06:21:45,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 06:21:45,858 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 06:21:45,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 06:21:45,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 06:21:45,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 06:21:45,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 06:21:45,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 06:21:45,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 06:21:45,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 06:21:45,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 06:21:45,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 06:21:45,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 06:21:45,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 06:21:45,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 06:21:45,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 06:21:45,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 06:21:45,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 06:21:45,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 06:21:45,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 06:21:46,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 06:21:46,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 06:21:46,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 06:21:46,150 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 06:21:46,150 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 06:21:46,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/prodbin-ll_valuebound2.yml/witness-2.1.yml [2024-09-13 06:21:46,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 06:21:46,213 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 06:21:46,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c [2024-09-13 06:21:47,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 06:21:47,880 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 06:21:47,881 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c [2024-09-13 06:21:47,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/9d2fbe179/2692f98066b746c1a0f78d23055470cb/FLAGe10522520 [2024-09-13 06:21:48,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/9d2fbe179/2692f98066b746c1a0f78d23055470cb [2024-09-13 06:21:48,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 06:21:48,281 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 06:21:48,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 06:21:48,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 06:21:48,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 06:21:48,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 06:21:46" (1/2) ... [2024-09-13 06:21:48,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d596e6 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 06:21:48, skipping insertion in model container [2024-09-13 06:21:48,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 06:21:46" (1/2) ... [2024-09-13 06:21:48,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7883d1e5 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 06:21:48, skipping insertion in model container [2024-09-13 06:21:48,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 06:21:48" (2/2) ... [2024-09-13 06:21:48,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d596e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48, skipping insertion in model container [2024-09-13 06:21:48,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 06:21:48" (2/2) ... [2024-09-13 06:21:48,297 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 06:21:48,298 INFO L1541 ArrayList]: Loop invariant at [L34-L45] ((((((z == ((long long) b * a)) && (b <= 2)) && (1 <= b)) && (y == 0)) || (((((z == 0) && (y <= 2)) && (b == y)) && (1 <= y)) && (a == x))) || (((((z == 0) && (y == 1)) && (((long long) a * 2) == x)) && ((b / 2) == 1)) && ((b % 2) != 1))) [2024-09-13 06:21:48,298 INFO L1541 ArrayList]: Function contract at [L9]: requires null, ensures (\old(cond) != 0) [2024-09-13 06:21:48,298 INFO L1541 ArrayList]: Function contract at [L12]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 06:21:48,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 06:21:48,463 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c[537,550] [2024-09-13 06:21:48,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 06:21:48,490 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 06:21:48,528 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c[537,550] Start Parsing Local [2024-09-13 06:21:48,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 06:21:48,569 INFO L204 MainTranslator]: Completed translation [2024-09-13 06:21:48,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48 WrapperNode [2024-09-13 06:21:48,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 06:21:48,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 06:21:48,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 06:21:48,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 06:21:48,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,612 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2024-09-13 06:21:48,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 06:21:48,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 06:21:48,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 06:21:48,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 06:21:48,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,640 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 06:21:48,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 06:21:48,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 06:21:48,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 06:21:48,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 06:21:48,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (1/1) ... [2024-09-13 06:21:48,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 06:21:48,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 06:21:48,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 06:21:48,693 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 06:21:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 06:21:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 06:21:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 06:21:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 06:21:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 06:21:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 06:21:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 06:21:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 06:21:48,789 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 06:21:48,791 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 06:21:48,933 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 06:21:48,952 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-13 06:21:48,952 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 06:21:48,980 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 06:21:48,980 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 06:21:48,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 06:21:48 BoogieIcfgContainer [2024-09-13 06:21:48,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 06:21:48,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 06:21:48,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 06:21:48,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 06:21:48,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 06:21:46" (1/4) ... [2024-09-13 06:21:48,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfb9ae2 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 06:21:48, skipping insertion in model container [2024-09-13 06:21:48,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 06:21:48" (2/4) ... [2024-09-13 06:21:48,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfb9ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 06:21:48, skipping insertion in model container [2024-09-13 06:21:48,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:48" (3/4) ... [2024-09-13 06:21:48,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfb9ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 06:21:48, skipping insertion in model container [2024-09-13 06:21:48,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 06:21:48" (4/4) ... [2024-09-13 06:21:48,995 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound2.c [2024-09-13 06:21:49,014 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 06:21:49,015 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-09-13 06:21:49,075 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 06:21:49,086 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;@27a6cdee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 06:21:49,087 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-13 06:21:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 22 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 06:21:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 06:21:49,098 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:49,098 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 06:21:49,099 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:49,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash 99841657, now seen corresponding path program 1 times [2024-09-13 06:21:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:49,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952593617] [2024-09-13 06:21:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:49,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 06:21:49,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:49,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952593617] [2024-09-13 06:21:49,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952593617] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:49,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:49,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 06:21:49,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53043279] [2024-09-13 06:21:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:49,291 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 06:21:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:49,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 06:21:49,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 06:21:49,325 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 22 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:21:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:49,358 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-09-13 06:21:49,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 06:21:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 5 [2024-09-13 06:21:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:49,367 INFO L225 Difference]: With dead ends: 30 [2024-09-13 06:21:49,367 INFO L226 Difference]: Without dead ends: 28 [2024-09-13 06:21:49,370 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 06:21:49,373 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:49,375 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-13 06:21:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-13 06:21:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 06:21:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-13 06:21:49,408 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 5 [2024-09-13 06:21:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:49,408 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-13 06:21:49,408 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:21:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-13 06:21:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 06:21:49,409 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:49,410 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 06:21:49,410 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 06:21:49,410 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:49,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash 99841719, now seen corresponding path program 1 times [2024-09-13 06:21:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:49,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340547649] [2024-09-13 06:21:49,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 06:21:49,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340547649] [2024-09-13 06:21:49,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340547649] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:49,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:49,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 06:21:49,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432445944] [2024-09-13 06:21:49,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:49,511 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 06:21:49,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:49,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 06:21:49,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 06:21:49,512 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:21:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:49,548 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-13 06:21:49,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 06:21:49,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 5 [2024-09-13 06:21:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:49,550 INFO L225 Difference]: With dead ends: 27 [2024-09-13 06:21:49,550 INFO L226 Difference]: Without dead ends: 27 [2024-09-13 06:21:49,550 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 06:21:49,551 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:49,552 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-13 06:21:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-13 06:21:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 06:21:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-13 06:21:49,560 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2024-09-13 06:21:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:49,561 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-13 06:21:49,561 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:21:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-13 06:21:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 06:21:49,562 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:49,562 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:49,562 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 06:21:49,567 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:49,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1683842591, now seen corresponding path program 1 times [2024-09-13 06:21:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808479526] [2024-09-13 06:21:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:21:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:21:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:21:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 06:21:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808479526] [2024-09-13 06:21:50,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808479526] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:50,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:50,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 06:21:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840048913] [2024-09-13 06:21:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:50,124 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 06:21:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 06:21:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-13 06:21:50,126 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 06:21:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:50,251 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-09-13 06:21:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 06:21:50,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-09-13 06:21:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:50,254 INFO L225 Difference]: With dead ends: 33 [2024-09-13 06:21:50,254 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 06:21:50,255 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-13 06:21:50,256 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:50,258 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 52 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 06:21:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 06:21:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-13 06:21:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 06:21:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-09-13 06:21:50,267 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 19 [2024-09-13 06:21:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:50,268 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-09-13 06:21:50,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 06:21:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-09-13 06:21:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 06:21:50,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:50,270 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:50,270 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 06:21:50,270 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:50,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash 332140251, now seen corresponding path program 1 times [2024-09-13 06:21:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:50,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268584746] [2024-09-13 06:21:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:21:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:21:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:21:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,387 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-13 06:21:50,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:50,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268584746] [2024-09-13 06:21:50,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268584746] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:50,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:50,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 06:21:50,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096807686] [2024-09-13 06:21:50,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:50,390 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 06:21:50,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 06:21:50,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:21:50,391 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 06:21:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:50,401 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-13 06:21:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 06:21:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 06:21:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:50,405 INFO L225 Difference]: With dead ends: 29 [2024-09-13 06:21:50,405 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 06:21:50,405 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:21:50,406 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:50,406 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 06:21:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-13 06:21:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 06:21:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-09-13 06:21:50,417 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 24 [2024-09-13 06:21:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:50,418 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-09-13 06:21:50,419 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 06:21:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-09-13 06:21:50,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 06:21:50,420 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:50,421 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:50,421 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 06:21:50,421 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:50,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash 332140412, now seen corresponding path program 1 times [2024-09-13 06:21:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:50,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919195587] [2024-09-13 06:21:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:21:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:21:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:21:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,473 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-13 06:21:50,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:50,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919195587] [2024-09-13 06:21:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919195587] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:50,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:50,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 06:21:50,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449534823] [2024-09-13 06:21:50,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:50,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 06:21:50,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:50,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 06:21:50,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:21:50,480 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 06:21:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:50,496 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-09-13 06:21:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 06:21:50,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 06:21:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:50,498 INFO L225 Difference]: With dead ends: 28 [2024-09-13 06:21:50,498 INFO L226 Difference]: Without dead ends: 28 [2024-09-13 06:21:50,498 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:21:50,499 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:50,500 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-13 06:21:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-13 06:21:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 06:21:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-13 06:21:50,507 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2024-09-13 06:21:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:50,507 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-13 06:21:50,507 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 06:21:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-13 06:21:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 06:21:50,508 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:50,508 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:50,509 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 06:21:50,509 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:50,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash -633490312, now seen corresponding path program 1 times [2024-09-13 06:21:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:50,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276104446] [2024-09-13 06:21:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:50,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 06:21:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482115753] [2024-09-13 06:21:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:50,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 06:21:50,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 06:21:50,559 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 06:21:50,561 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 06:21:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:50,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-13 06:21:50,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 06:21:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 06:21:50,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 06:21:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 06:21:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276104446] [2024-09-13 06:21:51,590 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 06:21:51,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482115753] [2024-09-13 06:21:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482115753] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 06:21:51,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 06:21:51,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-09-13 06:21:51,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979852899] [2024-09-13 06:21:51,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:51,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 06:21:51,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:51,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 06:21:51,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-13 06:21:51,593 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 06:21:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:51,693 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-09-13 06:21:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 06:21:51,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-13 06:21:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:51,695 INFO L225 Difference]: With dead ends: 34 [2024-09-13 06:21:51,695 INFO L226 Difference]: Without dead ends: 34 [2024-09-13 06:21:51,695 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-13 06:21:51,696 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:51,696 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 06:21:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-13 06:21:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-09-13 06:21:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 06:21:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-09-13 06:21:51,701 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 29 [2024-09-13 06:21:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:51,701 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-09-13 06:21:51,701 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 06:21:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-09-13 06:21:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 06:21:51,702 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:51,702 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:51,722 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 06:21:51,903 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 06:21:51,904 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:51,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash -633488390, now seen corresponding path program 1 times [2024-09-13 06:21:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:51,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265425092] [2024-09-13 06:21:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:21:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:21:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,048 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:21:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 06:21:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 06:21:54,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:54,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265425092] [2024-09-13 06:21:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265425092] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 06:21:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291963934] [2024-09-13 06:21:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:54,080 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 06:21:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:54,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 06:21:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-13 06:21:54,081 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 06:21:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:54,210 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-13 06:21:54,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 06:21:54,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-13 06:21:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:54,212 INFO L225 Difference]: With dead ends: 33 [2024-09-13 06:21:54,213 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 06:21:54,213 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-13 06:21:54,214 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:54,214 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 06:21:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 06:21:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-13 06:21:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 06:21:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-13 06:21:54,223 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2024-09-13 06:21:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:54,224 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-13 06:21:54,224 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 06:21:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-13 06:21:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 06:21:54,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:54,227 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:54,227 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 06:21:54,227 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:54,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash -885297805, now seen corresponding path program 1 times [2024-09-13 06:21:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:54,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222973014] [2024-09-13 06:21:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:21:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:21:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:21:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 06:21:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 06:21:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-13 06:21:54,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222973014] [2024-09-13 06:21:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222973014] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:54,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 06:21:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157425367] [2024-09-13 06:21:54,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:54,365 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 06:21:54,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 06:21:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 06:21:54,367 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 06:21:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:54,401 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-13 06:21:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 06:21:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-09-13 06:21:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:54,402 INFO L225 Difference]: With dead ends: 31 [2024-09-13 06:21:54,402 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 06:21:54,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 06:21:54,403 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:54,403 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:54,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 06:21:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 06:21:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:21:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 06:21:54,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2024-09-13 06:21:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:54,407 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 06:21:54,407 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 06:21:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 06:21:54,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 06:21:54,409 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-09-13 06:21:54,409 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (4 of 6 remaining) [2024-09-13 06:21:54,410 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (3 of 6 remaining) [2024-09-13 06:21:54,410 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 6 remaining) [2024-09-13 06:21:54,410 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-09-13 06:21:54,410 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 6 remaining) [2024-09-13 06:21:54,413 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 06:21:54,416 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:54,418 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 06:21:54,420 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-13 06:21:54,421 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-13 06:21:54,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 06:21:54 BoogieIcfgContainer [2024-09-13 06:21:54,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 06:21:54,423 INFO L158 Benchmark]: Toolchain (without parser) took 6141.96ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 113.9MB in the beginning and 106.7MB in the end (delta: 7.2MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-09-13 06:21:54,423 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 174.1MB. Free memory was 139.2MB in the beginning and 138.9MB in the end (delta: 318.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 06:21:54,423 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 06:21:54,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.23ms. Allocated memory is still 174.1MB. Free memory was 113.4MB in the beginning and 100.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 06:21:54,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.39ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 98.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 06:21:54,424 INFO L158 Benchmark]: Boogie Preprocessor took 39.45ms. Allocated memory is still 174.1MB. Free memory was 98.2MB in the beginning and 96.6MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 06:21:54,424 INFO L158 Benchmark]: RCFGBuilder took 325.74ms. Allocated memory is still 174.1MB. Free memory was 96.6MB in the beginning and 83.2MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 06:21:54,424 INFO L158 Benchmark]: TraceAbstraction took 5438.36ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 82.4MB in the beginning and 106.7MB in the end (delta: -24.3MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2024-09-13 06:21:54,426 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.12ms. Allocated memory is still 174.1MB. Free memory was 139.2MB in the beginning and 138.9MB in the end (delta: 318.8kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.23ms. Allocated memory is still 174.1MB. Free memory was 113.4MB in the beginning and 100.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.39ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 98.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.45ms. Allocated memory is still 174.1MB. Free memory was 98.2MB in the beginning and 96.6MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 325.74ms. Allocated memory is still 174.1MB. Free memory was 96.6MB in the beginning and 83.2MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5438.36ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 82.4MB in the beginning and 106.7MB in the end (delta: -24.3MB). Peak memory consumption was 39.6MB. 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: 34]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 12]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 12]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 9]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 15]: 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: 12]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 178 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=6, InterpolantAutomatonStates: 36, 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, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 845 SizeOfPredicates, 4 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 94/95 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 06:21:54,450 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE