./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.twocount32.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26998269 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.twocount32.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:26:52,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:26:52,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:26:52,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:26:52,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:26:53,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:26:53,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:26:53,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:26:53,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:26:53,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:26:53,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:26:53,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:26:53,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:26:53,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:26:53,017 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:26:53,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:26:53,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:26:53,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:26:53,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:26:53,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:26:53,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:26:53,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:26:53,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:26:53,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:26:53,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:26:53,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:26:53,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:26:53,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:26:53,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:26:53,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:26:53,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:26:53,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:26:53,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:26:53,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:26:53,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:26:53,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:26:53,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:26:53,033 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:26:53,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:26:53,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:26:53,034 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/ultimate/releaseScripts/default/UAutomizer-linux/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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:26:53,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:26:53,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:26:53,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:26:53,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:26:53,370 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:26:53,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-08-14 14:26:54,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:26:55,060 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:26:55,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-08-14 14:26:55,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d7956ca/056943dc6532441283db1353438d9860/FLAG1a0d077f0 [2024-08-14 14:26:55,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d7956ca/056943dc6532441283db1353438d9860 [2024-08-14 14:26:55,086 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:26:55,087 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:26:55,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.twocount32.yml/witness.yml [2024-08-14 14:26:55,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:26:55,170 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:26:55,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:26:55,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:26:55,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:26:55,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:55" (1/2) ... [2024-08-14 14:26:55,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8c42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:55, skipping insertion in model container [2024-08-14 14:26:55,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:26:55" (1/2) ... [2024-08-14 14:26:55,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7b505776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:26:55, skipping insertion in model container [2024-08-14 14:26:55,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:55" (2/2) ... [2024-08-14 14:26:55,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8c42e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55, skipping insertion in model container [2024-08-14 14:26:55,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:55" (2/2) ... [2024-08-14 14:26:55,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:26:55,361 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-08-14 14:26:55,394 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:26:55,405 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:26:55,438 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-08-14 14:26:55,456 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:26:55,486 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:26:55,487 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55 WrapperNode [2024-08-14 14:26:55,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:26:55,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:26:55,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:26:55,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:26:55,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (1/1) ... [2024-08-14 14:26:55,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (1/1) ... [2024-08-14 14:26:55,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (1/1) ... [2024-08-14 14:26:55,539 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:26:55,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (1/1) ... [2024-08-14 14:26:55,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (1/1) ... [2024-08-14 14:26:55,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (1/1) ... [2024-08-14 14:26:55,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (1/1) ... [2024-08-14 14:26:55,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (1/1) ... [2024-08-14 14:26:55,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:26:55,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:26:55,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:26:55,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:26:55,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (1/1) ... [2024-08-14 14:26:55,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:26:55,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:55,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:26:55,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:26:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:26:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:26:55,739 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:26:55,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:26:55,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:26:55,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:26:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:26:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:26:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:26:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:26:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:26:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:26:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:26:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:26:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:26:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:26:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:26:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:26:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:26:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:26:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:26:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:26:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:26:55,847 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:26:55,850 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:26:56,222 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-08-14 14:26:56,222 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:26:56,231 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:26:56,232 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:26:56,232 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:26:56 BoogieIcfgContainer [2024-08-14 14:26:56,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:26:56,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:26:56,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:26:56,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:26:56,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:26:55" (1/4) ... [2024-08-14 14:26:56,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb05cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:26:56, skipping insertion in model container [2024-08-14 14:26:56,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:26:55" (2/4) ... [2024-08-14 14:26:56,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb05cb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:26:56, skipping insertion in model container [2024-08-14 14:26:56,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:26:55" (3/4) ... [2024-08-14 14:26:56,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb05cb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:26:56, skipping insertion in model container [2024-08-14 14:26:56,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:26:56" (4/4) ... [2024-08-14 14:26:56,248 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount32.c [2024-08-14 14:26:56,248 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:26:56,269 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:26:56,269 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:26:56,293 INFO L92 WitnessUtils]: Constructing product of automaton with 45 states and violation witness of the following lengths: [21] [2024-08-14 14:26:56,297 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 45 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:26:56,430 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 458 states to 377 states. [2024-08-14 14:26:56,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:26:56,462 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1a14cbfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:26:56,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:26:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states. [2024-08-14 14:26:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-08-14 14:26:56,482 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:56,483 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:56,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:56,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:56,492 INFO L85 PathProgramCache]: Analyzing trace with hash 804909074, now seen corresponding path program 1 times [2024-08-14 14:26:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:56,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144493600] [2024-08-14 14:26:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-08-14 14:26:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:57,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-08-14 14:26:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:57,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-08-14 14:26:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:26:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:26:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2024-08-14 14:26:57,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144493600] [2024-08-14 14:26:57,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144493600] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:57,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:57,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:26:57,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297542192] [2024-08-14 14:26:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:57,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:26:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:26:57,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:26:57,942 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:58,037 INFO L93 Difference]: Finished difference Result 320 states and 458 transitions. [2024-08-14 14:26:58,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:26:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 135 [2024-08-14 14:26:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:58,050 INFO L225 Difference]: With dead ends: 320 [2024-08-14 14:26:58,050 INFO L226 Difference]: Without dead ends: 314 [2024-08-14 14:26:58,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:26:58,059 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:58,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 251 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:26:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-08-14 14:26:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 179. [2024-08-14 14:26:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 161 states have (on average 1.515527950310559) internal successors, (244), 162 states have internal predecessors, (244), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:26:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 261 transitions. [2024-08-14 14:26:58,130 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 261 transitions. Word has length 135 [2024-08-14 14:26:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:58,131 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 261 transitions. [2024-08-14 14:26:58,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 261 transitions. [2024-08-14 14:26:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-08-14 14:26:58,137 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:58,137 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:58,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:26:58,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:58,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1864344097, now seen corresponding path program 1 times [2024-08-14 14:26:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725071986] [2024-08-14 14:26:58,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:58,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:58,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:58,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-08-14 14:26:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-08-14 14:26:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:58,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-08-14 14:26:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:58,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:26:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:26:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-08-14 14:26:58,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725071986] [2024-08-14 14:26:58,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725071986] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:26:58,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:26:58,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:26:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443741308] [2024-08-14 14:26:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:26:58,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:26:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:58,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:26:58,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:26:58,709 INFO L87 Difference]: Start difference. First operand 179 states and 261 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:58,737 INFO L93 Difference]: Finished difference Result 193 states and 275 transitions. [2024-08-14 14:26:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:26:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 136 [2024-08-14 14:26:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:58,743 INFO L225 Difference]: With dead ends: 193 [2024-08-14 14:26:58,743 INFO L226 Difference]: Without dead ends: 193 [2024-08-14 14:26:58,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-08-14 14:26:58,745 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:58,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:26:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-08-14 14:26:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-08-14 14:26:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.4797687861271676) internal successors, (256), 174 states have internal predecessors, (256), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:26:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2024-08-14 14:26:58,762 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 136 [2024-08-14 14:26:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:58,764 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2024-08-14 14:26:58,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-14 14:26:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2024-08-14 14:26:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-08-14 14:26:58,766 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:58,767 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:58,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:26:58,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:58,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash -514538512, now seen corresponding path program 1 times [2024-08-14 14:26:58,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:58,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5121508] [2024-08-14 14:26:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:26:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:59,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-08-14 14:26:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:59,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-08-14 14:26:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:59,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-08-14 14:26:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:59,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:27:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:00,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:27:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 124 proven. 15 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-08-14 14:27:00,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5121508] [2024-08-14 14:27:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5121508] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:27:00,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987110068] [2024-08-14 14:27:00,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:00,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:00,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:00,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:27:00,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-14 14:27:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:00,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 23 conjunts are in the unsatisfiable core [2024-08-14 14:27:00,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:27:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-08-14 14:27:00,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:27:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987110068] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:00,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:27:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-08-14 14:27:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940636803] [2024-08-14 14:27:00,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:00,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:27:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:27:00,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:27:00,687 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:27:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:00,756 INFO L93 Difference]: Finished difference Result 191 states and 266 transitions. [2024-08-14 14:27:00,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:27:00,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 137 [2024-08-14 14:27:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:00,758 INFO L225 Difference]: With dead ends: 191 [2024-08-14 14:27:00,758 INFO L226 Difference]: Without dead ends: 191 [2024-08-14 14:27:00,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:27:00,760 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:00,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 109 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:27:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-08-14 14:27:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-08-14 14:27:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.439306358381503) internal successors, (249), 174 states have internal predecessors, (249), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:27:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 266 transitions. [2024-08-14 14:27:00,773 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 266 transitions. Word has length 137 [2024-08-14 14:27:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:00,774 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 266 transitions. [2024-08-14 14:27:00,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:27:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 266 transitions. [2024-08-14 14:27:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-08-14 14:27:00,776 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:00,776 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:00,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-08-14 14:27:00,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:00,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:00,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1292915951, now seen corresponding path program 1 times [2024-08-14 14:27:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015329370] [2024-08-14 14:27:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:01,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:27:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:01,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-08-14 14:27:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-08-14 14:27:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:01,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-08-14 14:27:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:01,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:27:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:01,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:27:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 200 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-08-14 14:27:01,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015329370] [2024-08-14 14:27:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015329370] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:27:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478384747] [2024-08-14 14:27:01,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:01,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:01,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:01,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:27:01,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-14 14:27:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:02,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-14 14:27:02,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:27:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-08-14 14:27:02,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:27:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-08-14 14:27:02,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478384747] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:27:02,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:27:02,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2024-08-14 14:27:02,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989786172] [2024-08-14 14:27:02,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:27:02,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-14 14:27:02,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:02,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-14 14:27:02,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-08-14 14:27:02,818 INFO L87 Difference]: Start difference. First operand 191 states and 266 transitions. Second operand has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-14 14:27:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:03,969 INFO L93 Difference]: Finished difference Result 915 states and 1291 transitions. [2024-08-14 14:27:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-08-14 14:27:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 137 [2024-08-14 14:27:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:03,973 INFO L225 Difference]: With dead ends: 915 [2024-08-14 14:27:03,974 INFO L226 Difference]: Without dead ends: 696 [2024-08-14 14:27:03,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2024-08-14 14:27:03,975 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 117 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:03,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 479 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-14 14:27:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-08-14 14:27:04,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 406. [2024-08-14 14:27:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 375 states have (on average 1.4106666666666667) internal successors, (529), 378 states have internal predecessors, (529), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-08-14 14:27:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 572 transitions. [2024-08-14 14:27:04,015 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 572 transitions. Word has length 137 [2024-08-14 14:27:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:04,016 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 572 transitions. [2024-08-14 14:27:04,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-14 14:27:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 572 transitions. [2024-08-14 14:27:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-08-14 14:27:04,018 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:04,018 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:04,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-14 14:27:04,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-08-14 14:27:04,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:04,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash -518844725, now seen corresponding path program 1 times [2024-08-14 14:27:04,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:04,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003768733] [2024-08-14 14:27:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:05,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:27:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:05,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:27:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:05,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-08-14 14:27:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-08-14 14:27:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:05,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:27:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:27:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 204 proven. 4 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-08-14 14:27:05,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:05,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003768733] [2024-08-14 14:27:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003768733] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:27:05,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419520598] [2024-08-14 14:27:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:05,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:05,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:05,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:27:05,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-14 14:27:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:05,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-14 14:27:05,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:27:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-08-14 14:27:05,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:27:05,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419520598] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:05,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:27:05,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-08-14 14:27:05,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387398013] [2024-08-14 14:27:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:05,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:05,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:05,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:05,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:27:05,493 INFO L87 Difference]: Start difference. First operand 406 states and 572 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:27:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:05,562 INFO L93 Difference]: Finished difference Result 510 states and 716 transitions. [2024-08-14 14:27:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:27:05,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 143 [2024-08-14 14:27:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:05,565 INFO L225 Difference]: With dead ends: 510 [2024-08-14 14:27:05,567 INFO L226 Difference]: Without dead ends: 510 [2024-08-14 14:27:05,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:27:05,568 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:05,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 159 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:27:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-08-14 14:27:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-08-14 14:27:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 472 states have (on average 1.396186440677966) internal successors, (659), 476 states have internal predecessors, (659), 29 states have call successors, (29), 9 states have call predecessors, (29), 8 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-08-14 14:27:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 716 transitions. [2024-08-14 14:27:05,587 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 716 transitions. Word has length 143 [2024-08-14 14:27:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:05,588 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 716 transitions. [2024-08-14 14:27:05,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:27:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 716 transitions. [2024-08-14 14:27:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-08-14 14:27:05,590 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:05,591 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:05,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-14 14:27:05,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:05,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:05,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:05,792 INFO L85 PathProgramCache]: Analyzing trace with hash -399727279, now seen corresponding path program 1 times [2024-08-14 14:27:05,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:05,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983462272] [2024-08-14 14:27:05,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:05,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:27:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:27:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:06,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-08-14 14:27:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-08-14 14:27:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:27:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:06,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:27:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 217 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-08-14 14:27:06,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:06,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983462272] [2024-08-14 14:27:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983462272] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:27:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589247576] [2024-08-14 14:27:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:06,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:06,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:06,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:27:06,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-14 14:27:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:06,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 57 conjunts are in the unsatisfiable core [2024-08-14 14:27:06,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:27:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 64 proven. 81 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-08-14 14:27:07,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:27:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 95 proven. 34 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-08-14 14:27:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589247576] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:27:07,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:27:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-08-14 14:27:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195824119] [2024-08-14 14:27:07,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:27:07,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-14 14:27:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-14 14:27:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-08-14 14:27:07,795 INFO L87 Difference]: Start difference. First operand 510 states and 716 transitions. Second operand has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 23 states have internal predecessors, (144), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:27:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:09,306 INFO L93 Difference]: Finished difference Result 1502 states and 1988 transitions. [2024-08-14 14:27:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-14 14:27:09,307 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 23 states have internal predecessors, (144), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 143 [2024-08-14 14:27:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:09,314 INFO L225 Difference]: With dead ends: 1502 [2024-08-14 14:27:09,315 INFO L226 Difference]: Without dead ends: 1502 [2024-08-14 14:27:09,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=535, Invalid=2327, Unknown=0, NotChecked=0, Total=2862 [2024-08-14 14:27:09,318 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 249 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:09,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 287 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-14 14:27:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-08-14 14:27:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 740. [2024-08-14 14:27:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 697 states have (on average 1.3443328550932567) internal successors, (937), 701 states have internal predecessors, (937), 34 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (33), 29 states have call predecessors, (33), 33 states have call successors, (33) [2024-08-14 14:27:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1004 transitions. [2024-08-14 14:27:09,350 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1004 transitions. Word has length 143 [2024-08-14 14:27:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:09,351 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1004 transitions. [2024-08-14 14:27:09,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 23 states have internal predecessors, (144), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-08-14 14:27:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1004 transitions. [2024-08-14 14:27:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-08-14 14:27:09,354 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:09,354 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:09,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-08-14 14:27:09,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:09,559 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:09,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -735251385, now seen corresponding path program 1 times [2024-08-14 14:27:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533467210] [2024-08-14 14:27:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:10,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:27:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:10,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:27:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:10,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:27:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-14 14:27:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:10,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-08-14 14:27:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:27:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 192 proven. 17 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-08-14 14:27:10,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:10,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533467210] [2024-08-14 14:27:10,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533467210] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:27:10,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612107009] [2024-08-14 14:27:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:10,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:10,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:10,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:27:10,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-14 14:27:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:11,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 94 conjunts are in the unsatisfiable core [2024-08-14 14:27:11,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:27:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 246 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-08-14 14:27:13,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:27:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 211 proven. 49 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-08-14 14:27:16,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612107009] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:27:16,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:27:16,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 29, 24] total 64 [2024-08-14 14:27:16,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060714] [2024-08-14 14:27:16,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:27:16,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-08-14 14:27:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:16,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-08-14 14:27:16,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=3511, Unknown=0, NotChecked=0, Total=4032 [2024-08-14 14:27:16,274 INFO L87 Difference]: Start difference. First operand 740 states and 1004 transitions. Second operand has 64 states, 64 states have (on average 3.71875) internal successors, (238), 64 states have internal predecessors, (238), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-08-14 14:27:58,232 WARN L293 SmtUtils]: Spent 36.75s on a formula simplification. DAG size of input: 68 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 14:28:36,407 WARN L293 SmtUtils]: Spent 36.42s on a formula simplification. DAG size of input: 71 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 14:29:37,506 WARN L293 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 70 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 14:29:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:42,450 INFO L93 Difference]: Finished difference Result 2501 states and 3350 transitions. [2024-08-14 14:29:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-08-14 14:29:42,451 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.71875) internal successors, (238), 64 states have internal predecessors, (238), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 146 [2024-08-14 14:29:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:42,462 INFO L225 Difference]: With dead ends: 2501 [2024-08-14 14:29:42,462 INFO L226 Difference]: Without dead ends: 2501 [2024-08-14 14:29:42,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5550 ImplicationChecksByTransitivity, 142.7s TimeCoverageRelationStatistics Valid=2595, Invalid=15765, Unknown=0, NotChecked=0, Total=18360 [2024-08-14 14:29:42,470 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 578 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 3981 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 4033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:42,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1329 Invalid, 4033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 3981 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-08-14 14:29:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2024-08-14 14:29:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2076. [2024-08-14 14:29:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 1960 states have (on average 1.3311224489795919) internal successors, (2609), 1975 states have internal predecessors, (2609), 107 states have call successors, (107), 9 states have call predecessors, (107), 8 states have return successors, (106), 91 states have call predecessors, (106), 106 states have call successors, (106) [2024-08-14 14:29:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2822 transitions. [2024-08-14 14:29:42,543 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2822 transitions. Word has length 146 [2024-08-14 14:29:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:42,543 INFO L495 AbstractCegarLoop]: Abstraction has 2076 states and 2822 transitions. [2024-08-14 14:29:42,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.71875) internal successors, (238), 64 states have internal predecessors, (238), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-08-14 14:29:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2822 transitions. [2024-08-14 14:29:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-08-14 14:29:42,559 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:42,560 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:42,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-08-14 14:29:42,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:42,764 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:42,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1459665255, now seen corresponding path program 1 times [2024-08-14 14:29:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:42,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847938861] [2024-08-14 14:29:42,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:42,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:43,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:29:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:43,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-08-14 14:29:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:43,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-08-14 14:29:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:43,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-08-14 14:29:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:29:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 137 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-08-14 14:29:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:43,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847938861] [2024-08-14 14:29:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847938861] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242454469] [2024-08-14 14:29:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:43,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:43,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:43,679 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:29:43,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-14 14:29:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:43,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 34 conjunts are in the unsatisfiable core [2024-08-14 14:29:43,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 126 proven. 3 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-08-14 14:29:44,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 122 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-08-14 14:29:45,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242454469] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:29:45,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:29:45,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 21 [2024-08-14 14:29:45,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299804192] [2024-08-14 14:29:45,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:45,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-14 14:29:45,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:45,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-14 14:29:45,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-08-14 14:29:45,939 INFO L87 Difference]: Start difference. First operand 2076 states and 2822 transitions. Second operand has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-08-14 14:29:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:49,864 INFO L93 Difference]: Finished difference Result 2238 states and 2940 transitions. [2024-08-14 14:29:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-08-14 14:29:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 146 [2024-08-14 14:29:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:49,872 INFO L225 Difference]: With dead ends: 2238 [2024-08-14 14:29:49,872 INFO L226 Difference]: Without dead ends: 2053 [2024-08-14 14:29:49,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=410, Invalid=3250, Unknown=0, NotChecked=0, Total=3660 [2024-08-14 14:29:49,874 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 113 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:49,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 542 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-08-14 14:29:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2024-08-14 14:29:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1460. [2024-08-14 14:29:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1373 states have (on average 1.3182811361981064) internal successors, (1810), 1385 states have internal predecessors, (1810), 78 states have call successors, (78), 9 states have call predecessors, (78), 8 states have return successors, (77), 65 states have call predecessors, (77), 77 states have call successors, (77) [2024-08-14 14:29:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1965 transitions. [2024-08-14 14:29:49,915 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1965 transitions. Word has length 146 [2024-08-14 14:29:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:49,915 INFO L495 AbstractCegarLoop]: Abstraction has 1460 states and 1965 transitions. [2024-08-14 14:29:49,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-08-14 14:29:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1965 transitions. [2024-08-14 14:29:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-08-14 14:29:49,920 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:49,920 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:49,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-08-14 14:29:50,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:50,121 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:50,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1363613326, now seen corresponding path program 1 times [2024-08-14 14:29:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:50,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431168736] [2024-08-14 14:29:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:51,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:29:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:51,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:29:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:29:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:29:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-08-14 14:29:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:29:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 140 proven. 10 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-08-14 14:29:51,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431168736] [2024-08-14 14:29:51,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431168736] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:51,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108161056] [2024-08-14 14:29:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:51,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:51,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:51,797 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:29:51,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-14 14:29:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:52,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 86 conjunts are in the unsatisfiable core [2024-08-14 14:29:52,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 164 proven. 10 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-08-14 14:29:52,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 157 proven. 102 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-08-14 14:29:57,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108161056] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:29:57,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:29:57,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 19] total 35 [2024-08-14 14:29:57,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75419417] [2024-08-14 14:29:57,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:57,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-08-14 14:29:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:57,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-08-14 14:29:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2024-08-14 14:29:57,993 INFO L87 Difference]: Start difference. First operand 1460 states and 1965 transitions. Second operand has 35 states, 35 states have (on average 4.114285714285714) internal successors, (144), 35 states have internal predecessors, (144), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-08-14 14:30:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:08,713 INFO L93 Difference]: Finished difference Result 2916 states and 3892 transitions. [2024-08-14 14:30:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-14 14:30:08,715 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.114285714285714) internal successors, (144), 35 states have internal predecessors, (144), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 147 [2024-08-14 14:30:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:08,726 INFO L225 Difference]: With dead ends: 2916 [2024-08-14 14:30:08,726 INFO L226 Difference]: Without dead ends: 2916 [2024-08-14 14:30:08,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=476, Invalid=3184, Unknown=0, NotChecked=0, Total=3660 [2024-08-14 14:30:08,730 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 289 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:08,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1678 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-08-14 14:30:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2024-08-14 14:30:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2835. [2024-08-14 14:30:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2672 states have (on average 1.3023952095808384) internal successors, (3480), 2697 states have internal predecessors, (3480), 154 states have call successors, (154), 9 states have call predecessors, (154), 8 states have return successors, (153), 128 states have call predecessors, (153), 153 states have call successors, (153) [2024-08-14 14:30:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3787 transitions. [2024-08-14 14:30:08,805 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3787 transitions. Word has length 147 [2024-08-14 14:30:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:08,806 INFO L495 AbstractCegarLoop]: Abstraction has 2835 states and 3787 transitions. [2024-08-14 14:30:08,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.114285714285714) internal successors, (144), 35 states have internal predecessors, (144), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-08-14 14:30:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3787 transitions. [2024-08-14 14:30:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-08-14 14:30:08,814 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:08,814 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:08,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-08-14 14:30:09,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:09,015 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:09,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:09,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1794530127, now seen corresponding path program 1 times [2024-08-14 14:30:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:09,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906952075] [2024-08-14 14:30:09,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:09,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:30:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:30:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:30:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:30:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-08-14 14:30:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:30:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-08-14 14:30:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:10,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906952075] [2024-08-14 14:30:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906952075] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:10,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592419160] [2024-08-14 14:30:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:10,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:10,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:10,038 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:30:10,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-14 14:30:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 45 conjunts are in the unsatisfiable core [2024-08-14 14:30:10,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 75 proven. 95 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-08-14 14:30:11,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 99 proven. 55 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-08-14 14:30:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592419160] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:30:12,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:30:12,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 20 [2024-08-14 14:30:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869599338] [2024-08-14 14:30:12,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:12,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-08-14 14:30:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-08-14 14:30:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-08-14 14:30:12,166 INFO L87 Difference]: Start difference. First operand 2835 states and 3787 transitions. Second operand has 20 states, 20 states have (on average 6.05) internal successors, (121), 20 states have internal predecessors, (121), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:30:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:13,503 INFO L93 Difference]: Finished difference Result 3439 states and 4456 transitions. [2024-08-14 14:30:13,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 14:30:13,504 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.05) internal successors, (121), 20 states have internal predecessors, (121), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 147 [2024-08-14 14:30:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:13,516 INFO L225 Difference]: With dead ends: 3439 [2024-08-14 14:30:13,517 INFO L226 Difference]: Without dead ends: 3439 [2024-08-14 14:30:13,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2024-08-14 14:30:13,518 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 84 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:13,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 560 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-08-14 14:30:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2024-08-14 14:30:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 2489. [2024-08-14 14:30:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2335 states have (on average 1.2792291220556746) internal successors, (2987), 2353 states have internal predecessors, (2987), 145 states have call successors, (145), 9 states have call predecessors, (145), 8 states have return successors, (144), 126 states have call predecessors, (144), 144 states have call successors, (144) [2024-08-14 14:30:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3276 transitions. [2024-08-14 14:30:13,585 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3276 transitions. Word has length 147 [2024-08-14 14:30:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:13,585 INFO L495 AbstractCegarLoop]: Abstraction has 2489 states and 3276 transitions. [2024-08-14 14:30:13,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.05) internal successors, (121), 20 states have internal predecessors, (121), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-14 14:30:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3276 transitions. [2024-08-14 14:30:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-08-14 14:30:13,592 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:13,593 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:13,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-14 14:30:13,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-08-14 14:30:13,797 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:13,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash -411614457, now seen corresponding path program 2 times [2024-08-14 14:30:13,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:13,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662346601] [2024-08-14 14:30:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:13,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:14,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:30:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:14,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:30:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:14,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:30:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:30:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:14,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-08-14 14:30:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:14,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:30:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 207 proven. 6 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-08-14 14:30:14,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662346601] [2024-08-14 14:30:14,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662346601] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469389519] [2024-08-14 14:30:14,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:30:14,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:14,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:14,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:30:14,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-08-14 14:30:15,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:30:15,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:30:15,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 69 conjunts are in the unsatisfiable core [2024-08-14 14:30:15,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-08-14 14:30:16,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:30:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469389519] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:30:16,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:30:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2024-08-14 14:30:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736007456] [2024-08-14 14:30:16,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:30:16,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-14 14:30:16,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:16,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-14 14:30:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:30:16,933 INFO L87 Difference]: Start difference. First operand 2489 states and 3276 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:17,297 INFO L93 Difference]: Finished difference Result 2435 states and 3192 transitions. [2024-08-14 14:30:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 14:30:17,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 148 [2024-08-14 14:30:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:17,306 INFO L225 Difference]: With dead ends: 2435 [2024-08-14 14:30:17,306 INFO L226 Difference]: Without dead ends: 2383 [2024-08-14 14:30:17,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:30:17,307 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:17,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 207 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-14 14:30:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2024-08-14 14:30:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2383. [2024-08-14 14:30:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2235 states have (on average 1.2742729306487697) internal successors, (2848), 2251 states have internal predecessors, (2848), 139 states have call successors, (139), 9 states have call predecessors, (139), 8 states have return successors, (138), 122 states have call predecessors, (138), 138 states have call successors, (138) [2024-08-14 14:30:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3125 transitions. [2024-08-14 14:30:17,352 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3125 transitions. Word has length 148 [2024-08-14 14:30:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:17,352 INFO L495 AbstractCegarLoop]: Abstraction has 2383 states and 3125 transitions. [2024-08-14 14:30:17,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3125 transitions. [2024-08-14 14:30:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-08-14 14:30:17,359 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:17,360 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:17,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-08-14 14:30:17,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:17,564 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:17,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash -498892123, now seen corresponding path program 3 times [2024-08-14 14:30:17,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:17,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393647157] [2024-08-14 14:30:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:18,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:30:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:18,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:30:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:18,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:30:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:18,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:30:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-08-14 14:30:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:30:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-08-14 14:30:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393647157] [2024-08-14 14:30:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393647157] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792616512] [2024-08-14 14:30:18,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 14:30:18,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:18,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:18,582 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:30:18,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-08-14 14:30:18,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-14 14:30:18,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:30:18,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 37 conjunts are in the unsatisfiable core [2024-08-14 14:30:18,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 41 proven. 54 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-08-14 14:30:19,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 36 proven. 67 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-08-14 14:30:22,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792616512] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:30:22,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:30:22,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 22 [2024-08-14 14:30:22,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415485455] [2024-08-14 14:30:22,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:22,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-14 14:30:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-14 14:30:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-08-14 14:30:22,071 INFO L87 Difference]: Start difference. First operand 2383 states and 3125 transitions. Second operand has 22 states, 22 states have (on average 5.681818181818182) internal successors, (125), 22 states have internal predecessors, (125), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:23,758 INFO L93 Difference]: Finished difference Result 2634 states and 3376 transitions. [2024-08-14 14:30:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 14:30:23,759 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.681818181818182) internal successors, (125), 22 states have internal predecessors, (125), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 148 [2024-08-14 14:30:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:23,765 INFO L225 Difference]: With dead ends: 2634 [2024-08-14 14:30:23,765 INFO L226 Difference]: Without dead ends: 2634 [2024-08-14 14:30:23,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2024-08-14 14:30:23,766 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 72 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:23,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 260 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-08-14 14:30:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2024-08-14 14:30:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2138. [2024-08-14 14:30:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1996 states have (on average 1.25250501002004) internal successors, (2500), 2010 states have internal predecessors, (2500), 133 states have call successors, (133), 9 states have call predecessors, (133), 8 states have return successors, (132), 118 states have call predecessors, (132), 132 states have call successors, (132) [2024-08-14 14:30:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2765 transitions. [2024-08-14 14:30:23,819 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2765 transitions. Word has length 148 [2024-08-14 14:30:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:23,820 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 2765 transitions. [2024-08-14 14:30:23,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.681818181818182) internal successors, (125), 22 states have internal predecessors, (125), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:30:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2765 transitions. [2024-08-14 14:30:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-08-14 14:30:23,826 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:23,826 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:23,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-08-14 14:30:24,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-08-14 14:30:24,027 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:24,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash -287541210, now seen corresponding path program 2 times [2024-08-14 14:30:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:24,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360881991] [2024-08-14 14:30:24,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:25,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:30:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:25,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:30:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-14 14:30:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:30:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:25,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-08-14 14:30:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:30:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 141 proven. 10 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-08-14 14:30:25,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:25,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360881991] [2024-08-14 14:30:25,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360881991] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:25,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572939711] [2024-08-14 14:30:25,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:30:25,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:25,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:25,287 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:30:25,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-08-14 14:30:25,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:30:25,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:30:25,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 138 conjunts are in the unsatisfiable core [2024-08-14 14:30:25,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 75 proven. 215 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-08-14 14:30:28,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 85 proven. 159 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-08-14 14:30:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572939711] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:30:34,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:30:34,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 26, 18] total 51 [2024-08-14 14:30:34,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416154167] [2024-08-14 14:30:34,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:34,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-08-14 14:30:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-08-14 14:30:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2199, Unknown=0, NotChecked=0, Total=2550 [2024-08-14 14:30:34,398 INFO L87 Difference]: Start difference. First operand 2138 states and 2765 transitions. Second operand has 51 states, 51 states have (on average 4.2745098039215685) internal successors, (218), 51 states have internal predecessors, (218), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-08-14 14:30:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:44,963 INFO L93 Difference]: Finished difference Result 3099 states and 3910 transitions. [2024-08-14 14:30:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-08-14 14:30:44,964 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.2745098039215685) internal successors, (218), 51 states have internal predecessors, (218), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 148 [2024-08-14 14:30:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:44,971 INFO L225 Difference]: With dead ends: 3099 [2024-08-14 14:30:44,972 INFO L226 Difference]: Without dead ends: 3003 [2024-08-14 14:30:44,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4236 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=2201, Invalid=12805, Unknown=0, NotChecked=0, Total=15006 [2024-08-14 14:30:44,975 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 794 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:44,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 405 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-08-14 14:30:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2024-08-14 14:30:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1946. [2024-08-14 14:30:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1808 states have (on average 1.2339601769911503) internal successors, (2231), 1836 states have internal predecessors, (2231), 129 states have call successors, (129), 9 states have call predecessors, (129), 8 states have return successors, (128), 100 states have call predecessors, (128), 128 states have call successors, (128) [2024-08-14 14:30:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2488 transitions. [2024-08-14 14:30:45,022 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2488 transitions. Word has length 148 [2024-08-14 14:30:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:45,022 INFO L495 AbstractCegarLoop]: Abstraction has 1946 states and 2488 transitions. [2024-08-14 14:30:45,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.2745098039215685) internal successors, (218), 51 states have internal predecessors, (218), 12 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-08-14 14:30:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2488 transitions. [2024-08-14 14:30:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-08-14 14:30:45,027 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:45,028 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:45,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-08-14 14:30:45,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-08-14 14:30:45,229 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:45,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash 968566619, now seen corresponding path program 4 times [2024-08-14 14:30:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230994588] [2024-08-14 14:30:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:46,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-08-14 14:30:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:30:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:46,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-08-14 14:30:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-08-14 14:30:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-08-14 14:30:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-08-14 14:30:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 96 proven. 75 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-08-14 14:30:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230994588] [2024-08-14 14:30:46,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230994588] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:46,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577561416] [2024-08-14 14:30:46,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-14 14:30:46,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:46,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:46,276 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:30:46,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-08-14 14:30:46,749 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-14 14:30:46,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:30:46,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 196 conjunts are in the unsatisfiable core [2024-08-14 14:30:46,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:31:00,519 WARN L293 SmtUtils]: Spent 12.31s 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-08-14 14:31:12,642 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 14:31:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 168 proven. 11 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-08-14 14:31:12,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:31:43,376 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-08-14 14:32:08,844 WARN L293 SmtUtils]: Spent 25.32s 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-08-14 14:32:25,299 WARN L293 SmtUtils]: Spent 13.08s on a formula simplification. DAG size of input: 78 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 14:32:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 166 proven. 147 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-08-14 14:32:52,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577561416] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:32:52,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:32:52,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 35] total 54 [2024-08-14 14:32:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830179333] [2024-08-14 14:32:52,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:32:52,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-08-14 14:32:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:32:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-08-14 14:32:52,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=2363, Unknown=0, NotChecked=0, Total=2862 [2024-08-14 14:32:52,702 INFO L87 Difference]: Start difference. First operand 1946 states and 2488 transitions. Second operand has 54 states, 54 states have (on average 3.9814814814814814) internal successors, (215), 54 states have internal predecessors, (215), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-08-14 14:33:07,224 WARN L293 SmtUtils]: Spent 12.36s on a formula simplification. DAG size of input: 35 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-14 14:33:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:33:12,326 INFO L93 Difference]: Finished difference Result 1618 states and 2047 transitions. [2024-08-14 14:33:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-14 14:33:12,326 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.9814814814814814) internal successors, (215), 54 states have internal predecessors, (215), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 151 [2024-08-14 14:33:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:33:12,330 INFO L225 Difference]: With dead ends: 1618 [2024-08-14 14:33:12,330 INFO L226 Difference]: Without dead ends: 1618 [2024-08-14 14:33:12,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 80.5s TimeCoverageRelationStatistics Valid=1030, Invalid=4670, Unknown=0, NotChecked=0, Total=5700 [2024-08-14 14:33:12,332 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 368 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:33:12,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 984 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-08-14 14:33:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2024-08-14 14:33:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1437. [2024-08-14 14:33:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1321 states have (on average 1.2202876608629827) internal successors, (1612), 1345 states have internal predecessors, (1612), 107 states have call successors, (107), 9 states have call predecessors, (107), 8 states have return successors, (106), 82 states have call predecessors, (106), 106 states have call successors, (106) [2024-08-14 14:33:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1825 transitions. [2024-08-14 14:33:12,363 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1825 transitions. Word has length 151 [2024-08-14 14:33:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:33:12,363 INFO L495 AbstractCegarLoop]: Abstraction has 1437 states and 1825 transitions. [2024-08-14 14:33:12,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.9814814814814814) internal successors, (215), 54 states have internal predecessors, (215), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-08-14 14:33:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1825 transitions. [2024-08-14 14:33:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-08-14 14:33:12,368 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:33:12,368 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:33:12,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-08-14 14:33:12,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-08-14 14:33:12,573 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:33:12,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:33:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash 335971484, now seen corresponding path program 1 times [2024-08-14 14:33:12,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:33:12,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859932584] [2024-08-14 14:33:12,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:33:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:33:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:33:12,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:33:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:33:13,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:33:13,085 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:33:13,087 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:33:13,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-14 14:33:13,094 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:33:13,099 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:33:13,183 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:33:13 BoogieIcfgContainer [2024-08-14 14:33:13,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:33:13,184 INFO L158 Benchmark]: Toolchain (without parser) took 378014.86ms. Allocated memory was 186.6MB in the beginning and 583.0MB in the end (delta: 396.4MB). Free memory was 104.3MB in the beginning and 448.0MB in the end (delta: -343.7MB). Peak memory consumption was 302.6MB. Max. memory is 16.1GB. [2024-08-14 14:33:13,184 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 186.6MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:33:13,185 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 186.6MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:33:13,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.78ms. Allocated memory is still 186.6MB. Free memory was 104.1MB in the beginning and 157.1MB in the end (delta: -53.0MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-08-14 14:33:13,186 INFO L158 Benchmark]: Boogie Preprocessor took 77.13ms. Allocated memory is still 186.6MB. Free memory was 157.1MB in the beginning and 155.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:33:13,186 INFO L158 Benchmark]: IcfgBuilder took 669.09ms. Allocated memory is still 186.6MB. Free memory was 155.0MB in the beginning and 137.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-08-14 14:33:13,186 INFO L158 Benchmark]: TraceAbstraction took 376945.52ms. Allocated memory was 186.6MB in the beginning and 583.0MB in the end (delta: 396.4MB). Free memory was 137.8MB in the beginning and 448.0MB in the end (delta: -310.3MB). Peak memory consumption was 336.9MB. Max. memory is 16.1GB. [2024-08-14 14:33:13,187 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 186.6MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 186.6MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.78ms. Allocated memory is still 186.6MB. Free memory was 104.1MB in the beginning and 157.1MB in the end (delta: -53.0MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.13ms. Allocated memory is still 186.6MB. Free memory was 157.1MB in the beginning and 155.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 669.09ms. Allocated memory is still 186.6MB. Free memory was 155.0MB in the beginning and 137.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 376945.52ms. Allocated memory was 186.6MB in the beginning and 583.0MB in the end (delta: 396.4MB). Free memory was 137.8MB in the beginning and 448.0MB in the end (delta: -310.3MB). Peak memory consumption was 336.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 82. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 32); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (32 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = 3; [L37] SORT_1 input_3; [L39] EXPR __VERIFIER_nondet_uint() & mask_SORT_2 [L39] EXPR __VERIFIER_nondet_uint() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=-1, var_16=3, var_4=0, var_9=1] [L39] SORT_2 state_5 = __VERIFIER_nondet_uint() & mask_SORT_2; [L40] EXPR __VERIFIER_nondet_uint() & mask_SORT_2 [L40] EXPR __VERIFIER_nondet_uint() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=-1, var_16=3, var_4=0, var_9=1] [L40] SORT_2 state_6 = __VERIFIER_nondet_uint() & mask_SORT_2; [L42] SORT_2 init_7_arg_1 = var_4; [L43] state_5 = init_7_arg_1 [L44] SORT_2 init_8_arg_1 = var_4; [L45] state_6 = init_8_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_12=1, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_12=1, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=4294967296, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=4294967296, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=4294967296, state_6=0, var_11=1, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=4294967296, var_13=0, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=4294967296, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=4294967296, state_6=0, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=4294967296, state_6=0, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=4294967296, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=4294967296, state_6=0, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=4294967296, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=4294967296, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_12=4294967297, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_12=4294967297, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967295, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967295, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967295, state_6=0, var_11=1, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967295, var_13=0, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967295, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967295, state_6=0, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967295, state_6=0, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967295, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967295, state_6=0, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967295, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967295, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_12=-4294967294, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_12=-4294967294, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=2, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=2, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=2, state_6=0, var_11=1, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=2, var_13=0, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=2, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=0, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=0, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=0, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_12=3, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_12=3, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934590, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934590, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934590, state_6=0, var_11=1, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934590, var_13=1, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934590, var_13=1, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934590, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934590, state_6=-12884901887, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934590, state_6=-12884901887, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934590, state_6=-12884901887, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934590, state_6=-12884901887, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934590, state_6=-12884901887, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934590, state_6=-12884901887, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=-12884901887, var_12=-8589934589, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=-12884901887, var_12=-8589934589, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=-12884901887, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-17179869182, state_6=-12884901887, var_11=-12884901886, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-17179869182, state_6=-12884901887, var_11=-12884901886, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-17179869182, state_6=-12884901887, var_11=-12884901886, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-17179869182, var_13=-12884901886, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-17179869182, var_13=-12884901886, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-17179869182, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=-17179869182, state_6=2, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-17179869182, state_6=2, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-17179869182, state_6=2, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-17179869182, state_6=2, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-17179869182, state_6=2, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-17179869182, state_6=2, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=2, var_12=-17179869181, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=2, var_12=-17179869181, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=2, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967293, state_6=2, var_11=3, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967293, state_6=2, var_11=3, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967293, state_6=2, var_11=3, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967293, var_13=3, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967293, var_13=3, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967293, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967293, state_6=3, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967293, state_6=3, var_16=3, var_19_arg_0=1, var_19_arg_1=1, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967293, state_6=3, var_16=3, var_19_arg_0=1, var_19_arg_1=1, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967293, state_6=3, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967293, state_6=3, var_16=3, var_19=1, var_9=1] [L61] EXPR var_19 & mask_SORT_1 [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967293, state_6=3, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=1, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967293, state_6=3, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=0] [L22] COND TRUE !(cond) VAL [\old(cond)=0] [L22] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 376.8s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 197.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2764 SdHoareTripleChecker+Valid, 22.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2762 mSDsluCounter, 7402 SdHoareTripleChecker+Invalid, 20.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6758 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10289 IncrementalHoareTripleChecker+Invalid, 10505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 644 mSDtfsCounter, 10289 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3721 GetRequests, 3088 SyntacticMatches, 1 SemanticMatches, 632 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14064 ImplicationChecksByTransitivity, 251.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2835occurred in iteration=9, InterpolantAutomatonStates: 406, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 4972 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 170.0s InterpolantComputationTime, 3905 NumberOfCodeBlocks, 3802 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 5031 ConstructedInterpolants, 0 QuantifiedInterpolants, 42686 SizeOfPredicates, 34 NumberOfNonLiveVariables, 7614 ConjunctsInSsa, 799 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 11114/12576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-08-14 14:33:13,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.twocount32.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:33:15,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:33:15,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:33:15,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:33:15,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:33:15,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:33:15,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:33:15,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:33:15,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:33:15,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:33:15,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:33:15,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:33:15,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:33:15,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:33:15,635 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:33:15,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:33:15,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:33:15,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:33:15,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:33:15,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:33:15,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:33:15,640 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:33:15,652 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:33:15,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:33:15,653 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:33:15,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:33:15,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:33:15,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:33:15,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:33:15,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:33:15,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:33:15,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:33:15,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:33:15,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:33:15,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:33:15,659 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:33:15,660 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:33:15,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:33:15,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:33:15,660 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:33:15,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:33:15,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:33:15,663 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:33:15,663 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/ultimate/releaseScripts/default/UAutomizer-linux/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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:33:16,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:33:16,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:33:16,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:33:16,028 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:33:16,029 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:33:16,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.twocount32.yml/witness.yml [2024-08-14 14:33:16,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:33:16,132 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:33:16,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-08-14 14:33:17,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:33:18,051 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:33:18,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-08-14 14:33:18,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f850a300/b1a36a8a58e249c3aa618a53c855592d/FLAGa0815e8c9 [2024-08-14 14:33:18,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f850a300/b1a36a8a58e249c3aa618a53c855592d [2024-08-14 14:33:18,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:33:18,424 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:33:18,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:33:18,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:33:18,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:33:18,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:33:16" (1/2) ... [2024-08-14 14:33:18,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390c7d51 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:33:18, skipping insertion in model container [2024-08-14 14:33:18,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:33:16" (1/2) ... [2024-08-14 14:33:18,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4c250ca3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:33:18, skipping insertion in model container [2024-08-14 14:33:18,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:33:18" (2/2) ... [2024-08-14 14:33:18,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390c7d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18, skipping insertion in model container [2024-08-14 14:33:18,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:33:18" (2/2) ... [2024-08-14 14:33:18,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:33:18,637 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-08-14 14:33:18,674 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:33:18,689 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:33:18,701 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-08-14 14:33:18,722 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:33:18,738 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:33:18,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18 WrapperNode [2024-08-14 14:33:18,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:33:18,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:33:18,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:33:18,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:33:18,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (1/1) ... [2024-08-14 14:33:18,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (1/1) ... [2024-08-14 14:33:18,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (1/1) ... [2024-08-14 14:33:18,781 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:33:18,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (1/1) ... [2024-08-14 14:33:18,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (1/1) ... [2024-08-14 14:33:18,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (1/1) ... [2024-08-14 14:33:18,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (1/1) ... [2024-08-14 14:33:18,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (1/1) ... [2024-08-14 14:33:18,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:33:18,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:33:18,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:33:18,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:33:18,807 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (1/1) ... [2024-08-14 14:33:18,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:33:18,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:33:18,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:33:18,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:33:18,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:33:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:33:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:33:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:33:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:33:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:33:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:33:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:33:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:33:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:33:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:33:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:33:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:33:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:33:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:33:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:33:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:33:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:33:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:33:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:33:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:33:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:33:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:33:19,002 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:33:19,009 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:33:19,267 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-08-14 14:33:19,268 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:33:19,278 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:33:19,279 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:33:19,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:33:19 BoogieIcfgContainer [2024-08-14 14:33:19,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:33:19,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:33:19,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:33:19,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:33:19,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:33:16" (1/4) ... [2024-08-14 14:33:19,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c89511d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:33:19, skipping insertion in model container [2024-08-14 14:33:19,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:33:18" (2/4) ... [2024-08-14 14:33:19,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c89511d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:33:19, skipping insertion in model container [2024-08-14 14:33:19,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:33:18" (3/4) ... [2024-08-14 14:33:19,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c89511d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:33:19, skipping insertion in model container [2024-08-14 14:33:19,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:33:19" (4/4) ... [2024-08-14 14:33:19,290 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount32.c [2024-08-14 14:33:19,290 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:33:19,311 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:33:19,312 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:33:19,344 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [21] [2024-08-14 14:33:19,348 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:33:19,431 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 191 states to 110 states. [2024-08-14 14:33:19,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:33:19,462 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4cb2285f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:33:19,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:33:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2024-08-14 14:33:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-08-14 14:33:19,475 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:33:19,476 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:33:19,476 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:33:19,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:33:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1590109173, now seen corresponding path program 1 times [2024-08-14 14:33:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:33:19,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077170301] [2024-08-14 14:33:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:33:19,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:33:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:33:19,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-14 14:33:19,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-14 14:33:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:33:19,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:33:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:33:19,984 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:33:19,987 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:33:19,989 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:33:19,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-08-14 14:33:20,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:33:20,200 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:33:20,207 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:33:20,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:33:20 BoogieIcfgContainer [2024-08-14 14:33:20,242 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:33:20,243 INFO L158 Benchmark]: Toolchain (without parser) took 1818.79ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 36.1MB in the beginning and 48.0MB in the end (delta: -11.9MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-08-14 14:33:20,243 INFO L158 Benchmark]: Witness Parser took 0.25ms. Allocated memory is still 48.2MB. Free memory is still 22.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:33:20,244 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 30.0MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:33:20,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.82ms. Allocated memory is still 67.1MB. Free memory was 35.9MB in the beginning and 40.7MB in the end (delta: -4.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-08-14 14:33:20,247 INFO L158 Benchmark]: Boogie Preprocessor took 65.38ms. Allocated memory is still 67.1MB. Free memory was 40.7MB in the beginning and 38.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-14 14:33:20,248 INFO L158 Benchmark]: IcfgBuilder took 474.50ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 41.2MB in the end (delta: -2.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-08-14 14:33:20,249 INFO L158 Benchmark]: TraceAbstraction took 960.39ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 40.4MB in the beginning and 48.0MB in the end (delta: -7.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-08-14 14:33:20,253 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.25ms. Allocated memory is still 48.2MB. Free memory is still 22.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.35ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 30.0MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.82ms. Allocated memory is still 67.1MB. Free memory was 35.9MB in the beginning and 40.7MB in the end (delta: -4.8MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.38ms. Allocated memory is still 67.1MB. Free memory was 40.7MB in the beginning and 38.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 474.50ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 41.2MB in the end (delta: -2.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 960.39ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 40.4MB in the beginning and 48.0MB in the end (delta: -7.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 32); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (32 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = 3; [L37] SORT_1 input_3; [L39] SORT_2 state_5 = __VERIFIER_nondet_uint() & mask_SORT_2; [L40] SORT_2 state_6 = __VERIFIER_nondet_uint() & mask_SORT_2; [L42] SORT_2 init_7_arg_1 = var_4; [L43] state_5 = init_7_arg_1 [L44] SORT_2 init_8_arg_1 = var_4; [L45] state_6 = init_8_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=1, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=1, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=0, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=0, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=1, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=1, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=2, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=2, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=3, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) VAL [bad_20_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=2, state_6=3, var_16=3, var_9=1] [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; VAL [bad_20_arg_0=1, input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=3, state_6=3, var_16=3, var_9=1] [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) VAL [\old(cond)=0] [L22] COND TRUE !(cond) VAL [\old(cond)=0] [L22] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 1, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-14 14:33:20,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE