./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter_v.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.counter_v.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.counter_v.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.counter_v.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:24:19,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:24:20,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:24:20,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:24:20,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:24:20,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:24:20,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:24:20,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:24:20,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:24:20,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:24:20,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:24:20,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:24:20,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:24:20,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:24:20,114 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:24:20,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:24:20,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:24:20,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:24:20,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:24:20,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:24:20,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:24:20,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:24:20,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:24:20,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:24:20,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:24:20,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:24:20,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:24:20,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:24:20,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:24:20,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:24:20,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:24:20,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:24:20,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:24:20,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:24:20,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:24:20,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:24:20,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:24:20,125 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:24:20,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:24:20,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:24:20,125 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:24:20,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:24:20,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:24:20,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:24:20,431 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:24:20,432 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:24:20,433 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.counter_v.yml/witness.yml [2024-08-14 14:24:20,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:24:20,560 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:24:20,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2024-08-14 14:24:22,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:24:22,266 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:24:22,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2024-08-14 14:24:22,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21fa42ee5/8c2663cd7169420fbef4d6d3eac50a05/FLAG39f325b74 [2024-08-14 14:24:22,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21fa42ee5/8c2663cd7169420fbef4d6d3eac50a05 [2024-08-14 14:24:22,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:24:22,643 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:24:22,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:22,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:24:22,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:24:22,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:20" (1/2) ... [2024-08-14 14:24:22,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4035bc8d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:22, skipping insertion in model container [2024-08-14 14:24:22,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:20" (1/2) ... [2024-08-14 14:24:22,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3e1207d2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:22, skipping insertion in model container [2024-08-14 14:24:22,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:22" (2/2) ... [2024-08-14 14:24:22,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4035bc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22, skipping insertion in model container [2024-08-14 14:24:22,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:22" (2/2) ... [2024-08-14 14:24:22,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:24:22,803 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.counter_v.c[1249,1262] [2024-08-14 14:24:22,840 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:22,849 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:24:22,860 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.counter_v.c[1249,1262] [2024-08-14 14:24:22,873 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:22,886 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:24:22,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22 WrapperNode [2024-08-14 14:24:22,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:22,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:24:22,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:24:22,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:24:22,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (1/1) ... [2024-08-14 14:24:22,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (1/1) ... [2024-08-14 14:24:22,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (1/1) ... [2024-08-14 14:24:22,927 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:24:22,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (1/1) ... [2024-08-14 14:24:22,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (1/1) ... [2024-08-14 14:24:22,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (1/1) ... [2024-08-14 14:24:22,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (1/1) ... [2024-08-14 14:24:22,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (1/1) ... [2024-08-14 14:24:22,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:24:22,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:24:22,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:24:22,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:24:22,937 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (1/1) ... [2024-08-14 14:24:22,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:24:22,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:22,998 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:24:23,016 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:24:23,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:24:23,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:24:23,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:24:23,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:24:23,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:24:23,066 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:24:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:24:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:24:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:24:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:24:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:24:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:24:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:24:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:24:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:24:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:24:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:24:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:24:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:24:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:24:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:24:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:24:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:24:23,136 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:24:23,138 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:24:23,436 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-08-14 14:24:23,436 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:24:23,449 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:24:23,450 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:24:23,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:23 BoogieIcfgContainer [2024-08-14 14:24:23,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:24:23,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:24:23,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:24:23,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:24:23,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:20" (1/4) ... [2024-08-14 14:24:23,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de931fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:24:23, skipping insertion in model container [2024-08-14 14:24:23,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:24:22" (2/4) ... [2024-08-14 14:24:23,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de931fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:24:23, skipping insertion in model container [2024-08-14 14:24:23,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:22" (3/4) ... [2024-08-14 14:24:23,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de931fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:24:23, skipping insertion in model container [2024-08-14 14:24:23,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:23" (4/4) ... [2024-08-14 14:24:23,460 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2024-08-14 14:24:23,460 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:24:23,482 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:24:23,483 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:24:23,508 INFO L92 WitnessUtils]: Constructing product of automaton with 36 states and violation witness of the following lengths: [45] [2024-08-14 14:24:23,513 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 36 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 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:24:23,784 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 763 states to 594 states. [2024-08-14 14:24:23,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:24:23,817 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;@5fab9df3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:24:23,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:24:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states. [2024-08-14 14:24:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-08-14 14:24:23,851 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:23,852 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:23,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:23,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:23,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1961490745, now seen corresponding path program 1 times [2024-08-14 14:24:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146246124] [2024-08-14 14:24:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:23,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-08-14 14:24:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-08-14 14:24:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-14 14:24:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-08-14 14:24:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-14 14:24:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-08-14 14:24:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:24:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-08-14 14:24:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-08-14 14:24:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-08-14 14:24:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-08-14 14:24:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-08-14 14:24:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-08-14 14:24:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1449 trivial. 0 not checked. [2024-08-14 14:24:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146246124] [2024-08-14 14:24:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146246124] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:25,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:25,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:24:25,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084763402] [2024-08-14 14:24:25,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:25,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:24:25,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:24:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:24:25,870 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:24:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:25,954 INFO L93 Difference]: Finished difference Result 473 states and 633 transitions. [2024-08-14 14:24:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:24:25,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 229 [2024-08-14 14:24:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:25,962 INFO L225 Difference]: With dead ends: 473 [2024-08-14 14:24:25,962 INFO L226 Difference]: Without dead ends: 459 [2024-08-14 14:24:25,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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:24:25,970 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 176 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:24:25,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 176 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:24:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-08-14 14:24:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 292. [2024-08-14 14:24:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 258 states have (on average 1.4689922480620154) internal successors, (379), 259 states have internal predecessors, (379), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-08-14 14:24:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 412 transitions. [2024-08-14 14:24:26,037 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 412 transitions. Word has length 229 [2024-08-14 14:24:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:26,038 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 412 transitions. [2024-08-14 14:24:26,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:24:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 412 transitions. [2024-08-14 14:24:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-08-14 14:24:26,042 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:26,042 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:26,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:24:26,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:26,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2009913218, now seen corresponding path program 1 times [2024-08-14 14:24:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:26,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273682489] [2024-08-14 14:24:26,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:26,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-08-14 14:24:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-08-14 14:24:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-14 14:24:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-08-14 14:24:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-14 14:24:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-08-14 14:24:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:24:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-08-14 14:24:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-08-14 14:24:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-08-14 14:24:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-08-14 14:24:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-08-14 14:24:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-08-14 14:24:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2024-08-14 14:24:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:26,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273682489] [2024-08-14 14:24:26,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273682489] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:26,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:26,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:24:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724171991] [2024-08-14 14:24:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:26,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:24:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:26,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:24:26,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:24:26,859 INFO L87 Difference]: Start difference. First operand 292 states and 412 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:24:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:26,883 INFO L93 Difference]: Finished difference Result 322 states and 442 transitions. [2024-08-14 14:24:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:24:26,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 230 [2024-08-14 14:24:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:26,886 INFO L225 Difference]: With dead ends: 322 [2024-08-14 14:24:26,886 INFO L226 Difference]: Without dead ends: 322 [2024-08-14 14:24:26,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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:24:26,888 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 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:24:26,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:24:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-08-14 14:24:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2024-08-14 14:24:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 286 states have (on average 1.4230769230769231) internal successors, (407), 287 states have internal predecessors, (407), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-08-14 14:24:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 440 transitions. [2024-08-14 14:24:26,905 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 440 transitions. Word has length 230 [2024-08-14 14:24:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:26,906 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 440 transitions. [2024-08-14 14:24:26,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:24:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 440 transitions. [2024-08-14 14:24:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-08-14 14:24:26,909 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:26,909 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:26,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:24:26,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:26,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:26,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1515208996, now seen corresponding path program 1 times [2024-08-14 14:24:26,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:26,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664632540] [2024-08-14 14:24:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-08-14 14:24:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-08-14 14:24:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-08-14 14:24:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-08-14 14:24:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-14 14:24:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-08-14 14:24:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-08-14 14:24:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-08-14 14:24:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-08-14 14:24:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-08-14 14:24:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-08-14 14:24:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-08-14 14:24:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-08-14 14:24:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 348 proven. 2 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2024-08-14 14:24:28,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:28,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664632540] [2024-08-14 14:24:28,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664632540] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:24:28,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601474971] [2024-08-14 14:24:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:28,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:28,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:28,285 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:24:28,287 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:24:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:28,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 111 conjunts are in the unsatisfiable core [2024-08-14 14:24:28,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:24:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1449 trivial. 0 not checked. [2024-08-14 14:24:29,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:24:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601474971] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:29,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:24:29,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-08-14 14:24:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197353295] [2024-08-14 14:24:29,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:29,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 14:24:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:29,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 14:24:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:24:29,114 INFO L87 Difference]: Start difference. First operand 320 states and 440 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:24:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:29,199 INFO L93 Difference]: Finished difference Result 318 states and 436 transitions. [2024-08-14 14:24:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 14:24:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 231 [2024-08-14 14:24:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:29,202 INFO L225 Difference]: With dead ends: 318 [2024-08-14 14:24:29,202 INFO L226 Difference]: Without dead ends: 318 [2024-08-14 14:24:29,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:24:29,203 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:29,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 40 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:24:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-08-14 14:24:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-08-14 14:24:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 284 states have (on average 1.4190140845070423) internal successors, (403), 285 states have internal predecessors, (403), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-08-14 14:24:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 436 transitions. [2024-08-14 14:24:29,225 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 436 transitions. Word has length 231 [2024-08-14 14:24:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:29,225 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 436 transitions. [2024-08-14 14:24:29,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-14 14:24:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 436 transitions. [2024-08-14 14:24:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-08-14 14:24:29,228 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:29,228 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:29,251 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:24:29,429 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:24:29,429 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:29,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1747329247, now seen corresponding path program 1 times [2024-08-14 14:24:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:29,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962671191] [2024-08-14 14:24:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:24:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-08-14 14:24:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-08-14 14:24:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-14 14:24:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-08-14 14:24:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:24:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-08-14 14:24:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-08-14 14:24:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-08-14 14:24:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-08-14 14:24:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-08-14 14:24:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-08-14 14:24:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-08-14 14:24:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-08-14 14:24:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 349 proven. 2 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2024-08-14 14:24:30,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:30,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962671191] [2024-08-14 14:24:30,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962671191] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:24:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206787597] [2024-08-14 14:24:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:30,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:30,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:30,595 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:24:30,598 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:24:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:31,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 106 conjunts are in the unsatisfiable core [2024-08-14 14:24:31,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:24:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 793 proven. 94 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2024-08-14 14:24:32,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:24:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 608 proven. 5 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2024-08-14 14:24:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206787597] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:24:32,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:24:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 6] total 14 [2024-08-14 14:24:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543700300] [2024-08-14 14:24:32,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:24:32,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-14 14:24:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-14 14:24:32,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-08-14 14:24:32,815 INFO L87 Difference]: Start difference. First operand 318 states and 436 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-08-14 14:24:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:33,039 INFO L93 Difference]: Finished difference Result 473 states and 633 transitions. [2024-08-14 14:24:33,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 14:24:33,041 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 232 [2024-08-14 14:24:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:33,044 INFO L225 Difference]: With dead ends: 473 [2024-08-14 14:24:33,044 INFO L226 Difference]: Without dead ends: 473 [2024-08-14 14:24:33,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-08-14 14:24:33,047 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 68 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:33,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 140 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:24:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-08-14 14:24:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 292. [2024-08-14 14:24:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 258 states have (on average 1.3527131782945736) internal successors, (349), 259 states have internal predecessors, (349), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-08-14 14:24:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 382 transitions. [2024-08-14 14:24:33,059 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 382 transitions. Word has length 232 [2024-08-14 14:24:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:33,059 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 382 transitions. [2024-08-14 14:24:33,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-08-14 14:24:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 382 transitions. [2024-08-14 14:24:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-08-14 14:24:33,062 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:33,062 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:33,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-08-14 14:24:33,266 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:24:33,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:33,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -442296621, now seen corresponding path program 1 times [2024-08-14 14:24:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:33,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823637616] [2024-08-14 14:24:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:33,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:24:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-08-14 14:24:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-08-14 14:24:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-14 14:24:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-08-14 14:24:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-08-14 14:24:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:24:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-08-14 14:24:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-08-14 14:24:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-08-14 14:24:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-08-14 14:24:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-08-14 14:24:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-08-14 14:24:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-08-14 14:24:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2024-08-14 14:24:35,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823637616] [2024-08-14 14:24:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823637616] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:35,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:35,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:24:35,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86194229] [2024-08-14 14:24:35,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:35,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:24:35,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:35,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:24:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:24:35,224 INFO L87 Difference]: Start difference. First operand 292 states and 382 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:24:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:35,359 INFO L93 Difference]: Finished difference Result 301 states and 393 transitions. [2024-08-14 14:24:35,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:24:35,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 245 [2024-08-14 14:24:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:35,361 INFO L225 Difference]: With dead ends: 301 [2024-08-14 14:24:35,361 INFO L226 Difference]: Without dead ends: 301 [2024-08-14 14:24:35,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-08-14 14:24:35,362 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 65 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:35,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 126 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:24:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-08-14 14:24:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 292. [2024-08-14 14:24:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 258 states have (on average 1.3488372093023255) internal successors, (348), 259 states have internal predecessors, (348), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-08-14 14:24:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 381 transitions. [2024-08-14 14:24:35,368 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 381 transitions. Word has length 245 [2024-08-14 14:24:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:35,369 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 381 transitions. [2024-08-14 14:24:35,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:24:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 381 transitions. [2024-08-14 14:24:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-08-14 14:24:35,371 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:35,371 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:35,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 14:24:35,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:35,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash -507619863, now seen corresponding path program 1 times [2024-08-14 14:24:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:35,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423269916] [2024-08-14 14:24:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-08-14 14:24:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-08-14 14:24:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-08-14 14:24:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-08-14 14:24:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-08-14 14:24:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-08-14 14:24:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-08-14 14:24:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-08-14 14:24:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:24:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-08-14 14:24:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-08-14 14:24:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-08-14 14:24:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-08-14 14:24:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-08-14 14:24:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 323 proven. 11 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2024-08-14 14:24:36,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:36,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423269916] [2024-08-14 14:24:36,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423269916] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:24:36,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563841968] [2024-08-14 14:24:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:36,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:36,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:36,693 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:24:36,696 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:24:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:37,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 40 conjunts are in the unsatisfiable core [2024-08-14 14:24:37,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:24:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-08-14 14:24:37,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:24:37,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563841968] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:37,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:24:37,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-08-14 14:24:37,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620627606] [2024-08-14 14:24:37,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:37,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:24:37,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:37,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:24:37,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:24:37,371 INFO L87 Difference]: Start difference. First operand 292 states and 381 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:24:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:37,479 INFO L93 Difference]: Finished difference Result 303 states and 395 transitions. [2024-08-14 14:24:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:24:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 246 [2024-08-14 14:24:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:37,482 INFO L225 Difference]: With dead ends: 303 [2024-08-14 14:24:37,482 INFO L226 Difference]: Without dead ends: 303 [2024-08-14 14:24:37,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-08-14 14:24:37,483 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 68 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:37,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 104 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:24:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-08-14 14:24:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2024-08-14 14:24:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 268 states have (on average 1.3432835820895523) internal successors, (360), 269 states have internal predecessors, (360), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:24:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 395 transitions. [2024-08-14 14:24:37,489 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 395 transitions. Word has length 246 [2024-08-14 14:24:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:37,490 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 395 transitions. [2024-08-14 14:24:37,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:24:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 395 transitions. [2024-08-14 14:24:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-08-14 14:24:37,492 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:37,493 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:37,513 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:24:37,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:37,694 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:37,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash 964658730, now seen corresponding path program 1 times [2024-08-14 14:24:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:37,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43658496] [2024-08-14 14:24:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:24:38,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:24:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:24:39,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:24:39,849 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:24:39,850 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:24:39,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 14:24:39,854 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:39,859 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:24:39,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:24:39 BoogieIcfgContainer [2024-08-14 14:24:39,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:24:39,974 INFO L158 Benchmark]: Toolchain (without parser) took 17331.43ms. Allocated memory was 172.0MB in the beginning and 616.6MB in the end (delta: 444.6MB). Free memory was 114.9MB in the beginning and 522.4MB in the end (delta: -407.5MB). Peak memory consumption was 347.0MB. Max. memory is 16.1GB. [2024-08-14 14:24:39,974 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 172.0MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:24:39,974 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:24:39,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.33ms. Allocated memory is still 172.0MB. Free memory was 114.4MB in the beginning and 101.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:24:39,975 INFO L158 Benchmark]: Boogie Preprocessor took 47.27ms. Allocated memory is still 172.0MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:24:39,975 INFO L158 Benchmark]: IcfgBuilder took 514.54ms. Allocated memory is still 172.0MB. Free memory was 99.7MB in the beginning and 79.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-08-14 14:24:39,975 INFO L158 Benchmark]: TraceAbstraction took 16520.71ms. Allocated memory was 172.0MB in the beginning and 616.6MB in the end (delta: 444.6MB). Free memory was 78.8MB in the beginning and 522.4MB in the end (delta: -443.7MB). Peak memory consumption was 311.4MB. Max. memory is 16.1GB. [2024-08-14 14:24:39,976 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.21ms. Allocated memory is still 172.0MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.33ms. Allocated memory is still 172.0MB. Free memory was 114.4MB in the beginning and 101.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.27ms. Allocated memory is still 172.0MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 514.54ms. Allocated memory is still 172.0MB. Free memory was 99.7MB in the beginning and 79.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16520.71ms. Allocated memory was 172.0MB in the beginning and 616.6MB in the end (delta: 444.6MB). Free memory was 78.8MB in the beginning and 522.4MB in the end (delta: -443.7MB). Peak memory consumption was 311.4MB. 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: 21]: 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 57. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 1; [L33] const SORT_4 var_8 = 15; [L34] const SORT_1 var_12 = 1; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L39] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] SORT_4 init_7_arg_1 = var_5; [L42] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=1, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=1, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_20=0, var_5=1, var_8=15] [L76] EXPR var_20 & mask_SORT_4 [L76] EXPR var_20 & mask_SORT_4 VAL [bad_15_arg_0=0, mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_14=1, var_5=1, var_8=15] [L58] EXPR var_14 & mask_SORT_1 [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=0, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=0] [L21] COND TRUE !(cond) VAL [\old(cond)=0] [L21] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 693 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 517 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 176 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1166 GetRequests, 1116 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=594occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 359 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2368 NumberOfCodeBlocks, 2368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2344 ConstructedInterpolants, 0 QuantifiedInterpolants, 5321 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3463 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 15254/15368 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:24:40,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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.counter_v.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.counter_v.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:24:42,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:24:42,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:24:42,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:24:42,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:24:42,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:24:42,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:24:42,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:24:42,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:24:42,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:24:42,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:24:42,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:24:42,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:24:42,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:24:42,501 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:24:42,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:24:42,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:24:42,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:24:42,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:24:42,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:24:42,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:24:42,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:24:42,508 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:24:42,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:24:42,509 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:24:42,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:24:42,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:24:42,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:24:42,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:24:42,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:24:42,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:24:42,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:24:42,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:24:42,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:24:42,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:24:42,512 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:24:42,513 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:24:42,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:24:42,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:24:42,514 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:24:42,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:24:42,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:24:42,515 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:24:42,515 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:24:42,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:24:42,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:24:42,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:24:42,860 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:24:42,861 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:24:42,867 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.counter_v.yml/witness.yml [2024-08-14 14:24:42,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:24:42,967 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:24:42,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2024-08-14 14:24:44,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:24:44,681 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:24:44,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2024-08-14 14:24:44,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a7de13f/df9306d2071e481ab9f770e4d57777ee/FLAGedf192c0c [2024-08-14 14:24:44,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a7de13f/df9306d2071e481ab9f770e4d57777ee [2024-08-14 14:24:44,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:24:44,714 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:24:44,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:44,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:24:44,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:24:44,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:42" (1/2) ... [2024-08-14 14:24:44,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f0e4a6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:44, skipping insertion in model container [2024-08-14 14:24:44,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:42" (1/2) ... [2024-08-14 14:24:44,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@71b9f131 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:44, skipping insertion in model container [2024-08-14 14:24:44,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:44" (2/2) ... [2024-08-14 14:24:44,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f0e4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:44, skipping insertion in model container [2024-08-14 14:24:44,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:44" (2/2) ... [2024-08-14 14:24:44,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:24:44,913 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.counter_v.c[1249,1262] [2024-08-14 14:24:44,953 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:44,974 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:24:44,986 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.counter_v.c[1249,1262] [2024-08-14 14:24:45,005 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:45,025 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:24:45,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45 WrapperNode [2024-08-14 14:24:45,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:45,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:24:45,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:24:45,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:24:45,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (1/1) ... [2024-08-14 14:24:45,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (1/1) ... [2024-08-14 14:24:45,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (1/1) ... [2024-08-14 14:24:45,067 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:24:45,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (1/1) ... [2024-08-14 14:24:45,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (1/1) ... [2024-08-14 14:24:45,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (1/1) ... [2024-08-14 14:24:45,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (1/1) ... [2024-08-14 14:24:45,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (1/1) ... [2024-08-14 14:24:45,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:24:45,087 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:24:45,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:24:45,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:24:45,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (1/1) ... [2024-08-14 14:24:45,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:24:45,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:45,127 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:24:45,130 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:24:45,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:24:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:24:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:24:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:24:45,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:24:45,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:24:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:24:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:24:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:24:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:24:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:24:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:24:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:24:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:24:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:24:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:24:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:24:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:24:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:24:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:24:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:24:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:24:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:24:45,282 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:24:45,284 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:24:45,517 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-08-14 14:24:45,517 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:24:45,526 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:24:45,527 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:24:45,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:45 BoogieIcfgContainer [2024-08-14 14:24:45,528 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:24:45,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:24:45,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:24:45,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:24:45,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:24:42" (1/4) ... [2024-08-14 14:24:45,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c673ba and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:24:45, skipping insertion in model container [2024-08-14 14:24:45,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:24:44" (2/4) ... [2024-08-14 14:24:45,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c673ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:24:45, skipping insertion in model container [2024-08-14 14:24:45,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:45" (3/4) ... [2024-08-14 14:24:45,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c673ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:24:45, skipping insertion in model container [2024-08-14 14:24:45,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:45" (4/4) ... [2024-08-14 14:24:45,538 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2024-08-14 14:24:45,539 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:24:45,559 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:24:45,562 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:24:45,590 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [45] [2024-08-14 14:24:45,597 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:24:45,716 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 391 states to 222 states. [2024-08-14 14:24:45,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:24:45,744 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;@2b16ffcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:24:45,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:24:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2024-08-14 14:24:45,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-08-14 14:24:45,763 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:45,764 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:45,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:45,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1184366069, now seen corresponding path program 1 times [2024-08-14 14:24:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:24:45,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237790960] [2024-08-14 14:24:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:45,788 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:24:45,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:24:45,791 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:24:45,793 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:24:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:24:46,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:24:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:24:46,428 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:24:46,430 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:24:46,431 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:24:46,443 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:24:46,634 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:24:46,638 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:24:46,644 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:24:46,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:24:46 BoogieIcfgContainer [2024-08-14 14:24:46,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:24:46,709 INFO L158 Benchmark]: Toolchain (without parser) took 1994.95ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 35.9MB in the beginning and 46.7MB in the end (delta: -10.8MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2024-08-14 14:24:46,710 INFO L158 Benchmark]: Witness Parser took 1.26ms. Allocated memory is still 44.0MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 30.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:24:46,710 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 44.0MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:24:46,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.62ms. Allocated memory is still 56.6MB. Free memory was 35.7MB in the beginning and 23.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:24:46,711 INFO L158 Benchmark]: Boogie Preprocessor took 58.57ms. Allocated memory is still 56.6MB. Free memory was 23.0MB in the beginning and 20.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:24:46,711 INFO L158 Benchmark]: IcfgBuilder took 440.69ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 20.6MB in the beginning and 36.8MB in the end (delta: -16.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-14 14:24:46,712 INFO L158 Benchmark]: TraceAbstraction took 1178.36ms. Allocated memory is still 71.3MB. Free memory was 36.1MB in the beginning and 46.7MB in the end (delta: -10.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-08-14 14:24:46,714 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 1.26ms. Allocated memory is still 44.0MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 30.5kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 44.0MB. Free memory is still 24.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.62ms. Allocated memory is still 56.6MB. Free memory was 35.7MB in the beginning and 23.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.57ms. Allocated memory is still 56.6MB. Free memory was 23.0MB in the beginning and 20.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 440.69ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 20.6MB in the beginning and 36.8MB in the end (delta: -16.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1178.36ms. Allocated memory is still 71.3MB. Free memory was 36.1MB in the beginning and 46.7MB in the end (delta: -10.5MB). Peak memory consumption was 12.8MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 1; [L33] const SORT_4 var_8 = 15; [L34] const SORT_1 var_12 = 1; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L39] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] SORT_4 init_7_arg_1 = var_5; [L42] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=2, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=2, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=3, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=3, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=4, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=4, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=5, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=5, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=6, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=6, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=7, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=7, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=8, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=8, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=9, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=9, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=10, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=10, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=11, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=11, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=12, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=12, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=13, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=13, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=14, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) VAL [bad_15_arg_0=0, input_3=1, mask_SORT_1=1, mask_SORT_4=15, state_6=14, var_12=1, var_5=1, var_8=15] [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; VAL [bad_15_arg_0=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=15, var_12=1, var_5=1, var_8=15] [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) VAL [\old(cond)=0] [L21] COND TRUE !(cond) VAL [\old(cond)=0] [L21] 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: 1.0s, OverallIterations: 1, TraceHistogramMax: 15, 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=222occurred 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 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:24:46,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE