./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm2_valuebound5.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/lcm2_valuebound5.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/nla-digbench-scaling/lcm2_valuebound5.c ../results/automizer-verification-files/SV-COMP24_unreach-call/lcm2_valuebound5.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 06:12:41,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 06:12:41,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 06:12:41,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 06:12:41,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 06:12:41,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 06:12:41,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 06:12:41,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 06:12:41,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 06:12:41,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 06:12:41,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 06:12:41,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 06:12:41,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 06:12:41,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 06:12:41,269 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 06:12:41,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 06:12:41,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 06:12:41,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 06:12:41,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 06:12:41,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 06:12:41,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 06:12:41,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 06:12:41,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 06:12:41,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 06:12:41,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 06:12:41,274 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 06:12:41,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 06:12:41,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 06:12:41,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 06:12:41,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 06:12:41,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 06:12:41,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 06:12:41,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 06:12:41,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 06:12:41,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 06:12:41,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 06:12:41,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 06:12:41,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 06:12:41,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 06:12:41,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 06:12:41,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 06:12:41,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 06:12:41,279 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 06:12:41,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 06:12:41,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 06:12:41,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 06:12:41,584 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 06:12:41,585 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 06:12:41,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/lcm2_valuebound5.yml/witness-2.1.yml [2024-09-13 06:12:41,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 06:12:41,634 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 06:12:41,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/lcm2_valuebound5.c [2024-09-13 06:12:43,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 06:12:43,197 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 06:12:43,198 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/lcm2_valuebound5.c [2024-09-13 06:12:43,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1bb6d71e0/75ad9645252b4ee892f90af40fe5d9a6/FLAG23c98a65c [2024-09-13 06:12:43,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1bb6d71e0/75ad9645252b4ee892f90af40fe5d9a6 [2024-09-13 06:12:43,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 06:12:43,222 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 06:12:43,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 06:12:43,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 06:12:43,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 06:12:43,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 06:12:41" (1/2) ... [2024-09-13 06:12:43,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef10073 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 06:12:43, skipping insertion in model container [2024-09-13 06:12:43,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 06:12:41" (1/2) ... [2024-09-13 06:12:43,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3107ded4 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 06:12:43, skipping insertion in model container [2024-09-13 06:12:43,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 06:12:43" (2/2) ... [2024-09-13 06:12:43,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef10073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43, skipping insertion in model container [2024-09-13 06:12:43,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 06:12:43" (2/2) ... [2024-09-13 06:12:43,243 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 06:12:43,245 INFO L1541 ArrayList]: Loop invariant at [L37-L50] ((((((unsigned long long) b * a) % 2147483648) * 2) == ((((unsigned long long) y * v) + ((unsigned long long) x * u)) % 4294967296)) && ((b % 4294967296) <= 65535)) [2024-09-13 06:12:43,245 INFO L1541 ArrayList]: Function contract at [L8]: requires null, ensures (\old(cond) != 0) [2024-09-13 06:12:43,245 INFO L1541 ArrayList]: Function contract at [L11]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 06:12:43,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 06:12:43,421 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/lcm2_valuebound5.c[537,550] [2024-09-13 06:12:43,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 06:12:43,451 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 06:12:43,490 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/lcm2_valuebound5.c[537,550] Start Parsing Local [2024-09-13 06:12:43,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 06:12:43,516 INFO L204 MainTranslator]: Completed translation [2024-09-13 06:12:43,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43 WrapperNode [2024-09-13 06:12:43,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 06:12:43,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 06:12:43,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 06:12:43,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 06:12:43,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,546 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-09-13 06:12:43,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 06:12:43,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 06:12:43,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 06:12:43,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 06:12:43,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,565 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 06:12:43,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 06:12:43,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 06:12:43,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 06:12:43,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 06:12:43,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (1/1) ... [2024-09-13 06:12:43,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 06:12:43,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 06:12:43,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 06:12:43,605 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 06:12:43,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 06:12:43,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 06:12:43,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 06:12:43,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 06:12:43,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 06:12:43,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 06:12:43,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 06:12:43,668 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 06:12:43,723 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 06:12:43,724 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 06:12:43,906 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 06:12:43,930 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-09-13 06:12:43,930 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 06:12:43,953 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 06:12:43,953 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 06:12:43,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 06:12:43 BoogieIcfgContainer [2024-09-13 06:12:43,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 06:12:43,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 06:12:43,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 06:12:43,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 06:12:43,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 06:12:41" (1/4) ... [2024-09-13 06:12:43,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6500fd1e and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 06:12:43, skipping insertion in model container [2024-09-13 06:12:43,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 06:12:43" (2/4) ... [2024-09-13 06:12:43,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6500fd1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 06:12:43, skipping insertion in model container [2024-09-13 06:12:43,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:12:43" (3/4) ... [2024-09-13 06:12:43,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6500fd1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 06:12:43, skipping insertion in model container [2024-09-13 06:12:43,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 06:12:43" (4/4) ... [2024-09-13 06:12:43,961 INFO L112 eAbstractionObserver]: Analyzing ICFG lcm2_valuebound5.c [2024-09-13 06:12:43,972 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 06:12:43,972 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-09-13 06:12:44,009 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 06:12:44,015 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;@59bd3957, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 06:12:44,015 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-13 06:12:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.588235294117647) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 06:12:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 06:12:44,024 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:12:44,024 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 06:12:44,025 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:12:44,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:12:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash 107291455, now seen corresponding path program 1 times [2024-09-13 06:12:44,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:12:44,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237987986] [2024-09-13 06:12:44,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:12:44,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:12:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:12:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 06:12:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:12:44,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237987986] [2024-09-13 06:12:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237987986] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:12:44,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:12:44,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 06:12:44,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634568302] [2024-09-13 06:12:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:12:44,266 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 06:12:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:12:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 06:12:44,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 06:12:44,296 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.588235294117647) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:12:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:12:44,385 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-09-13 06:12:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 06:12:44,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 06:12:44,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:12:44,394 INFO L225 Difference]: With dead ends: 31 [2024-09-13 06:12:44,394 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 06:12:44,396 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 06:12:44,402 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 06:12:44,403 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 06:12:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 06:12:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-13 06:12:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 06:12:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-09-13 06:12:44,442 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 5 [2024-09-13 06:12:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:12:44,443 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-09-13 06:12:44,443 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:12:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-09-13 06:12:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-13 06:12:44,446 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:12:44,446 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:12:44,446 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 06:12:44,446 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:12:44,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:12:44,448 INFO L85 PathProgramCache]: Analyzing trace with hash -768939130, now seen corresponding path program 1 times [2024-09-13 06:12:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:12:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921582199] [2024-09-13 06:12:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:12:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:12:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 06:12:44,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480177909] [2024-09-13 06:12:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:12:44,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 06:12:44,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 06:12:44,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 06:12:44,559 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 06:12:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:12:44,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-13 06:12:44,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 06:12:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-13 06:12:45,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 06:12:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-13 06:12:45,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:12:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921582199] [2024-09-13 06:12:45,478 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 06:12:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480177909] [2024-09-13 06:12:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480177909] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 06:12:45,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 06:12:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-09-13 06:12:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568785393] [2024-09-13 06:12:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:12:45,482 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 06:12:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:12:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 06:12:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-13 06:12:45,486 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 06:12:49,564 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 06:12:53,569 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 06:12:57,573 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 06:13:01,582 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 06:13:05,606 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 06:13:09,611 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 06:13:13,620 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 06:13:17,626 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 06:13:21,634 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 06:13:25,646 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 06:13:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:13:25,661 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-09-13 06:13:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 06:13:25,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 34 [2024-09-13 06:13:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:13:25,663 INFO L225 Difference]: With dead ends: 33 [2024-09-13 06:13:25,663 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 06:13:25,663 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-13 06:13:25,664 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.2s IncrementalHoareTripleChecker+Time [2024-09-13 06:13:25,665 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 48 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 10 Unknown, 0 Unchecked, 40.2s Time] [2024-09-13 06:13:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 06:13:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-09-13 06:13:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 06:13:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-13 06:13:25,672 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 34 [2024-09-13 06:13:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:13:25,673 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-13 06:13:25,674 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 06:13:25,674 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-13 06:13:25,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-13 06:13:25,675 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:13:25,675 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:13:25,682 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 06:13:25,876 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 06:13:25,877 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:13:25,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:13:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -216127383, now seen corresponding path program 1 times [2024-09-13 06:13:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:13:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131324507] [2024-09-13 06:13:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:13:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:13:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 06:13:25,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855477217] [2024-09-13 06:13:25,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:13:25,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 06:13:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 06:13:25,959 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 06:13:25,960 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 06:13:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 06:13:26,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 06:13:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-13 06:13:26,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 06:13:26,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:13:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131324507] [2024-09-13 06:13:26,145 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 06:13:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855477217] [2024-09-13 06:13:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855477217] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:13:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:13:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 06:13:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959760799] [2024-09-13 06:13:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:13:26,148 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 06:13:26,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:13:26,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 06:13:26,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:13:26,151 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 06:13:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:13:26,316 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2024-09-13 06:13:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 06:13:26,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 36 [2024-09-13 06:13:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:13:26,318 INFO L225 Difference]: With dead ends: 35 [2024-09-13 06:13:26,318 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 06:13:26,319 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:13:26,319 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 06:13:26,320 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 06:13:26,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 06:13:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-09-13 06:13:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 06:13:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-13 06:13:26,325 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 36 [2024-09-13 06:13:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:13:26,326 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-13 06:13:26,326 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 06:13:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-13 06:13:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 06:13:26,327 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:13:26,328 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:13:26,334 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 06:13:26,528 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 06:13:26,529 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:13:26,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:13:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash -493168233, now seen corresponding path program 1 times [2024-09-13 06:13:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:13:26,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349948371] [2024-09-13 06:13:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:13:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:13:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:13:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:13:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:13:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 06:13:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-13 06:13:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,691 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 06:13:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-13 06:13:26,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:13:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349948371] [2024-09-13 06:13:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349948371] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:13:26,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:13:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 06:13:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790257496] [2024-09-13 06:13:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:13:26,695 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 06:13:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:13:26,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 06:13:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:13:26,697 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 06:13:26,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:13:26,705 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-09-13 06:13:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 06:13:26,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2024-09-13 06:13:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:13:26,707 INFO L225 Difference]: With dead ends: 32 [2024-09-13 06:13:26,707 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 06:13:26,707 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 06:13:26,708 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:13:26,708 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:13:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 06:13:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 06:13:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 21 states have internal predecessors, (23), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 06:13:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-13 06:13:26,717 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 39 [2024-09-13 06:13:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:13:26,718 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-13 06:13:26,718 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 06:13:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-13 06:13:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 06:13:26,719 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:13:26,719 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:13:26,719 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 06:13:26,719 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:13:26,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:13:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -493168072, now seen corresponding path program 1 times [2024-09-13 06:13:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:13:26,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288100783] [2024-09-13 06:13:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:13:26,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:13:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:13:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:13:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:13:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 06:13:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-13 06:13:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 06:13:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-13 06:13:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:13:26,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288100783] [2024-09-13 06:13:26,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288100783] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:13:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:13:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 06:13:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163900510] [2024-09-13 06:13:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:13:26,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 06:13:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:13:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 06:13:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:13:26,821 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 06:13:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:13:26,858 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-09-13 06:13:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 06:13:26,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2024-09-13 06:13:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:13:26,863 INFO L225 Difference]: With dead ends: 31 [2024-09-13 06:13:26,863 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 06:13:26,864 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:13:26,864 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:13:26,866 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:13:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 06:13:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 06:13:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 06:13:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-13 06:13:26,874 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 39 [2024-09-13 06:13:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:13:26,875 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-13 06:13:26,875 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 06:13:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-13 06:13:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-13 06:13:26,876 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:13:26,876 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:13:26,876 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 06:13:26,878 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:13:26,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:13:26,878 INFO L85 PathProgramCache]: Analyzing trace with hash 147406127, now seen corresponding path program 1 times [2024-09-13 06:13:26,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:13:26,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068487955] [2024-09-13 06:13:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:13:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:13:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 06:13:26,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233702337] [2024-09-13 06:13:26,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:13:26,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 06:13:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 06:13:26,926 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 06:13:26,928 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 06:13:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:13:27,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-13 06:13:27,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 06:13:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-09-13 06:13:28,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 06:13:52,613 WARN L293 SmtUtils]: Spent 12.03s 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 06:14:12,865 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:14:28,969 WARN L293 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:14:37,462 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (mod |c_ULTIMATE.start_main_~b~0#1| 4294967296))) (let ((.cse0 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~v~0#1| 4294967296)) (.cse1 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296)) (.cse3 (* (mod (* (mod |c_ULTIMATE.start_main_~a~0#1| 4294967296) .cse4) 2147483648) 2))) (or (= .cse0 .cse1) (= (mod (+ (* .cse2 (mod (+ |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~x~0#1| 4294967295)) 4294967296)) (* (mod (+ |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~v~0#1|) 4294967296) .cse1)) 4294967296) .cse3) (< 65535 .cse4) (< .cse0 .cse1) (not (= (mod (+ (* .cse0 .cse2) (* (mod |c_ULTIMATE.start_main_~u~0#1| 4294967296) .cse1)) 4294967296) .cse3))))) is different from true [2024-09-13 06:14:53,491 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:15:05,507 WARN L293 SmtUtils]: Spent 12.02s 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 06:15:21,528 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:15:29,957 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~b~0#1| 4294967296)) (.cse1 (mod |c_ULTIMATE.start_main_~a~0#1| 4294967296))) (or (< 65535 .cse0) (= (mod (+ (* .cse1 (mod (+ (* |c_ULTIMATE.start_main_~a~0#1| 4294967295) |c_ULTIMATE.start_main_~b~0#1|) 4294967296)) (* (mod (+ |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|) 4294967296) .cse1)) 4294967296) (* (mod (* .cse1 .cse0) 2147483648) 2)) (= .cse1 .cse0) (< .cse0 .cse1))) is different from true [2024-09-13 06:15:46,017 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:15:58,037 WARN L293 SmtUtils]: Spent 12.02s 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 06:16:14,055 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:16:34,229 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:16:46,252 WARN L293 SmtUtils]: Spent 12.02s 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 06:17:02,295 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:17:22,781 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:17:34,808 WARN L293 SmtUtils]: Spent 12.03s 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 06:17:50,920 WARN L293 SmtUtils]: Spent 16.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:18:07,309 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:18:19,346 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 06:18:27,374 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:18:35,400 WARN L293 SmtUtils]: Spent 8.02s 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 06:18:43,421 WARN L293 SmtUtils]: Spent 8.02s 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 06:18:51,469 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:18:59,493 WARN L293 SmtUtils]: Spent 8.02s 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 06:19:07,550 WARN L293 SmtUtils]: Spent 8.02s 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 06:19:15,573 WARN L293 SmtUtils]: Spent 8.02s 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 06:19:23,604 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:19:35,723 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:19:43,733 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 06:19:51,741 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:19:59,751 WARN L293 SmtUtils]: Spent 8.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 06:20:07,772 WARN L293 SmtUtils]: Spent 8.02s 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 06:20:15,794 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 06:20:23,809 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:20:35,845 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:20:43,857 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 06:20:51,888 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:20:59,912 WARN L293 SmtUtils]: Spent 8.02s 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 06:21:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 1 not checked. [2024-09-13 06:21:20,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:20,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068487955] [2024-09-13 06:21:20,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 06:21:20,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233702337] [2024-09-13 06:21:20,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233702337] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 06:21:20,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 06:21:20,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2024-09-13 06:21:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804287269] [2024-09-13 06:21:20,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 06:21:20,055 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-13 06:21:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-13 06:21:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=88, Unknown=4, NotChecked=42, Total=182 [2024-09-13 06:21:20,056 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 14 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 7 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-09-13 06:21:26,521 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 06:21:30,529 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 06:21:32,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:21:45,358 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 06:21:49,363 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 06:21:53,372 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 06:21:57,380 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 06:22:00,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:22:04,985 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 06:22:08,990 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 06:22:12,995 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 06:22:17,003 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 06:22:21,008 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 06:22:25,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:22:29,039 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 06:22:33,055 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 06:22:37,062 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 06:22:41,067 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 06:22:45,077 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 06:22:47,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 06:22:49,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:22:50,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:22:54,443 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 06:22:58,449 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 06:23:02,465 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 06:23:53,474 WARN L293 SmtUtils]: Spent 40.41s on a formula simplification. DAG size of input: 46 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 06:23:57,476 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 06:24:01,482 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 06:24:03,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:24:07,970 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 06:24:11,976 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 06:24:13,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:24:48,693 WARN L293 SmtUtils]: Spent 20.60s on a formula simplification. DAG size of input: 45 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 06:24:52,698 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 06:24:56,702 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 06:25:00,707 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 06:25:04,714 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 06:25:08,721 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 06:25:12,726 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 06:25:16,732 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 06:25:20,741 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 06:25:24,748 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 06:25:28,755 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 06:25:32,760 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 06:25:36,771 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 06:25:40,776 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 06:25:44,782 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 06:25:48,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:25:52,811 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 06:25:56,820 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 06:26:00,834 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 06:26:04,844 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 06:26:08,857 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 06:26:12,863 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 06:26:16,867 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 06:26:20,873 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 06:26:24,879 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 06:26:28,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:26:32,917 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 06:26:36,922 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 06:26:40,932 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 06:26:44,936 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 06:26:48,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:26:52,981 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 06:26:56,988 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 06:27:00,993 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 06:27:04,998 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 06:27:09,003 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 06:27:13,013 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 06:27:17,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 06:27:21,042 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 [] Killed by 15