./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/geo1-ll_unwindbound2.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c ../results/automizer-verification-files/SV-COMP24_unreach-call/geo1-ll_unwindbound2.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:17:46,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:17:46,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:17:46,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:17:46,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:17:46,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:17:46,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:17:46,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:17:46,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:17:46,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:17:46,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:17:46,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:17:46,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:17:46,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:17:46,185 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:17:46,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:17:46,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:17:46,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:17:46,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:17:46,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:17:46,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:17:46,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:17:46,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:17:46,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:17:46,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:17:46,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:17:46,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:17:46,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:17:46,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:17:46,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:17:46,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:17:46,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:17:46,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:17:46,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:17:46,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:17:46,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:17:46,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:17:46,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:17:46,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:17:46,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:17:46,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:17:46,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:17:46,198 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 10:17:46,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:17:46,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:17:46,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:17:46,427 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:17:46,428 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:17:46,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/geo1-ll_unwindbound2.yml/witness-2.1.yml [2024-09-13 10:17:46,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:17:46,487 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:17:46,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2024-09-13 10:17:47,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:17:47,867 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:17:47,868 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2024-09-13 10:17:47,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/71553e467/b92c635f8a4b4cacb343c40387d77040/FLAG59c38fda0 [2024-09-13 10:17:48,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/71553e467/b92c635f8a4b4cacb343c40387d77040 [2024-09-13 10:17:48,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:17:48,287 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:17:48,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:17:48,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:17:48,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:17:48,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:17:46" (1/2) ... [2024-09-13 10:17:48,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688400e6 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:17:48, skipping insertion in model container [2024-09-13 10:17:48,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:17:46" (1/2) ... [2024-09-13 10:17:48,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b212980 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:17:48, skipping insertion in model container [2024-09-13 10:17:48,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:17:48" (2/2) ... [2024-09-13 10:17:48,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688400e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48, skipping insertion in model container [2024-09-13 10:17:48,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:17:48" (2/2) ... [2024-09-13 10:17:48,302 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:17:48,302 INFO L1541 ArrayList]: Loop invariant at [L35-L45] (((((((1 <= counter) && (1 <= z)) && (((long long) z * z) == y)) && (x == ((long long) z + 1))) || ((((2 <= counter) && (y == ((__int128) ((long long) z * z) * z))) && (1 <= z)) && (x == ((((long long) z * z) + z) + 1)))) || ((((z == y) && (x == 1)) && (counter == 0)) && (1 <= z))) && (\old(counter) == 0)) [2024-09-13 10:17:48,303 INFO L1541 ArrayList]: Function contract at [L23]: requires (counter == 0), ensures (\old(counter) == 0) [2024-09-13 10:17:48,303 INFO L1541 ArrayList]: Function contract at [L12]: requires (counter == 0), ensures ((\old(cond) != 0) && (counter == 0)) [2024-09-13 10:17:48,303 INFO L1541 ArrayList]: Function contract at [L15]: requires (\old(cond) == 1), ensures (\old(cond) == 1) [2024-09-13 10:17:48,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:17:48,430 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/geo1-ll_unwindbound2.c[546,559] [2024-09-13 10:17:48,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:17:48,464 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 10:17:48,495 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/geo1-ll_unwindbound2.c[546,559] Start Parsing Global Start Parsing Global Start Parsing Local [2024-09-13 10:17:48,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:17:48,520 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:17:48,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48 WrapperNode [2024-09-13 10:17:48,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:17:48,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:17:48,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:17:48,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:17:48,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,552 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-09-13 10:17:48,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:17:48,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:17:48,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:17:48,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:17:48,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,572 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 10:17:48,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:17:48,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:17:48,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:17:48,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:17:48,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (1/1) ... [2024-09-13 10:17:48,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:17:48,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:17:48,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 10:17:48,633 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 10:17:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:17:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 10:17:48,680 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 10:17:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:17:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:17:48,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:17:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 10:17:48,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 10:17:48,732 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:17:48,734 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:17:48,854 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:17:48,863 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:17:48,890 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-13 10:17:48,891 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:17:48,916 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:17:48,917 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 10:17:48,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:17:48 BoogieIcfgContainer [2024-09-13 10:17:48,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:17:48,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:17:48,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:17:48,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:17:48,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:17:46" (1/4) ... [2024-09-13 10:17:48,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e20358 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:17:48, skipping insertion in model container [2024-09-13 10:17:48,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:17:48" (2/4) ... [2024-09-13 10:17:48,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e20358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:17:48, skipping insertion in model container [2024-09-13 10:17:48,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:17:48" (3/4) ... [2024-09-13 10:17:48,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e20358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:17:48, skipping insertion in model container [2024-09-13 10:17:48,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:17:48" (4/4) ... [2024-09-13 10:17:48,930 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound2.c [2024-09-13 10:17:48,945 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:17:48,946 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-09-13 10:17:48,977 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:17:48,984 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;@41dc544c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:17:48,985 INFO L337 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-09-13 10:17:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 10:17:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-13 10:17:48,995 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:17:48,996 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-13 10:17:48,996 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:17:49,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:17:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash 3165, now seen corresponding path program 1 times [2024-09-13 10:17:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:17:49,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943172750] [2024-09-13 10:17:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:17:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:17:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:17:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:17:49,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:17:49,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943172750] [2024-09-13 10:17:49,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943172750] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:17:49,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:17:49,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-13 10:17:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946288640] [2024-09-13 10:17:49,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:17:49,179 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:17:49,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:17:49,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:17:49,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:17:49,208 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:17:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:17:49,263 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-09-13 10:17:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:17:49,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-09-13 10:17:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:17:49,270 INFO L225 Difference]: With dead ends: 34 [2024-09-13 10:17:49,271 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 10:17:49,272 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:17:49,275 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:17:49,277 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 42 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:17:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 10:17:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-09-13 10:17:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 10:17:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-13 10:17:49,373 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 2 [2024-09-13 10:17:49,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:17:49,374 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-13 10:17:49,374 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:17:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-13 10:17:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-13 10:17:49,377 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:17:49,378 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-13 10:17:49,378 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:17:49,379 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:17:49,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:17:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1369151349, now seen corresponding path program 1 times [2024-09-13 10:17:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:17:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304251030] [2024-09-13 10:17:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:17:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:17:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:17:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:17:49,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:17:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304251030] [2024-09-13 10:17:49,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304251030] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:17:49,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:17:49,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:17:49,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85445513] [2024-09-13 10:17:49,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:17:49,511 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:17:49,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:17:49,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:17:49,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:17:49,512 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:17:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:17:49,562 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-09-13 10:17:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:17:49,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 6 [2024-09-13 10:17:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:17:49,563 INFO L225 Difference]: With dead ends: 32 [2024-09-13 10:17:49,563 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 10:17:49,564 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:17:49,565 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:17:49,565 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:17:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 10:17:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-09-13 10:17:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 10:17:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-09-13 10:17:49,569 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 6 [2024-09-13 10:17:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:17:49,569 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-09-13 10:17:49,569 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:17:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-09-13 10:17:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 10:17:49,570 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:17:49,570 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:17:49,571 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:17:49,571 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:17:49,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:17:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1437512956, now seen corresponding path program 1 times [2024-09-13 10:17:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:17:49,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351231938] [2024-09-13 10:17:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:17:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:17:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:17:49,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:17:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:17:50,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:17:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:17:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 10:17:50,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:17:50,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351231938] [2024-09-13 10:17:50,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351231938] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:17:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741244740] [2024-09-13 10:17:50,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:17:50,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:17:50,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:17:50,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:17:50,068 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 10:17:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:17:50,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 10:17:50,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:17:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-13 10:17:50,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:18:06,508 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 10:18:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-13 10:18:14,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741244740] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:18:14,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:18:14,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-09-13 10:18:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913760938] [2024-09-13 10:18:14,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:18:14,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 10:18:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 10:18:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-09-13 10:18:14,685 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 10:18:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:14,895 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-09-13 10:18:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 10:18:14,896 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 14 [2024-09-13 10:18:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:14,896 INFO L225 Difference]: With dead ends: 31 [2024-09-13 10:18:14,896 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 10:18:14,897 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-09-13 10:18:14,899 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:14,900 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 95 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:18:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 10:18:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-09-13 10:18:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 10:18:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-13 10:18:14,903 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2024-09-13 10:18:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:14,904 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-13 10:18:14,904 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 10:18:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-13 10:18:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 10:18:14,905 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:14,905 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:14,918 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 10:18:15,109 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:15,110 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:18:15,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash 170482061, now seen corresponding path program 1 times [2024-09-13 10:18:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683167067] [2024-09-13 10:18:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:15,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:18:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1630817340] [2024-09-13 10:18:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:15,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:15,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:15,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:18:15,145 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 10:18:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 10:18:15,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:18:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:18:15,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:18:15,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683167067] [2024-09-13 10:18:15,224 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:18:15,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630817340] [2024-09-13 10:18:15,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630817340] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:15,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:15,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:18:15,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408230144] [2024-09-13 10:18:15,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:15,226 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:18:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:15,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:18:15,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:15,228 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:18:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:15,299 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-09-13 10:18:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:18:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-13 10:18:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:15,301 INFO L225 Difference]: With dead ends: 35 [2024-09-13 10:18:15,301 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 10:18:15,301 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:15,303 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:15,304 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:18:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 10:18:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-13 10:18:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 26 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 10:18:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-09-13 10:18:15,310 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 17 [2024-09-13 10:18:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:15,310 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-09-13 10:18:15,310 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:18:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-09-13 10:18:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 10:18:15,311 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:15,311 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:15,323 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 10:18:15,514 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:15,515 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:18:15,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:15,515 INFO L85 PathProgramCache]: Analyzing trace with hash 989974986, now seen corresponding path program 1 times [2024-09-13 10:18:15,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:15,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951449515] [2024-09-13 10:18:15,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:15,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:18:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:18:15,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:15,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951449515] [2024-09-13 10:18:15,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951449515] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:15,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:15,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:18:15,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171140903] [2024-09-13 10:18:15,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:15,572 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:18:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:15,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:18:15,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:18:15,572 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:18:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:15,619 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-13 10:18:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:18:15,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-13 10:18:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:15,623 INFO L225 Difference]: With dead ends: 33 [2024-09-13 10:18:15,623 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 10:18:15,623 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:18:15,624 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:15,624 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:18:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 10:18:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-13 10:18:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 10:18:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-13 10:18:15,630 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2024-09-13 10:18:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:15,630 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-13 10:18:15,630 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:18:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-13 10:18:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-13 10:18:15,631 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:15,631 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:15,631 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:18:15,631 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:18:15,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2113848269, now seen corresponding path program 1 times [2024-09-13 10:18:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:15,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99980192] [2024-09-13 10:18:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:18:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:18:15,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:15,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99980192] [2024-09-13 10:18:15,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99980192] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:15,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:15,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:18:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661870069] [2024-09-13 10:18:15,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:15,675 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:18:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:18:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:15,676 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:18:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:15,682 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-13 10:18:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:18:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-13 10:18:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:15,683 INFO L225 Difference]: With dead ends: 31 [2024-09-13 10:18:15,683 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 10:18:15,683 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:15,684 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:15,684 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:18:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 10:18:15,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 10:18:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 10:18:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-13 10:18:15,687 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2024-09-13 10:18:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:15,687 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-13 10:18:15,687 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:18:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-13 10:18:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-13 10:18:15,688 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:15,688 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:15,688 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 10:18:15,688 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:18:15,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:15,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2113848108, now seen corresponding path program 1 times [2024-09-13 10:18:15,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:15,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294814191] [2024-09-13 10:18:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:15,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:18:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:18:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:15,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294814191] [2024-09-13 10:18:15,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294814191] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:15,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:15,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:18:15,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779424041] [2024-09-13 10:18:15,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:15,716 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:18:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:15,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:18:15,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:15,718 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:18:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:15,730 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-09-13 10:18:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:18:15,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-13 10:18:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:15,731 INFO L225 Difference]: With dead ends: 30 [2024-09-13 10:18:15,731 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 10:18:15,731 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:15,732 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:15,732 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:18:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 10:18:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 10:18:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 10:18:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-13 10:18:15,736 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2024-09-13 10:18:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:15,736 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-13 10:18:15,736 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:18:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-13 10:18:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 10:18:15,737 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:15,737 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:15,738 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 10:18:15,738 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:18:15,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash -838455040, now seen corresponding path program 1 times [2024-09-13 10:18:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:15,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160466561] [2024-09-13 10:18:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:18:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114954472] [2024-09-13 10:18:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:15,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:15,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:18:15,785 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 10:18:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:15,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 10:18:15,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:18:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:18:15,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:18:33,569 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:18:47,132 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:19:37,157 WARN L293 SmtUtils]: Spent 24.72s on a formula simplification. DAG size of input: 44 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 10:19:42,818 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:19:54,304 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:20:02,397 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:20:22,768 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:20:39,317 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:20:47,327 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:21:07,758 WARN L293 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:21:15,765 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:21:19,772 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse3 (mod .cse10 18446744073709551616)) (.cse6 (mod (+ |c_ULTIMATE.start_main_~z~0#1| 1) 18446744073709551616)) (.cse2 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse4 (+ .cse10 |c_ULTIMATE.start_main_~z~0#1| 1))) (or (let ((.cse5 (mod (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) 1) 18446744073709551616))) (let ((.cse1 (mod (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|) 18446744073709551616)) (.cse0 (= .cse5 .cse6))) (and (or (< 0 c_~counter~0) .cse0) (or (= .cse1 .cse2) .cse0) (or (and (= .cse1 .cse3) .cse0) (= .cse4 .cse5))))) (let ((.cse8 (< |c_ULTIMATE.start_main_~z~0#1| 1)) (.cse7 (mod |c_ULTIMATE.start_main_~y~0#1| 18446744073709551616)) (.cse9 (mod |c_ULTIMATE.start_main_~x~0#1| 18446744073709551616))) (and (or (< c_~counter~0 1) (not (= .cse7 .cse3)) .cse8 (not (= .cse9 .cse6))) (or (not (= c_~counter~0 0)) (not (= .cse9 1)) .cse8 (not (= (mod |c_ULTIMATE.start_main_~z~0#1| 18446744073709551616) .cse7))) (or (< c_~counter~0 2) (not (= .cse2 .cse7)) (not (= .cse9 .cse4)))))))) is different from true [2024-09-13 10:21:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2024-09-13 10:21:19,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:21:19,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160466561] [2024-09-13 10:21:19,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:21:19,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114954472] [2024-09-13 10:21:19,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114954472] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:21:19,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:21:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2024-09-13 10:21:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713224743] [2024-09-13 10:21:19,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 10:21:19,789 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 10:21:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:21:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 10:21:19,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2024-09-13 10:21:19,790 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-13 10:21:25,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:34,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:38,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:42,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:46,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:50,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:54,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:58,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:02,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:06,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:10,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:14,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:18,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:22:18,396 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-09-13 10:22:18,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 10:22:18,404 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2024-09-13 10:22:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:22:18,405 INFO L225 Difference]: With dead ends: 38 [2024-09-13 10:22:18,405 INFO L226 Difference]: Without dead ends: 38 [2024-09-13 10:22:18,406 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=41, Invalid=116, Unknown=3, NotChecked=22, Total=182 [2024-09-13 10:22:18,406 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 9 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 52.7s IncrementalHoareTripleChecker+Time [2024-09-13 10:22:18,406 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 203 Invalid, 13 Unknown, 45 Unchecked, 52.7s Time] [2024-09-13 10:22:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-13 10:22:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-09-13 10:22:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 10:22:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-09-13 10:22:18,409 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 23 [2024-09-13 10:22:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:22:18,409 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-09-13 10:22:18,409 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-13 10:22:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-09-13 10:22:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:22:18,410 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:22:18,410 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:22:18,422 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 10:22:18,610 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-13 10:22:18,611 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:22:18,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:22:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash -222303701, now seen corresponding path program 1 times [2024-09-13 10:22:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:22:18,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806452710] [2024-09-13 10:22:18,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:18,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:22:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:18,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:22:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:18,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:22:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:18,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 10:22:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:22:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:22:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806452710] [2024-09-13 10:22:18,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806452710] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:22:18,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:22:18,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:22:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092208766] [2024-09-13 10:22:18,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:22:18,752 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:22:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:22:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:22:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:22:18,753 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:22:22,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:26,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:30,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:22:30,887 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-09-13 10:22:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:22:30,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 10:22:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:22:30,888 INFO L225 Difference]: With dead ends: 38 [2024-09-13 10:22:30,889 INFO L226 Difference]: Without dead ends: 38 [2024-09-13 10:22:30,889 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:22:30,890 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:22:30,890 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-09-13 10:22:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-13 10:22:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-09-13 10:22:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 10:22:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-09-13 10:22:30,896 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 24 [2024-09-13 10:22:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:22:30,896 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-09-13 10:22:30,896 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:22:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-09-13 10:22:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 10:22:30,897 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:22:30,897 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:22:30,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 10:22:30,897 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:22:30,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:22:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 228284870, now seen corresponding path program 1 times [2024-09-13 10:22:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:22:30,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096877717] [2024-09-13 10:22:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:22:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:30,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:22:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:30,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:22:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:30,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 10:22:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:22:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:22:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096877717] [2024-09-13 10:22:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096877717] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:22:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027930882] [2024-09-13 10:22:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:30,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:22:30,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:22:30,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:22:30,973 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 10:22:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:31,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 10:22:31,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:22:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:22:31,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:22:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:22:31,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027930882] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:22:31,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:22:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 6 [2024-09-13 10:22:31,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327024828] [2024-09-13 10:22:31,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:22:31,086 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 10:22:31,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:22:31,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 10:22:31,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:22:31,088 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 10:22:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:22:31,124 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-09-13 10:22:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 10:22:31,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 27 [2024-09-13 10:22:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:22:31,125 INFO L225 Difference]: With dead ends: 46 [2024-09-13 10:22:31,125 INFO L226 Difference]: Without dead ends: 46 [2024-09-13 10:22:31,126 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:22:31,126 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:22:31,127 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:22:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-13 10:22:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-09-13 10:22:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:22:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-09-13 10:22:31,133 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 27 [2024-09-13 10:22:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:22:31,133 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-09-13 10:22:31,133 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 10:22:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-09-13 10:22:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-13 10:22:31,134 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:22:31,134 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:22:31,146 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 10:22:31,334 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:22:31,335 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:22:31,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:22:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1183758774, now seen corresponding path program 1 times [2024-09-13 10:22:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:22:31,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088407339] [2024-09-13 10:22:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:22:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:31,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:22:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:31,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:22:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:31,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 10:22:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:31,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 10:22:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 10:22:31,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:22:31,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088407339] [2024-09-13 10:22:31,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088407339] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:22:31,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:22:31,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:22:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278478889] [2024-09-13 10:22:31,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:22:31,366 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:22:31,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:22:31,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:22:31,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:22:31,367 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 10:22:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:22:31,377 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-09-13 10:22:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:22:31,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-13 10:22:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:22:31,378 INFO L225 Difference]: With dead ends: 42 [2024-09-13 10:22:31,378 INFO L226 Difference]: Without dead ends: 36 [2024-09-13 10:22:31,378 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:22:31,382 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 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 10:22:31,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:22:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-13 10:22:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-09-13 10:22:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 28 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 10:22:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-09-13 10:22:31,385 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 30 [2024-09-13 10:22:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:22:31,385 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-09-13 10:22:31,385 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 10:22:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-09-13 10:22:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 10:22:31,385 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:22:31,385 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:22:31,385 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 10:22:31,385 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 10:22:31,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:22:31,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1085389180, now seen corresponding path program 2 times [2024-09-13 10:22:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:22:31,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184463469] [2024-09-13 10:22:31,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:22:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:22:31,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283651803] [2024-09-13 10:22:31,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:22:31,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:22:31,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:22:31,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:22:31,454 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 10:22:31,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:22:31,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-09-13 10:22:31,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 10:22:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 10:22:31,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-13 10:22:31,653 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-13 10:22:31,654 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 10 remaining) [2024-09-13 10:22:31,655 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION (8 of 10 remaining) [2024-09-13 10:22:31,655 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (7 of 10 remaining) [2024-09-13 10:22:31,655 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (6 of 10 remaining) [2024-09-13 10:22:31,655 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (5 of 10 remaining) [2024-09-13 10:22:31,655 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (4 of 10 remaining) [2024-09-13 10:22:31,656 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONPOST_CONDITION (3 of 10 remaining) [2024-09-13 10:22:31,656 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 10 remaining) [2024-09-13 10:22:31,656 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2024-09-13 10:22:31,656 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 10 remaining) [2024-09-13 10:22:31,668 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-13 10:22:31,856 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-13 10:22:31,859 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:22:31,868 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 10:22:31,871 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 10:22:31,871 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 10:22:31,871 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 10:22:31,872 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 10:22:31,872 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 10:22:31,873 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 10:22:31,875 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-09-13 10:22:31,879 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:22:31,884 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-13 10:22:31,885 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-13 10:22:31,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:22:31 BoogieIcfgContainer [2024-09-13 10:22:31,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:22:31,886 INFO L158 Benchmark]: Toolchain (without parser) took 283599.14ms. Allocated memory was 169.9MB in the beginning and 241.2MB in the end (delta: 71.3MB). Free memory was 95.7MB in the beginning and 155.8MB in the end (delta: -60.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-09-13 10:22:31,886 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 169.9MB. Free memory was 128.0MB in the beginning and 127.7MB in the end (delta: 321.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:22:31,886 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:22:31,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.22ms. Allocated memory is still 169.9MB. Free memory was 95.7MB in the beginning and 81.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 10:22:31,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.64ms. Allocated memory is still 169.9MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:22:31,886 INFO L158 Benchmark]: Boogie Preprocessor took 36.64ms. Allocated memory is still 169.9MB. Free memory was 80.1MB in the beginning and 78.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:22:31,886 INFO L158 Benchmark]: RCFGBuilder took 326.71ms. Allocated memory is still 169.9MB. Free memory was 78.6MB in the beginning and 63.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 10:22:31,887 INFO L158 Benchmark]: TraceAbstraction took 282966.25ms. Allocated memory was 169.9MB in the beginning and 241.2MB in the end (delta: 71.3MB). Free memory was 63.1MB in the beginning and 155.8MB in the end (delta: -92.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:22:31,887 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.15ms. Allocated memory is still 169.9MB. Free memory was 128.0MB in the beginning and 127.7MB in the end (delta: 321.6kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.22ms. Allocated memory is still 169.9MB. Free memory was 95.7MB in the beginning and 81.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.64ms. Allocated memory is still 169.9MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.64ms. Allocated memory is still 169.9MB. Free memory was 80.1MB in the beginning and 78.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.71ms. Allocated memory is still 169.9MB. Free memory was 78.6MB in the beginning and 63.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 282966.25ms. Allocated memory was 169.9MB in the beginning and 241.2MB in the end (delta: 71.3MB). Free memory was 63.1MB in the beginning and 155.8MB in the end (delta: -92.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 35]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L22] int counter = 0; [L23] Requires[BinaryExpression[COMPEQ,IdentifierExpression[counter],IntegerLiteral[0]]] [L24] int z, k; [L25] unsigned long long x, y, c; [L26] z = __VERIFIER_nondet_int() [L27] k = __VERIFIER_nondet_int() [L28] CALL assume_abort_if_not(z >= 1) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L28] RET assume_abort_if_not(z >= 1) VAL [counter=0, k=3, z=8388608] [L29] CALL assume_abort_if_not(k >= 1) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L29] RET assume_abort_if_not(k >= 1) VAL [counter=0, k=3, z=8388608] [L31] x = 1 [L32] y = z [L33] c = 1 VAL [c=1, counter=0, k=3, x=1, y=8388608, z=8388608] [L35] EXPR counter++ VAL [c=1, counter=1, k=3, x=1, y=8388608, z=8388608] [L35] COND TRUE counter++<2 [L36] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [c=1, counter=1, k=3, x=1, y=8388608, z=8388608] [L38] COND FALSE !(!(c < k)) [L41] c = c + 1 [L42] x = x * z + 1 [L43] y = y * z VAL [c=2, counter=1, k=3, x=8388609, y=70368744177664, z=8388608] [L35] EXPR counter++ VAL [c=2, counter=2, k=3, x=8388609, y=70368744177664, z=8388608] [L35] COND TRUE counter++<2 [L36] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [c=2, counter=2, k=3, x=8388609, y=70368744177664, z=8388608] [L38] COND FALSE !(!(c < k)) [L41] c = c + 1 [L42] x = x * z + 1 [L43] y = y * z VAL [c=3, counter=2, k=3, x=70368752566273, y=((unsigned __int128) 32 << 64), z=8388608] - UnprovableResult [Line: 23]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 15]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 15]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 282.9s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 71.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 65.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 627 SdHoareTripleChecker+Invalid, 65.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 45 IncrementalHoareTripleChecker+Unchecked, 382 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 522 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 245 mSDtfsCounter, 522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 51.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=10, InterpolantAutomatonStates: 55, 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, 11 MinimizatonAttempts, 16 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 209.5s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 1661 SizeOfPredicates, 4 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 55/71 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 RESULT: Ultimate proved your program to be incorrect! [2024-09-13 10:22:32,028 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE