./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.cav14_example_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.cav14_example_v.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.cav14_example_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:17,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:24:17,187 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:17,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:24:17,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:24:17,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:24:17,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:24:17,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:24:17,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:24:17,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:24:17,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:24:17,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:24:17,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:24:17,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:24:17,208 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:24:17,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:24:17,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:24:17,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:24:17,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:24:17,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:24:17,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:24:17,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:24:17,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:24:17,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:24:17,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:24:17,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:24:17,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:24:17,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:24:17,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:24:17,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:24:17,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:24:17,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:24:17,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:24:17,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:24:17,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:24:17,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:24:17,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:24:17,215 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:24:17,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:24:17,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:24:17,215 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:17,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:24:17,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:24:17,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:24:17,469 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:24:17,470 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:24:17,471 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.cav14_example_v.yml/witness.yml [2024-08-14 14:24:17,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:24:17,590 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:24:17,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-08-14 14:24:18,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:24:19,054 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:24:19,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-08-14 14:24:19,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dfabc677/fbeedb18021943208f8b53f27050f7e8/FLAG3446d04d0 [2024-08-14 14:24:19,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dfabc677/fbeedb18021943208f8b53f27050f7e8 [2024-08-14 14:24:19,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:24:19,461 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:24:19,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:19,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:24:19,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:24:19,466 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:17" (1/2) ... [2024-08-14 14:24:19,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6517be87 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:19, skipping insertion in model container [2024-08-14 14:24:19,467 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:17" (1/2) ... [2024-08-14 14:24:19,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d72567c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:24:19, skipping insertion in model container [2024-08-14 14:24:19,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:19" (2/2) ... [2024-08-14 14:24:19,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6517be87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:19, skipping insertion in model container [2024-08-14 14:24:19,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:24:19" (2/2) ... [2024-08-14 14:24:19,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:24:19,618 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.cav14_example_v.c[1255,1268] [2024-08-14 14:24:19,656 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:19,671 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:24:19,689 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.cav14_example_v.c[1255,1268] [2024-08-14 14:24:19,705 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:24:19,725 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:24:19,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:19 WrapperNode [2024-08-14 14:24:19,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:24:19,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:24:19,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:24:19,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:24:19,743 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:19" (1/1) ... [2024-08-14 14:24:19,744 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:19" (1/1) ... [2024-08-14 14:24:19,757 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:19" (1/1) ... [2024-08-14 14:24:19,783 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:19,783 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:19" (1/1) ... [2024-08-14 14:24:19,784 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:19" (1/1) ... [2024-08-14 14:24:19,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:19" (1/1) ... [2024-08-14 14:24:19,795 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:19" (1/1) ... [2024-08-14 14:24:19,797 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:19" (1/1) ... [2024-08-14 14:24:19,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:24:19,804 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:24:19,804 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:24:19,804 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:24:19,805 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:19" (1/1) ... [2024-08-14 14:24:19,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:24:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:19,833 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:19,835 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:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:24:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:24:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:24:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:24:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:24:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:24:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:24:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:24:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:24:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:24:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:24:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:24:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:24:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:24:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:24:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:24:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:24:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:24:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:24:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:24:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:24:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:24:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:24:19,974 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:24:19,977 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:24:20,316 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-08-14 14:24:20,316 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:24:20,324 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:24:20,325 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:24:20,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:20 BoogieIcfgContainer [2024-08-14 14:24:20,325 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:24:20,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:24:20,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:24:20,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:24:20,331 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:17" (1/4) ... [2024-08-14 14:24:20,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea1bb4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:24:20, skipping insertion in model container [2024-08-14 14:24:20,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:24:19" (2/4) ... [2024-08-14 14:24:20,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea1bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:24:20, skipping insertion in model container [2024-08-14 14:24:20,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:24:19" (3/4) ... [2024-08-14 14:24:20,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea1bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:24:20, skipping insertion in model container [2024-08-14 14:24:20,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:24:20" (4/4) ... [2024-08-14 14:24:20,334 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2024-08-14 14:24:20,334 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:20,351 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:24:20,352 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:24:20,379 INFO L92 WitnessUtils]: Constructing product of automaton with 51 states and violation witness of the following lengths: [48] [2024-08-14 14:24:20,382 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 51 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 44 states have internal predecessors, (66), 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:20,539 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 1196 states to 1016 states. [2024-08-14 14:24:20,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:24:20,559 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;@2e689955, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:24:20,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:24:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states. [2024-08-14 14:24:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-08-14 14:24:20,592 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:20,593 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:20,594 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:20,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash 791559673, now seen corresponding path program 1 times [2024-08-14 14:24:20,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:20,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820226093] [2024-08-14 14:24:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:24:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-14 14:24:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-08-14 14:24:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-08-14 14:24:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-14 14:24:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-08-14 14:24:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-08-14 14:24:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-08-14 14:24:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-08-14 14:24:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-08-14 14:24:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-14 14:24:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-08-14 14:24:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-08-14 14:24:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-08-14 14:24:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2024-08-14 14:24:22,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:22,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820226093] [2024-08-14 14:24:22,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820226093] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:22,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:22,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:24:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359974467] [2024-08-14 14:24:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:22,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:24:22,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:24:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:24:23,025 INFO L87 Difference]: Start difference. First operand 1016 states. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:23,085 INFO L93 Difference]: Finished difference Result 935 states and 1393 transitions. [2024-08-14 14:24:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:24:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 364 [2024-08-14 14:24:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:23,098 INFO L225 Difference]: With dead ends: 935 [2024-08-14 14:24:23,098 INFO L226 Difference]: Without dead ends: 920 [2024-08-14 14:24:23,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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:23,104 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 33 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 301 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:23,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 301 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:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-08-14 14:24:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 491. [2024-08-14 14:24:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 455 states have (on average 1.5472527472527473) internal successors, (704), 456 states have internal predecessors, (704), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:24:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 739 transitions. [2024-08-14 14:24:23,170 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 739 transitions. Word has length 364 [2024-08-14 14:24:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:23,171 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 739 transitions. [2024-08-14 14:24:23,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 739 transitions. [2024-08-14 14:24:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-08-14 14:24:23,174 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:23,174 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:23,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:24:23,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:23,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:23,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1455130281, now seen corresponding path program 1 times [2024-08-14 14:24:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:23,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790983447] [2024-08-14 14:24:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:24:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-14 14:24:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-08-14 14:24:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-08-14 14:24:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-14 14:24:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-08-14 14:24:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-08-14 14:24:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-08-14 14:24:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-08-14 14:24:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-08-14 14:24:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-14 14:24:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-08-14 14:24:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-08-14 14:24:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-08-14 14:24:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 2445 trivial. 0 not checked. [2024-08-14 14:24:24,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:24,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790983447] [2024-08-14 14:24:24,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790983447] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:24,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:24,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:24:24,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012468515] [2024-08-14 14:24:24,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:24,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:24:24,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:24,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:24:24,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:24:24,209 INFO L87 Difference]: Start difference. First operand 491 states and 739 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:24,240 INFO L93 Difference]: Finished difference Result 523 states and 771 transitions. [2024-08-14 14:24:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:24:24,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 365 [2024-08-14 14:24:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:24,244 INFO L225 Difference]: With dead ends: 523 [2024-08-14 14:24:24,248 INFO L226 Difference]: Without dead ends: 523 [2024-08-14 14:24:24,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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:24,249 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 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:24,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 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:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-08-14 14:24:24,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2024-08-14 14:24:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 485 states have (on average 1.51340206185567) internal successors, (734), 486 states have internal predecessors, (734), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:24:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 769 transitions. [2024-08-14 14:24:24,291 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 769 transitions. Word has length 365 [2024-08-14 14:24:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:24,292 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 769 transitions. [2024-08-14 14:24:24,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 769 transitions. [2024-08-14 14:24:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-08-14 14:24:24,296 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:24,297 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:24,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:24:24,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:24,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1496807158, now seen corresponding path program 1 times [2024-08-14 14:24:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:24,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341188275] [2024-08-14 14:24:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-08-14 14:24:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-08-14 14:24:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-08-14 14:24:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-08-14 14:24:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-08-14 14:24:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-08-14 14:24:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-08-14 14:24:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-08-14 14:24:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-08-14 14:24:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-08-14 14:24:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-08-14 14:24:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-08-14 14:24:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-08-14 14:24:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-08-14 14:24:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 60 proven. 144 refuted. 0 times theorem prover too weak. 2331 trivial. 0 not checked. [2024-08-14 14:24:29,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:29,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341188275] [2024-08-14 14:24:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341188275] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:24:29,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039510441] [2024-08-14 14:24:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:29,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:29,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:29,104 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:29,105 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:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:30,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 166 conjunts are in the unsatisfiable core [2024-08-14 14:24:30,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:24:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 2331 trivial. 0 not checked. [2024-08-14 14:24:30,737 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:24:30,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039510441] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:30,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:24:30,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-08-14 14:24:30,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512356272] [2024-08-14 14:24:30,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:30,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:24:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:30,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:24:30,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:24:30,740 INFO L87 Difference]: Start difference. First operand 521 states and 769 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:30,903 INFO L93 Difference]: Finished difference Result 520 states and 764 transitions. [2024-08-14 14:24:30,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:24:30,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 366 [2024-08-14 14:24:30,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:30,905 INFO L225 Difference]: With dead ends: 520 [2024-08-14 14:24:30,905 INFO L226 Difference]: Without dead ends: 520 [2024-08-14 14:24:30,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-08-14 14:24:30,906 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:30,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 150 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:24:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-08-14 14:24:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-08-14 14:24:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 484 states have (on average 1.506198347107438) internal successors, (729), 485 states have internal predecessors, (729), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:24:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 764 transitions. [2024-08-14 14:24:30,918 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 764 transitions. Word has length 366 [2024-08-14 14:24:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:30,919 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 764 transitions. [2024-08-14 14:24:30,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 764 transitions. [2024-08-14 14:24:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-08-14 14:24:30,923 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:30,923 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:30,947 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:31,127 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:31,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:31,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash 33562664, now seen corresponding path program 1 times [2024-08-14 14:24:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:31,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472355656] [2024-08-14 14:24:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-08-14 14:24:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-08-14 14:24:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-08-14 14:24:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-08-14 14:24:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-08-14 14:24:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-08-14 14:24:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-08-14 14:24:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-08-14 14:24:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-08-14 14:24:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-08-14 14:24:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-08-14 14:24:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-08-14 14:24:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-08-14 14:24:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-08-14 14:24:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 435 proven. 3 refuted. 0 times theorem prover too weak. 2097 trivial. 0 not checked. [2024-08-14 14:24:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472355656] [2024-08-14 14:24:34,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472355656] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:24:34,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269741626] [2024-08-14 14:24:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:34,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:34,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:34,889 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:34,902 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:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:35,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 70 conjunts are in the unsatisfiable core [2024-08-14 14:24:35,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:24:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2024-08-14 14:24:35,848 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:24:35,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269741626] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:35,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:24:35,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2024-08-14 14:24:35,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510921447] [2024-08-14 14:24:35,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:35,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-14 14:24:35,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:35,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-14 14:24:35,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-08-14 14:24:35,850 INFO L87 Difference]: Start difference. First operand 520 states and 764 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:36,125 INFO L93 Difference]: Finished difference Result 523 states and 766 transitions. [2024-08-14 14:24:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 14:24:36,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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 367 [2024-08-14 14:24:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:36,127 INFO L225 Difference]: With dead ends: 523 [2024-08-14 14:24:36,127 INFO L226 Difference]: Without dead ends: 523 [2024-08-14 14:24:36,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2024-08-14 14:24:36,128 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 106 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:36,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 249 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-14 14:24:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-08-14 14:24:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2024-08-14 14:24:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 487 states have (on average 1.5010266940451746) internal successors, (731), 488 states have internal predecessors, (731), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-08-14 14:24:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 766 transitions. [2024-08-14 14:24:36,136 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 766 transitions. Word has length 367 [2024-08-14 14:24:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:36,137 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 766 transitions. [2024-08-14 14:24:36,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 766 transitions. [2024-08-14 14:24:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-08-14 14:24:36,140 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:36,140 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:36,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-14 14:24:36,344 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:36,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:36,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1279735487, now seen corresponding path program 1 times [2024-08-14 14:24:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:36,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165233153] [2024-08-14 14:24:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:24:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-08-14 14:24:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-08-14 14:24:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-08-14 14:24:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-08-14 14:24:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-08-14 14:24:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-08-14 14:24:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-08-14 14:24:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-08-14 14:24:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-08-14 14:24:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-08-14 14:24:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-08-14 14:24:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-08-14 14:24:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-08-14 14:24:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 435 proven. 3 refuted. 0 times theorem prover too weak. 2097 trivial. 0 not checked. [2024-08-14 14:24:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:39,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165233153] [2024-08-14 14:24:39,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165233153] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:24:39,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011273809] [2024-08-14 14:24:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:39,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:39,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:39,674 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:39,685 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:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:41,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 116 conjunts are in the unsatisfiable core [2024-08-14 14:24:41,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:24:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 506 proven. 10 refuted. 0 times theorem prover too weak. 2019 trivial. 0 not checked. [2024-08-14 14:24:41,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:24:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 508 proven. 79 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2024-08-14 14:24:43,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011273809] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:24:43,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:24:43,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 18] total 41 [2024-08-14 14:24:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441621431] [2024-08-14 14:24:43,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:24:43,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-08-14 14:24:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:43,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-08-14 14:24:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2024-08-14 14:24:43,068 INFO L87 Difference]: Start difference. First operand 523 states and 766 transitions. Second operand has 41 states, 41 states have (on average 3.926829268292683) internal successors, (161), 41 states have internal predecessors, (161), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-08-14 14:24:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:45,402 INFO L93 Difference]: Finished difference Result 1968 states and 2870 transitions. [2024-08-14 14:24:45,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-08-14 14:24:45,402 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.926829268292683) internal successors, (161), 41 states have internal predecessors, (161), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 368 [2024-08-14 14:24:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:45,412 INFO L225 Difference]: With dead ends: 1968 [2024-08-14 14:24:45,412 INFO L226 Difference]: Without dead ends: 1968 [2024-08-14 14:24:45,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2643 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=9180, Unknown=0, NotChecked=0, Total=10506 [2024-08-14 14:24:45,416 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 545 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:45,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 899 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-08-14 14:24:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-08-14 14:24:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1196. [2024-08-14 14:24:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1130 states have (on average 1.424778761061947) internal successors, (1610), 1133 states have internal predecessors, (1610), 48 states have call successors, (48), 18 states have call predecessors, (48), 17 states have return successors, (47), 44 states have call predecessors, (47), 47 states have call successors, (47) [2024-08-14 14:24:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1705 transitions. [2024-08-14 14:24:45,441 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1705 transitions. Word has length 368 [2024-08-14 14:24:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:45,442 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1705 transitions. [2024-08-14 14:24:45,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.926829268292683) internal successors, (161), 41 states have internal predecessors, (161), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-08-14 14:24:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1705 transitions. [2024-08-14 14:24:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-08-14 14:24:45,444 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:45,445 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:45,466 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:45,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:45,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:45,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash -156660157, now seen corresponding path program 1 times [2024-08-14 14:24:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:45,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89202215] [2024-08-14 14:24:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:24:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-08-14 14:24:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-08-14 14:24:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-08-14 14:24:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-08-14 14:24:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-08-14 14:24:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-08-14 14:24:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-08-14 14:24:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-08-14 14:24:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-08-14 14:24:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-08-14 14:24:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-08-14 14:24:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-08-14 14:24:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-08-14 14:24:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 540 proven. 3 refuted. 0 times theorem prover too weak. 2097 trivial. 0 not checked. [2024-08-14 14:24:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89202215] [2024-08-14 14:24:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89202215] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:24:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757528867] [2024-08-14 14:24:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:48,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:48,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:24:48,857 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:24:48,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-14 14:24:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:50,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 2569 conjuncts, 38 conjunts are in the unsatisfiable core [2024-08-14 14:24:50,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:24:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 893 proven. 0 refuted. 0 times theorem prover too weak. 1747 trivial. 0 not checked. [2024-08-14 14:24:50,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 14:24:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757528867] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:50,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 14:24:50,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-08-14 14:24:50,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856903072] [2024-08-14 14:24:50,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:50,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:24:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:50,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:24:50,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-08-14 14:24:50,407 INFO L87 Difference]: Start difference. First operand 1196 states and 1705 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:24:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:50,573 INFO L93 Difference]: Finished difference Result 1560 states and 2209 transitions. [2024-08-14 14:24:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:24:50,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 382 [2024-08-14 14:24:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:50,578 INFO L225 Difference]: With dead ends: 1560 [2024-08-14 14:24:50,578 INFO L226 Difference]: Without dead ends: 1560 [2024-08-14 14:24:50,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-08-14 14:24:50,579 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:50,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 310 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:24:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2024-08-14 14:24:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1420. [2024-08-14 14:24:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1354 states have (on average 1.4165435745937962) internal successors, (1918), 1357 states have internal predecessors, (1918), 48 states have call successors, (48), 18 states have call predecessors, (48), 17 states have return successors, (47), 44 states have call predecessors, (47), 47 states have call successors, (47) [2024-08-14 14:24:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2013 transitions. [2024-08-14 14:24:50,596 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2013 transitions. Word has length 382 [2024-08-14 14:24:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:50,596 INFO L495 AbstractCegarLoop]: Abstraction has 1420 states and 2013 transitions. [2024-08-14 14:24:50,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-14 14:24:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2013 transitions. [2024-08-14 14:24:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-08-14 14:24:50,600 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:50,600 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:50,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-14 14:24:50,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:24:50,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:50,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1723022739, now seen corresponding path program 1 times [2024-08-14 14:24:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625918211] [2024-08-14 14:24:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:24:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:24:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:24:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-08-14 14:24:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-08-14 14:24:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-08-14 14:24:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-08-14 14:24:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-08-14 14:24:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-08-14 14:24:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-08-14 14:24:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-08-14 14:24:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-08-14 14:24:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-08-14 14:24:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-08-14 14:24:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-08-14 14:24:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-08-14 14:24:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:24:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 2325 trivial. 0 not checked. [2024-08-14 14:24:56,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:24:56,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625918211] [2024-08-14 14:24:56,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625918211] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:24:56,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:24:56,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 14:24:56,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189141733] [2024-08-14 14:24:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:24:56,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:24:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:24:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:24:56,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:24:56,819 INFO L87 Difference]: Start difference. First operand 1420 states and 2013 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:24:56,996 INFO L93 Difference]: Finished difference Result 1428 states and 2021 transitions. [2024-08-14 14:24:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:24:56,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 382 [2024-08-14 14:24:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:24:57,001 INFO L225 Difference]: With dead ends: 1428 [2024-08-14 14:24:57,001 INFO L226 Difference]: Without dead ends: 1428 [2024-08-14 14:24:57,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-08-14 14:24:57,002 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:24:57,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 223 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:24:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-08-14 14:24:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1420. [2024-08-14 14:24:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1354 states have (on average 1.4158050221565732) internal successors, (1917), 1357 states have internal predecessors, (1917), 48 states have call successors, (48), 18 states have call predecessors, (48), 17 states have return successors, (47), 44 states have call predecessors, (47), 47 states have call successors, (47) [2024-08-14 14:24:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2012 transitions. [2024-08-14 14:24:57,024 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2012 transitions. Word has length 382 [2024-08-14 14:24:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:24:57,025 INFO L495 AbstractCegarLoop]: Abstraction has 1420 states and 2012 transitions. [2024-08-14 14:24:57,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2012 transitions. [2024-08-14 14:24:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-08-14 14:24:57,029 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:24:57,029 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:24:57,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 14:24:57,029 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:24:57,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:24:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1018162418, now seen corresponding path program 1 times [2024-08-14 14:24:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:24:57,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883741088] [2024-08-14 14:24:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:24:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:24:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:25:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:25:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-08-14 14:25:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-08-14 14:25:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-08-14 14:25:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-08-14 14:25:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-08-14 14:25:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-08-14 14:25:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-08-14 14:25:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-08-14 14:25:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-08-14 14:25:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-08-14 14:25:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-08-14 14:25:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-08-14 14:25:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-08-14 14:25:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 704 proven. 31 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-08-14 14:25:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:02,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883741088] [2024-08-14 14:25:02,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883741088] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:02,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349989567] [2024-08-14 14:25:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:02,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:02,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:02,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:02,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-14 14:25:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:04,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 2570 conjuncts, 264 conjunts are in the unsatisfiable core [2024-08-14 14:25:04,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 1337 proven. 468 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2024-08-14 14:25:06,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 1058 proven. 482 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2024-08-14 14:25:10,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349989567] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:10,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:10,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 35, 36] total 77 [2024-08-14 14:25:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564695349] [2024-08-14 14:25:10,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:10,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-08-14 14:25:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-08-14 14:25:10,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=5039, Unknown=0, NotChecked=0, Total=5852 [2024-08-14 14:25:10,616 INFO L87 Difference]: Start difference. First operand 1420 states and 2012 transitions. Second operand has 77 states, 76 states have (on average 4.328947368421052) internal successors, (329), 76 states have internal predecessors, (329), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-08-14 14:25:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:23,760 INFO L93 Difference]: Finished difference Result 5674 states and 7891 transitions. [2024-08-14 14:25:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2024-08-14 14:25:23,760 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 4.328947368421052) internal successors, (329), 76 states have internal predecessors, (329), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 382 [2024-08-14 14:25:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:23,775 INFO L225 Difference]: With dead ends: 5674 [2024-08-14 14:25:23,775 INFO L226 Difference]: Without dead ends: 5674 [2024-08-14 14:25:23,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 765 SyntacticMatches, 0 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30011 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=6848, Invalid=81064, Unknown=0, NotChecked=0, Total=87912 [2024-08-14 14:25:23,787 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 806 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 5390 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 5559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 5390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:23,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 718 Invalid, 5559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 5390 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-08-14 14:25:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5674 states. [2024-08-14 14:25:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5674 to 2645. [2024-08-14 14:25:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2536 states have (on average 1.3655362776025237) internal successors, (3463), 2542 states have internal predecessors, (3463), 91 states have call successors, (91), 18 states have call predecessors, (91), 17 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2024-08-14 14:25:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3644 transitions. [2024-08-14 14:25:23,863 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3644 transitions. Word has length 382 [2024-08-14 14:25:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:23,863 INFO L495 AbstractCegarLoop]: Abstraction has 2645 states and 3644 transitions. [2024-08-14 14:25:23,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 4.328947368421052) internal successors, (329), 76 states have internal predecessors, (329), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-08-14 14:25:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3644 transitions. [2024-08-14 14:25:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-08-14 14:25:23,868 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:23,868 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:23,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-08-14 14:25:24,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:24,073 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:24,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1297150083, now seen corresponding path program 1 times [2024-08-14 14:25:24,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:24,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436460698] [2024-08-14 14:25:24,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:25:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:25:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:25:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-14 14:25:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-08-14 14:25:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-08-14 14:25:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-08-14 14:25:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-08-14 14:25:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-08-14 14:25:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-08-14 14:25:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-08-14 14:25:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-08-14 14:25:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-08-14 14:25:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-08-14 14:25:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-08-14 14:25:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 2429 trivial. 0 not checked. [2024-08-14 14:25:28,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436460698] [2024-08-14 14:25:28,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436460698] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:25:28,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:25:28,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:25:28,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140067528] [2024-08-14 14:25:28,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:25:28,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:25:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:28,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:25:28,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:25:28,230 INFO L87 Difference]: Start difference. First operand 2645 states and 3644 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:25:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:28,307 INFO L93 Difference]: Finished difference Result 2947 states and 3997 transitions. [2024-08-14 14:25:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 14:25:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 389 [2024-08-14 14:25:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:28,315 INFO L225 Difference]: With dead ends: 2947 [2024-08-14 14:25:28,315 INFO L226 Difference]: Without dead ends: 2947 [2024-08-14 14:25:28,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-08-14 14:25:28,316 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:28,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 454 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:25:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2024-08-14 14:25:28,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2574. [2024-08-14 14:25:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2574 states, 2466 states have (on average 1.3515815085158152) internal successors, (3333), 2471 states have internal predecessors, (3333), 90 states have call successors, (90), 18 states have call predecessors, (90), 17 states have return successors, (89), 84 states have call predecessors, (89), 89 states have call successors, (89) [2024-08-14 14:25:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 3512 transitions. [2024-08-14 14:25:28,365 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 3512 transitions. Word has length 389 [2024-08-14 14:25:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:28,365 INFO L495 AbstractCegarLoop]: Abstraction has 2574 states and 3512 transitions. [2024-08-14 14:25:28,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:25:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3512 transitions. [2024-08-14 14:25:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-08-14 14:25:28,370 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:28,371 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 8, 7, 7, 7, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:28,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-14 14:25:28,371 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:28,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash 887632449, now seen corresponding path program 2 times [2024-08-14 14:25:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:28,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510531523] [2024-08-14 14:25:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:25:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:25:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:25:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:25:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-08-14 14:25:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-08-14 14:25:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-08-14 14:25:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-08-14 14:25:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-08-14 14:25:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-08-14 14:25:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-08-14 14:25:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-08-14 14:25:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-08-14 14:25:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-08-14 14:25:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-08-14 14:25:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 1137 proven. 64 refuted. 0 times theorem prover too weak. 1435 trivial. 0 not checked. [2024-08-14 14:25:33,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:33,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510531523] [2024-08-14 14:25:33,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510531523] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:33,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936575176] [2024-08-14 14:25:33,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:25:33,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:33,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:33,569 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:33,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-14 14:25:34,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:25:34,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:25:34,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 86 conjunts are in the unsatisfiable core [2024-08-14 14:25:34,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 1270 proven. 148 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2024-08-14 14:25:35,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 1096 proven. 24 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2024-08-14 14:25:35,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936575176] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:35,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 17] total 36 [2024-08-14 14:25:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905466308] [2024-08-14 14:25:35,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:35,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-08-14 14:25:35,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:35,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-08-14 14:25:35,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2024-08-14 14:25:35,968 INFO L87 Difference]: Start difference. First operand 2574 states and 3512 transitions. Second operand has 36 states, 35 states have (on average 7.228571428571429) internal successors, (253), 35 states have internal predecessors, (253), 10 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-08-14 14:25:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:25:39,900 INFO L93 Difference]: Finished difference Result 6646 states and 8761 transitions. [2024-08-14 14:25:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-08-14 14:25:39,901 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 7.228571428571429) internal successors, (253), 35 states have internal predecessors, (253), 10 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 390 [2024-08-14 14:25:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:25:39,918 INFO L225 Difference]: With dead ends: 6646 [2024-08-14 14:25:39,918 INFO L226 Difference]: Without dead ends: 6542 [2024-08-14 14:25:39,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 809 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3272 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1252, Invalid=12320, Unknown=0, NotChecked=0, Total=13572 [2024-08-14 14:25:39,921 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 287 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 3017 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:25:39,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1210 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3017 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-08-14 14:25:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6542 states. [2024-08-14 14:25:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6542 to 3538. [2024-08-14 14:25:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3538 states, 3321 states have (on average 1.33935561577838) internal successors, (4448), 3408 states have internal predecessors, (4448), 185 states have call successors, (185), 32 states have call predecessors, (185), 31 states have return successors, (184), 97 states have call predecessors, (184), 184 states have call successors, (184) [2024-08-14 14:25:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 4817 transitions. [2024-08-14 14:25:39,999 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 4817 transitions. Word has length 390 [2024-08-14 14:25:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:25:39,999 INFO L495 AbstractCegarLoop]: Abstraction has 3538 states and 4817 transitions. [2024-08-14 14:25:39,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 7.228571428571429) internal successors, (253), 35 states have internal predecessors, (253), 10 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-08-14 14:25:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 4817 transitions. [2024-08-14 14:25:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-08-14 14:25:40,007 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:25:40,007 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 12, 8, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:25:40,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-14 14:25:40,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:40,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:25:40,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:25:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1437025119, now seen corresponding path program 3 times [2024-08-14 14:25:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:25:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976909937] [2024-08-14 14:25:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:25:40,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:25:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:25:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:25:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:25:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:25:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:25:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-08-14 14:25:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-08-14 14:25:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-08-14 14:25:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-08-14 14:25:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-08-14 14:25:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-08-14 14:25:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-08-14 14:25:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-08-14 14:25:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-08-14 14:25:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-08-14 14:25:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-08-14 14:25:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:25:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 936 proven. 53 refuted. 0 times theorem prover too weak. 1647 trivial. 0 not checked. [2024-08-14 14:25:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:25:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976909937] [2024-08-14 14:25:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976909937] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:25:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745873541] [2024-08-14 14:25:48,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 14:25:48,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:25:48,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:25:48,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:25:48,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-14 14:25:49,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-08-14 14:25:49,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:25:49,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 178 conjunts are in the unsatisfiable core [2024-08-14 14:25:49,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:25:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 488 proven. 130 refuted. 0 times theorem prover too weak. 2018 trivial. 0 not checked. [2024-08-14 14:25:52,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:25:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 548 proven. 12 refuted. 0 times theorem prover too weak. 2076 trivial. 0 not checked. [2024-08-14 14:25:54,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745873541] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:25:54,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:25:54,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 32] total 53 [2024-08-14 14:25:54,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645107534] [2024-08-14 14:25:54,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:25:54,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-08-14 14:25:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:25:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-08-14 14:25:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2557, Unknown=0, NotChecked=0, Total=2756 [2024-08-14 14:25:54,188 INFO L87 Difference]: Start difference. First operand 3538 states and 4817 transitions. Second operand has 53 states, 52 states have (on average 4.0) internal successors, (208), 52 states have internal predecessors, (208), 7 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-08-14 14:26:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:13,325 INFO L93 Difference]: Finished difference Result 14712 states and 19265 transitions. [2024-08-14 14:26:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2024-08-14 14:26:13,326 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 4.0) internal successors, (208), 52 states have internal predecessors, (208), 7 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 390 [2024-08-14 14:26:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:13,357 INFO L225 Difference]: With dead ends: 14712 [2024-08-14 14:26:13,357 INFO L226 Difference]: Without dead ends: 13399 [2024-08-14 14:26:13,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 826 SyntacticMatches, 1 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29459 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=5989, Invalid=80153, Unknown=0, NotChecked=0, Total=86142 [2024-08-14 14:26:13,367 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 786 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 8253 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 8352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 8253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:13,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 586 Invalid, 8352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 8253 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-08-14 14:26:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13399 states. [2024-08-14 14:26:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13399 to 5060. [2024-08-14 14:26:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5060 states, 4786 states have (on average 1.3397409109903886) internal successors, (6412), 4888 states have internal predecessors, (6412), 242 states have call successors, (242), 32 states have call predecessors, (242), 31 states have return successors, (241), 139 states have call predecessors, (241), 241 states have call successors, (241) [2024-08-14 14:26:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 6895 transitions. [2024-08-14 14:26:13,528 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 6895 transitions. Word has length 390 [2024-08-14 14:26:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:13,528 INFO L495 AbstractCegarLoop]: Abstraction has 5060 states and 6895 transitions. [2024-08-14 14:26:13,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.0) internal successors, (208), 52 states have internal predecessors, (208), 7 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-08-14 14:26:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 6895 transitions. [2024-08-14 14:26:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-08-14 14:26:13,537 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:13,537 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:13,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-08-14 14:26:13,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:13,738 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:13,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash 565090753, now seen corresponding path program 1 times [2024-08-14 14:26:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:13,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83370163] [2024-08-14 14:26:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:26:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:26:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-08-14 14:26:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-14 14:26:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-08-14 14:26:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-08-14 14:26:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-08-14 14:26:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-08-14 14:26:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-08-14 14:26:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-08-14 14:26:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-08-14 14:26:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-08-14 14:26:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-08-14 14:26:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-08-14 14:26:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-08-14 14:26:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 729 proven. 19 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2024-08-14 14:26:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:21,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83370163] [2024-08-14 14:26:21,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83370163] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:21,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371237792] [2024-08-14 14:26:21,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:21,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:21,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:21,156 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:21,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-14 14:26:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:23,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 79 conjunts are in the unsatisfiable core [2024-08-14 14:26:23,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 628 proven. 1128 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2024-08-14 14:26:24,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 873 proven. 1041 refuted. 0 times theorem prover too weak. 803 trivial. 0 not checked. [2024-08-14 14:26:25,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371237792] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:25,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:25,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 19] total 44 [2024-08-14 14:26:25,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321212126] [2024-08-14 14:26:25,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:25,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-08-14 14:26:25,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:25,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-08-14 14:26:25,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1501, Unknown=0, NotChecked=0, Total=1892 [2024-08-14 14:26:25,912 INFO L87 Difference]: Start difference. First operand 5060 states and 6895 transitions. Second operand has 44 states, 44 states have (on average 6.5227272727272725) internal successors, (287), 44 states have internal predecessors, (287), 13 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-08-14 14:26:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:27,671 INFO L93 Difference]: Finished difference Result 6583 states and 8880 transitions. [2024-08-14 14:26:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-08-14 14:26:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.5227272727272725) internal successors, (287), 44 states have internal predecessors, (287), 13 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 396 [2024-08-14 14:26:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:27,681 INFO L225 Difference]: With dead ends: 6583 [2024-08-14 14:26:27,682 INFO L226 Difference]: Without dead ends: 6583 [2024-08-14 14:26:27,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1148, Invalid=5332, Unknown=0, NotChecked=0, Total=6480 [2024-08-14 14:26:27,683 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 309 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:27,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 596 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-08-14 14:26:27,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6583 states. [2024-08-14 14:26:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6583 to 5312. [2024-08-14 14:26:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5312 states, 5038 states have (on average 1.333862643906312) internal successors, (6720), 5140 states have internal predecessors, (6720), 242 states have call successors, (242), 32 states have call predecessors, (242), 31 states have return successors, (241), 139 states have call predecessors, (241), 241 states have call successors, (241) [2024-08-14 14:26:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 7203 transitions. [2024-08-14 14:26:27,752 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 7203 transitions. Word has length 396 [2024-08-14 14:26:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:27,753 INFO L495 AbstractCegarLoop]: Abstraction has 5312 states and 7203 transitions. [2024-08-14 14:26:27,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.5227272727272725) internal successors, (287), 44 states have internal predecessors, (287), 13 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-08-14 14:26:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 7203 transitions. [2024-08-14 14:26:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-08-14 14:26:27,762 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:27,762 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:27,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-08-14 14:26:27,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-08-14 14:26:27,963 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:27,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash -663083850, now seen corresponding path program 1 times [2024-08-14 14:26:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:27,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816411145] [2024-08-14 14:26:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:26:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:26:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-08-14 14:26:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:26:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:26:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-08-14 14:26:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-08-14 14:26:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-08-14 14:26:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-08-14 14:26:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-08-14 14:26:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-08-14 14:26:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-08-14 14:26:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-08-14 14:26:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-08-14 14:26:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-08-14 14:26:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 1198 proven. 56 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2024-08-14 14:26:32,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:32,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816411145] [2024-08-14 14:26:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816411145] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:32,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602404687] [2024-08-14 14:26:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:32,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:32,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:32,448 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:32,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-08-14 14:26:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:34,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 160 conjunts are in the unsatisfiable core [2024-08-14 14:26:34,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:26:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 1066 proven. 51 refuted. 0 times theorem prover too weak. 1523 trivial. 0 not checked. [2024-08-14 14:26:35,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:26:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 1558 proven. 195 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2024-08-14 14:26:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602404687] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:26:37,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:26:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 33] total 54 [2024-08-14 14:26:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718239070] [2024-08-14 14:26:37,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:26:37,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-08-14 14:26:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:26:37,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-08-14 14:26:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2610, Unknown=0, NotChecked=0, Total=2862 [2024-08-14 14:26:37,579 INFO L87 Difference]: Start difference. First operand 5312 states and 7203 transitions. Second operand has 54 states, 53 states have (on average 5.622641509433962) internal successors, (298), 53 states have internal predecessors, (298), 12 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-08-14 14:26:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:26:47,542 INFO L93 Difference]: Finished difference Result 10930 states and 14661 transitions. [2024-08-14 14:26:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2024-08-14 14:26:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 5.622641509433962) internal successors, (298), 53 states have internal predecessors, (298), 12 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 397 [2024-08-14 14:26:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:26:47,559 INFO L225 Difference]: With dead ends: 10930 [2024-08-14 14:26:47,559 INFO L226 Difference]: Without dead ends: 10930 [2024-08-14 14:26:47,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 803 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14954 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3517, Invalid=44225, Unknown=0, NotChecked=0, Total=47742 [2024-08-14 14:26:47,566 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 554 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 5596 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 5649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 5596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:26:47,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 484 Invalid, 5649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 5596 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-08-14 14:26:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2024-08-14 14:26:47,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 5472. [2024-08-14 14:26:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5472 states, 5183 states have (on average 1.3357129075824812) internal successors, (6923), 5300 states have internal predecessors, (6923), 257 states have call successors, (257), 32 states have call predecessors, (257), 31 states have return successors, (256), 139 states have call predecessors, (256), 256 states have call successors, (256) [2024-08-14 14:26:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5472 states to 5472 states and 7436 transitions. [2024-08-14 14:26:47,658 INFO L78 Accepts]: Start accepts. Automaton has 5472 states and 7436 transitions. Word has length 397 [2024-08-14 14:26:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:26:47,658 INFO L495 AbstractCegarLoop]: Abstraction has 5472 states and 7436 transitions. [2024-08-14 14:26:47,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 5.622641509433962) internal successors, (298), 53 states have internal predecessors, (298), 12 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-08-14 14:26:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states and 7436 transitions. [2024-08-14 14:26:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-08-14 14:26:47,673 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:26:47,673 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 13, 13, 12, 8, 8, 8, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:26:47,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-08-14 14:26:47,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-08-14 14:26:47,878 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:26:47,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:26:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash 407735429, now seen corresponding path program 2 times [2024-08-14 14:26:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:26:47,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345275821] [2024-08-14 14:26:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:26:47,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:26:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:26:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:26:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:26:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-08-14 14:26:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-14 14:26:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:26:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-08-14 14:26:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-08-14 14:26:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-08-14 14:26:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-08-14 14:26:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-08-14 14:26:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-08-14 14:26:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-08-14 14:26:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-08-14 14:26:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-08-14 14:26:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-08-14 14:26:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:26:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 935 proven. 138 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2024-08-14 14:26:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:26:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345275821] [2024-08-14 14:26:55,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345275821] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:26:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782066733] [2024-08-14 14:26:55,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:26:55,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:26:55,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:26:55,819 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:26:55,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-08-14 14:26:58,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:26:58,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:26:58,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 2627 conjuncts, 152 conjunts are in the unsatisfiable core [2024-08-14 14:26:58,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:27:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 472 proven. 1162 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-08-14 14:27:01,679 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:27:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 1256 proven. 206 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-08-14 14:27:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782066733] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:27:04,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:27:04,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 30, 24] total 64 [2024-08-14 14:27:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234652650] [2024-08-14 14:27:04,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:27:04,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-08-14 14:27:04,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:04,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-08-14 14:27:04,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3737, Unknown=0, NotChecked=0, Total=4032 [2024-08-14 14:27:04,418 INFO L87 Difference]: Start difference. First operand 5472 states and 7436 transitions. Second operand has 64 states, 63 states have (on average 5.634920634920635) internal successors, (355), 63 states have internal predecessors, (355), 15 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-08-14 14:27:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:44,530 INFO L93 Difference]: Finished difference Result 24422 states and 32128 transitions. [2024-08-14 14:27:44,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 642 states. [2024-08-14 14:27:44,530 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 5.634920634920635) internal successors, (355), 63 states have internal predecessors, (355), 15 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 397 [2024-08-14 14:27:44,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:44,555 INFO L225 Difference]: With dead ends: 24422 [2024-08-14 14:27:44,555 INFO L226 Difference]: Without dead ends: 22558 [2024-08-14 14:27:44,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1601 GetRequests, 899 SyntacticMatches, 1 SemanticMatches, 701 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208291 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=21692, Invalid=471814, Unknown=0, NotChecked=0, Total=493506 [2024-08-14 14:27:44,585 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 2180 mSDsluCounter, 2473 mSDsCounter, 0 mSdLazyCounter, 16772 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 16931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 16772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:44,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2551 Invalid, 16931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 16772 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2024-08-14 14:27:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22558 states. [2024-08-14 14:27:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22558 to 9653. [2024-08-14 14:27:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9653 states, 9175 states have (on average 1.3455040871934605) internal successors, (12345), 9363 states have internal predecessors, (12345), 446 states have call successors, (446), 32 states have call predecessors, (446), 31 states have return successors, (444), 257 states have call predecessors, (444), 444 states have call successors, (444) [2024-08-14 14:27:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 13235 transitions. [2024-08-14 14:27:44,759 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 13235 transitions. Word has length 397 [2024-08-14 14:27:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:44,759 INFO L495 AbstractCegarLoop]: Abstraction has 9653 states and 13235 transitions. [2024-08-14 14:27:44,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 5.634920634920635) internal successors, (355), 63 states have internal predecessors, (355), 15 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-08-14 14:27:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 13235 transitions. [2024-08-14 14:27:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-08-14 14:27:44,776 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:44,776 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 11, 9, 8, 8, 8, 7, 7, 7, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:44,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-08-14 14:27:44,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-08-14 14:27:44,978 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:44,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash -832868814, now seen corresponding path program 1 times [2024-08-14 14:27:44,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:44,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919284363] [2024-08-14 14:27:44,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:27:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:27:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:27:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-14 14:27:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:27:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-08-14 14:27:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-08-14 14:27:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-08-14 14:27:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-08-14 14:27:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-08-14 14:27:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-08-14 14:27:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2024-08-14 14:27:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-08-14 14:27:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-08-14 14:27:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-08-14 14:27:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2675 backedges. 789 proven. 38 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2024-08-14 14:27:53,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:53,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919284363] [2024-08-14 14:27:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919284363] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:27:53,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444592704] [2024-08-14 14:27:53,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:53,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:27:53,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:53,269 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:27:53,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-08-14 14:27:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:54,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 85 conjunts are in the unsatisfiable core [2024-08-14 14:27:54,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:27:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2675 backedges. 571 proven. 312 refuted. 0 times theorem prover too weak. 1792 trivial. 0 not checked. [2024-08-14 14:27:56,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:27:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2675 backedges. 742 proven. 253 refuted. 0 times theorem prover too weak. 1680 trivial. 0 not checked. [2024-08-14 14:27:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444592704] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:27:58,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:27:58,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 46 [2024-08-14 14:27:58,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485716648] [2024-08-14 14:27:58,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:27:58,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-08-14 14:27:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-08-14 14:27:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2024-08-14 14:27:58,044 INFO L87 Difference]: Start difference. First operand 9653 states and 13235 transitions. Second operand has 46 states, 46 states have (on average 5.978260869565218) internal successors, (275), 46 states have internal predecessors, (275), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-08-14 14:28:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:02,038 INFO L93 Difference]: Finished difference Result 7706 states and 9922 transitions. [2024-08-14 14:28:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-08-14 14:28:02,039 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.978260869565218) internal successors, (275), 46 states have internal predecessors, (275), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 401 [2024-08-14 14:28:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:02,063 INFO L225 Difference]: With dead ends: 7706 [2024-08-14 14:28:02,063 INFO L226 Difference]: Without dead ends: 7566 [2024-08-14 14:28:02,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2947 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1601, Invalid=11281, Unknown=0, NotChecked=0, Total=12882 [2024-08-14 14:28:02,065 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 488 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 2884 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:02,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 393 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2884 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-08-14 14:28:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7566 states. [2024-08-14 14:28:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7566 to 5938. [2024-08-14 14:28:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5938 states, 5621 states have (on average 1.2937199786514855) internal successors, (7272), 5738 states have internal predecessors, (7272), 285 states have call successors, (285), 32 states have call predecessors, (285), 31 states have return successors, (284), 167 states have call predecessors, (284), 284 states have call successors, (284) [2024-08-14 14:28:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5938 states to 5938 states and 7841 transitions. [2024-08-14 14:28:02,148 INFO L78 Accepts]: Start accepts. Automaton has 5938 states and 7841 transitions. Word has length 401 [2024-08-14 14:28:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:02,149 INFO L495 AbstractCegarLoop]: Abstraction has 5938 states and 7841 transitions. [2024-08-14 14:28:02,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.978260869565218) internal successors, (275), 46 states have internal predecessors, (275), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-08-14 14:28:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5938 states and 7841 transitions. [2024-08-14 14:28:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-08-14 14:28:02,160 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:02,160 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 11, 10, 9, 8, 7, 6, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:02,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-08-14 14:28:02,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-08-14 14:28:02,365 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:02,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1428145989, now seen corresponding path program 1 times [2024-08-14 14:28:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647528540] [2024-08-14 14:28:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:28:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-08-14 14:28:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-14 14:28:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:28:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-08-14 14:28:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-08-14 14:28:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-08-14 14:28:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-08-14 14:28:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-08-14 14:28:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-08-14 14:28:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-08-14 14:28:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-08-14 14:28:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-08-14 14:28:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-08-14 14:28:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2683 backedges. 1304 proven. 0 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2024-08-14 14:28:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:06,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647528540] [2024-08-14 14:28:06,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647528540] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:06,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:06,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:28:06,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935309014] [2024-08-14 14:28:06,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:06,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:28:06,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:06,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:28:06,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:28:06,964 INFO L87 Difference]: Start difference. First operand 5938 states and 7841 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-08-14 14:28:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:07,137 INFO L93 Difference]: Finished difference Result 5938 states and 7701 transitions. [2024-08-14 14:28:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:28:07,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 403 [2024-08-14 14:28:07,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:07,149 INFO L225 Difference]: With dead ends: 5938 [2024-08-14 14:28:07,153 INFO L226 Difference]: Without dead ends: 5938 [2024-08-14 14:28:07,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:28:07,154 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:07,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 230 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:28:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5938 states. [2024-08-14 14:28:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5938 to 5154. [2024-08-14 14:28:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 4851 states have (on average 1.2710781282209853) internal successors, (6166), 4968 states have internal predecessors, (6166), 271 states have call successors, (271), 32 states have call predecessors, (271), 31 states have return successors, (270), 153 states have call predecessors, (270), 270 states have call successors, (270) [2024-08-14 14:28:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 6707 transitions. [2024-08-14 14:28:07,216 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 6707 transitions. Word has length 403 [2024-08-14 14:28:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:07,217 INFO L495 AbstractCegarLoop]: Abstraction has 5154 states and 6707 transitions. [2024-08-14 14:28:07,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-08-14 14:28:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 6707 transitions. [2024-08-14 14:28:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-08-14 14:28:07,225 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:07,225 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 10, 10, 10, 9, 9, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:07,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-08-14 14:28:07,226 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:07,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:07,227 INFO L85 PathProgramCache]: Analyzing trace with hash 932935530, now seen corresponding path program 1 times [2024-08-14 14:28:07,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:07,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298972893] [2024-08-14 14:28:07,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:07,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-08-14 14:28:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-08-14 14:28:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-14 14:28:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-08-14 14:28:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-08-14 14:28:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-08-14 14:28:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-08-14 14:28:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-08-14 14:28:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-08-14 14:28:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-08-14 14:28:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-08-14 14:28:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-08-14 14:28:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-08-14 14:28:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-08-14 14:28:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2682 backedges. 716 proven. 246 refuted. 0 times theorem prover too weak. 1720 trivial. 0 not checked. [2024-08-14 14:28:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298972893] [2024-08-14 14:28:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298972893] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530559902] [2024-08-14 14:28:13,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:13,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:13,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:13,043 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:28:13,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-08-14 14:28:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:15,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 2650 conjuncts, 142 conjunts are in the unsatisfiable core [2024-08-14 14:28:15,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2682 backedges. 1183 proven. 459 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-08-14 14:28:18,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:28:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2682 backedges. 1093 proven. 709 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2024-08-14 14:28:23,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530559902] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:28:23,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:28:23,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 21] total 44 [2024-08-14 14:28:23,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797894872] [2024-08-14 14:28:23,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:28:23,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-08-14 14:28:23,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:23,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-08-14 14:28:23,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2024-08-14 14:28:23,708 INFO L87 Difference]: Start difference. First operand 5154 states and 6707 transitions. Second operand has 44 states, 44 states have (on average 8.477272727272727) internal successors, (373), 44 states have internal predecessors, (373), 14 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-08-14 14:28:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:27,108 INFO L93 Difference]: Finished difference Result 6266 states and 7875 transitions. [2024-08-14 14:28:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-14 14:28:27,109 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 8.477272727272727) internal successors, (373), 44 states have internal predecessors, (373), 14 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 405 [2024-08-14 14:28:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:27,116 INFO L225 Difference]: With dead ends: 6266 [2024-08-14 14:28:27,117 INFO L226 Difference]: Without dead ends: 6266 [2024-08-14 14:28:27,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 808 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1882, Invalid=9038, Unknown=0, NotChecked=0, Total=10920 [2024-08-14 14:28:27,118 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 349 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:27,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 865 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-08-14 14:28:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6266 states. [2024-08-14 14:28:27,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 5239. [2024-08-14 14:28:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5239 states, 4942 states have (on average 1.264467826790773) internal successors, (6249), 5057 states have internal predecessors, (6249), 265 states have call successors, (265), 32 states have call predecessors, (265), 31 states have return successors, (264), 149 states have call predecessors, (264), 264 states have call successors, (264) [2024-08-14 14:28:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 6778 transitions. [2024-08-14 14:28:27,175 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 6778 transitions. Word has length 405 [2024-08-14 14:28:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:27,176 INFO L495 AbstractCegarLoop]: Abstraction has 5239 states and 6778 transitions. [2024-08-14 14:28:27,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 8.477272727272727) internal successors, (373), 44 states have internal predecessors, (373), 14 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-08-14 14:28:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 6778 transitions. [2024-08-14 14:28:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-08-14 14:28:27,183 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:27,183 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 10, 10, 10, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:27,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-08-14 14:28:27,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-08-14 14:28:27,388 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:27,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash 751351316, now seen corresponding path program 2 times [2024-08-14 14:28:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:27,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79735059] [2024-08-14 14:28:27,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:28:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:28:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:28:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:28:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-08-14 14:28:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-08-14 14:28:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-08-14 14:28:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-08-14 14:28:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-08-14 14:28:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-08-14 14:28:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-08-14 14:28:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-08-14 14:28:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-08-14 14:28:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-08-14 14:28:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2697 backedges. 1074 proven. 74 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2024-08-14 14:28:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79735059] [2024-08-14 14:28:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79735059] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:28:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468801802] [2024-08-14 14:28:32,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 14:28:32,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:28:32,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:28:32,485 INFO L229 MonitoredProcess]: Starting monitored process 14 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:28:32,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-08-14 14:28:34,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 14:28:34,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:28:34,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 2651 conjuncts, 110 conjunts are in the unsatisfiable core [2024-08-14 14:28:34,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:28:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2697 backedges. 317 proven. 1165 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2024-08-14 14:28:36,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:28:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2697 backedges. 886 proven. 546 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2024-08-14 14:28:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468801802] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:28:40,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:28:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 25] total 50 [2024-08-14 14:28:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080544551] [2024-08-14 14:28:40,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:28:40,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-08-14 14:28:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:40,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-08-14 14:28:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2249, Unknown=0, NotChecked=0, Total=2450 [2024-08-14 14:28:40,593 INFO L87 Difference]: Start difference. First operand 5239 states and 6778 transitions. Second operand has 50 states, 49 states have (on average 7.122448979591836) internal successors, (349), 49 states have internal predecessors, (349), 16 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-08-14 14:28:46,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:46,100 INFO L93 Difference]: Finished difference Result 11052 states and 13644 transitions. [2024-08-14 14:28:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-08-14 14:28:46,100 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 7.122448979591836) internal successors, (349), 49 states have internal predecessors, (349), 16 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 405 [2024-08-14 14:28:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:46,114 INFO L225 Difference]: With dead ends: 11052 [2024-08-14 14:28:46,114 INFO L226 Difference]: Without dead ends: 11052 [2024-08-14 14:28:46,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 805 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5580 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1988, Invalid=19768, Unknown=0, NotChecked=0, Total=21756 [2024-08-14 14:28:46,117 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 574 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:46,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1080 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-08-14 14:28:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11052 states. [2024-08-14 14:28:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11052 to 5335. [2024-08-14 14:28:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5335 states, 5038 states have (on average 1.259428344581183) internal successors, (6345), 5153 states have internal predecessors, (6345), 265 states have call successors, (265), 32 states have call predecessors, (265), 31 states have return successors, (264), 149 states have call predecessors, (264), 264 states have call successors, (264) [2024-08-14 14:28:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5335 states to 5335 states and 6874 transitions. [2024-08-14 14:28:46,192 INFO L78 Accepts]: Start accepts. Automaton has 5335 states and 6874 transitions. Word has length 405 [2024-08-14 14:28:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:46,193 INFO L495 AbstractCegarLoop]: Abstraction has 5335 states and 6874 transitions. [2024-08-14 14:28:46,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 7.122448979591836) internal successors, (349), 49 states have internal predecessors, (349), 16 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-08-14 14:28:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5335 states and 6874 transitions. [2024-08-14 14:28:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-08-14 14:28:46,199 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:46,199 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 13, 12, 11, 9, 9, 8, 8, 8, 8, 7, 7, 6, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:46,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-08-14 14:28:46,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-08-14 14:28:46,404 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:46,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1645447625, now seen corresponding path program 1 times [2024-08-14 14:28:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:46,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129939001] [2024-08-14 14:28:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:28:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:28:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:28:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:28:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:28:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:28:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-08-14 14:28:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-08-14 14:28:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-08-14 14:28:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-08-14 14:28:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-08-14 14:28:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-08-14 14:28:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2024-08-14 14:28:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-08-14 14:28:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-08-14 14:28:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-08-14 14:28:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:28:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 1197 proven. 0 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2024-08-14 14:28:52,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:28:52,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129939001] [2024-08-14 14:28:52,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129939001] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:28:52,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:28:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:28:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483855479] [2024-08-14 14:28:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:28:52,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:28:52,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:28:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:28:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:28:52,325 INFO L87 Difference]: Start difference. First operand 5335 states and 6874 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-08-14 14:28:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:28:52,390 INFO L93 Difference]: Finished difference Result 5628 states and 7101 transitions. [2024-08-14 14:28:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 14:28:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 406 [2024-08-14 14:28:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:28:52,400 INFO L225 Difference]: With dead ends: 5628 [2024-08-14 14:28:52,400 INFO L226 Difference]: Without dead ends: 5628 [2024-08-14 14:28:52,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-08-14 14:28:52,401 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 38 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:28:52,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 418 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:28:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5628 states. [2024-08-14 14:28:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5628 to 4932. [2024-08-14 14:28:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4932 states, 4635 states have (on average 1.2496224379719525) internal successors, (5792), 4750 states have internal predecessors, (5792), 265 states have call successors, (265), 32 states have call predecessors, (265), 31 states have return successors, (264), 149 states have call predecessors, (264), 264 states have call successors, (264) [2024-08-14 14:28:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 6321 transitions. [2024-08-14 14:28:52,453 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 6321 transitions. Word has length 406 [2024-08-14 14:28:52,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:28:52,453 INFO L495 AbstractCegarLoop]: Abstraction has 4932 states and 6321 transitions. [2024-08-14 14:28:52,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-08-14 14:28:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 6321 transitions. [2024-08-14 14:28:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-08-14 14:28:52,459 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:28:52,459 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 11, 11, 11, 10, 8, 8, 8, 7, 7, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:28:52,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-08-14 14:28:52,459 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:28:52,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:28:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1015888343, now seen corresponding path program 3 times [2024-08-14 14:28:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:28:52,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72860421] [2024-08-14 14:28:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:28:52,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:28:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:29:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:29:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:29:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:29:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-08-14 14:29:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-08-14 14:29:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-08-14 14:29:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-08-14 14:29:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-08-14 14:29:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-08-14 14:29:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2024-08-14 14:29:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-08-14 14:29:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-08-14 14:29:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-08-14 14:29:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2697 backedges. 1209 proven. 167 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2024-08-14 14:29:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:01,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72860421] [2024-08-14 14:29:01,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72860421] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:01,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756174796] [2024-08-14 14:29:01,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 14:29:01,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:01,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:01,474 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:29:01,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-08-14 14:29:02,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-08-14 14:29:02,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:29:02,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 108 conjunts are in the unsatisfiable core [2024-08-14 14:29:02,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2697 backedges. 224 proven. 606 refuted. 0 times theorem prover too weak. 1867 trivial. 0 not checked. [2024-08-14 14:29:04,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2697 backedges. 151 proven. 663 refuted. 0 times theorem prover too weak. 1883 trivial. 0 not checked. [2024-08-14 14:29:08,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756174796] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:29:08,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:29:08,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 20] total 45 [2024-08-14 14:29:08,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874902353] [2024-08-14 14:29:08,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:08,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-08-14 14:29:08,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:08,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-08-14 14:29:08,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2024-08-14 14:29:08,052 INFO L87 Difference]: Start difference. First operand 4932 states and 6321 transitions. Second operand has 45 states, 44 states have (on average 6.136363636363637) internal successors, (270), 44 states have internal predecessors, (270), 10 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-08-14 14:29:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:11,886 INFO L93 Difference]: Finished difference Result 8006 states and 9773 transitions. [2024-08-14 14:29:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-08-14 14:29:11,887 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 6.136363636363637) internal successors, (270), 44 states have internal predecessors, (270), 10 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 406 [2024-08-14 14:29:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:11,905 INFO L225 Difference]: With dead ends: 8006 [2024-08-14 14:29:11,905 INFO L226 Difference]: Without dead ends: 7704 [2024-08-14 14:29:11,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 815 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2275 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1028, Invalid=10102, Unknown=0, NotChecked=0, Total=11130 [2024-08-14 14:29:11,908 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 435 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:11,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 733 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-08-14 14:29:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7704 states. [2024-08-14 14:29:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7704 to 4499. [2024-08-14 14:29:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4499 states, 4202 states have (on average 1.2391718229414566) internal successors, (5207), 4317 states have internal predecessors, (5207), 265 states have call successors, (265), 32 states have call predecessors, (265), 31 states have return successors, (264), 149 states have call predecessors, (264), 264 states have call successors, (264) [2024-08-14 14:29:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 5736 transitions. [2024-08-14 14:29:11,960 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 5736 transitions. Word has length 406 [2024-08-14 14:29:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:11,960 INFO L495 AbstractCegarLoop]: Abstraction has 4499 states and 5736 transitions. [2024-08-14 14:29:11,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 6.136363636363637) internal successors, (270), 44 states have internal predecessors, (270), 10 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-08-14 14:29:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 5736 transitions. [2024-08-14 14:29:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-08-14 14:29:11,965 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:11,965 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 11, 11, 10, 10, 10, 9, 8, 6, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:11,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-08-14 14:29:12,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:12,170 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:12,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1657322709, now seen corresponding path program 4 times [2024-08-14 14:29:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:12,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150937499] [2024-08-14 14:29:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:29:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:29:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:29:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:29:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:29:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-08-14 14:29:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-08-14 14:29:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-08-14 14:29:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-08-14 14:29:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-08-14 14:29:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2024-08-14 14:29:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-08-14 14:29:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-08-14 14:29:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-08-14 14:29:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2716 backedges. 852 proven. 297 refuted. 0 times theorem prover too weak. 1567 trivial. 0 not checked. [2024-08-14 14:29:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150937499] [2024-08-14 14:29:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150937499] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598733395] [2024-08-14 14:29:19,257 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-14 14:29:19,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:19,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:19,259 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:29:19,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-08-14 14:29:21,385 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-14 14:29:21,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:29:21,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 2657 conjuncts, 212 conjunts are in the unsatisfiable core [2024-08-14 14:29:21,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2716 backedges. 1640 proven. 57 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2024-08-14 14:29:22,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2716 backedges. 1381 proven. 322 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2024-08-14 14:29:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598733395] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:29:27,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:29:27,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 32] total 60 [2024-08-14 14:29:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921132550] [2024-08-14 14:29:27,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:27,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-08-14 14:29:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:27,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-08-14 14:29:27,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=3274, Unknown=0, NotChecked=0, Total=3540 [2024-08-14 14:29:27,219 INFO L87 Difference]: Start difference. First operand 4499 states and 5736 transitions. Second operand has 60 states, 59 states have (on average 5.610169491525424) internal successors, (331), 60 states have internal predecessors, (331), 12 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-08-14 14:29:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:36,597 INFO L93 Difference]: Finished difference Result 5253 states and 6517 transitions. [2024-08-14 14:29:36,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-08-14 14:29:36,598 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 5.610169491525424) internal successors, (331), 60 states have internal predecessors, (331), 12 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 407 [2024-08-14 14:29:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:36,603 INFO L225 Difference]: With dead ends: 5253 [2024-08-14 14:29:36,603 INFO L226 Difference]: Without dead ends: 5037 [2024-08-14 14:29:36,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1795, Invalid=23965, Unknown=0, NotChecked=0, Total=25760 [2024-08-14 14:29:36,606 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 306 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 6449 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 6495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 6449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:36,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 894 Invalid, 6495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 6449 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-08-14 14:29:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5037 states. [2024-08-14 14:29:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5037 to 4478. [2024-08-14 14:29:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4478 states, 4180 states have (on average 1.2143540669856459) internal successors, (5076), 4296 states have internal predecessors, (5076), 266 states have call successors, (266), 32 states have call predecessors, (266), 31 states have return successors, (264), 149 states have call predecessors, (264), 264 states have call successors, (264) [2024-08-14 14:29:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 5606 transitions. [2024-08-14 14:29:36,648 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 5606 transitions. Word has length 407 [2024-08-14 14:29:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:36,648 INFO L495 AbstractCegarLoop]: Abstraction has 4478 states and 5606 transitions. [2024-08-14 14:29:36,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 5.610169491525424) internal successors, (331), 60 states have internal predecessors, (331), 12 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-08-14 14:29:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 5606 transitions. [2024-08-14 14:29:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-08-14 14:29:36,656 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:36,656 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 13, 12, 11, 10, 9, 9, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:36,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-08-14 14:29:36,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:36,858 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:36,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:36,858 INFO L85 PathProgramCache]: Analyzing trace with hash -105399394, now seen corresponding path program 5 times [2024-08-14 14:29:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:36,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295271099] [2024-08-14 14:29:36,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:29:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:29:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:29:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:29:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:29:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:29:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:29:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:29:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-08-14 14:29:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-08-14 14:29:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-08-14 14:29:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-08-14 14:29:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-08-14 14:29:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-08-14 14:29:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-08-14 14:29:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-08-14 14:29:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2024-08-14 14:29:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:29:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2731 backedges. 921 proven. 35 refuted. 0 times theorem prover too weak. 1775 trivial. 0 not checked. [2024-08-14 14:29:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:29:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295271099] [2024-08-14 14:29:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295271099] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:29:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594957906] [2024-08-14 14:29:46,160 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-08-14 14:29:46,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:29:46,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:29:46,162 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:29:46,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-08-14 14:29:47,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-08-14 14:29:47,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:29:47,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 168 conjunts are in the unsatisfiable core [2024-08-14 14:29:47,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:29:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2731 backedges. 1163 proven. 65 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2024-08-14 14:29:48,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:29:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2731 backedges. 1027 proven. 34 refuted. 0 times theorem prover too weak. 1670 trivial. 0 not checked. [2024-08-14 14:29:50,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594957906] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:29:50,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:29:50,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 31, 20] total 61 [2024-08-14 14:29:50,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482746144] [2024-08-14 14:29:50,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:29:50,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-08-14 14:29:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:29:50,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-08-14 14:29:50,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3118, Unknown=0, NotChecked=0, Total=3660 [2024-08-14 14:29:50,498 INFO L87 Difference]: Start difference. First operand 4478 states and 5606 transitions. Second operand has 61 states, 61 states have (on average 4.295081967213115) internal successors, (262), 61 states have internal predecessors, (262), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-08-14 14:29:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:29:59,001 INFO L93 Difference]: Finished difference Result 8795 states and 10619 transitions. [2024-08-14 14:29:59,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-08-14 14:29:59,001 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.295081967213115) internal successors, (262), 61 states have internal predecessors, (262), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 409 [2024-08-14 14:29:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:29:59,009 INFO L225 Difference]: With dead ends: 8795 [2024-08-14 14:29:59,010 INFO L226 Difference]: Without dead ends: 8063 [2024-08-14 14:29:59,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7418 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=3578, Invalid=22504, Unknown=0, NotChecked=0, Total=26082 [2024-08-14 14:29:59,013 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 751 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 3809 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-08-14 14:29:59,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1320 Invalid, 3856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3809 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-08-14 14:29:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8063 states. [2024-08-14 14:29:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8063 to 5338. [2024-08-14 14:29:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5338 states, 4990 states have (on average 1.2022044088176354) internal successors, (5999), 5132 states have internal predecessors, (5999), 316 states have call successors, (316), 32 states have call predecessors, (316), 31 states have return successors, (314), 173 states have call predecessors, (314), 314 states have call successors, (314) [2024-08-14 14:29:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 6629 transitions. [2024-08-14 14:29:59,151 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 6629 transitions. Word has length 409 [2024-08-14 14:29:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:29:59,152 INFO L495 AbstractCegarLoop]: Abstraction has 5338 states and 6629 transitions. [2024-08-14 14:29:59,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.295081967213115) internal successors, (262), 61 states have internal predecessors, (262), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-08-14 14:29:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 6629 transitions. [2024-08-14 14:29:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-08-14 14:29:59,161 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:29:59,161 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 8, 8, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:29:59,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-08-14 14:29:59,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-08-14 14:29:59,367 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:29:59,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:29:59,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1063523064, now seen corresponding path program 3 times [2024-08-14 14:29:59,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:29:59,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447581149] [2024-08-14 14:29:59,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:29:59,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:30:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-14 14:30:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-14 14:30:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-08-14 14:30:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-14 14:30:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-08-14 14:30:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-08-14 14:30:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-08-14 14:30:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-08-14 14:30:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-08-14 14:30:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-08-14 14:30:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-08-14 14:30:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-08-14 14:30:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-08-14 14:30:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-08-14 14:30:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2024-08-14 14:30:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:30:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2766 backedges. 1311 proven. 188 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2024-08-14 14:30:10,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:30:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447581149] [2024-08-14 14:30:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447581149] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 14:30:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948291944] [2024-08-14 14:30:10,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 14:30:10,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:10,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:30:10,223 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 14:30:10,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-08-14 14:30:11,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-08-14 14:30:11,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 14:30:11,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 315 conjunts are in the unsatisfiable core [2024-08-14 14:30:11,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 14:30:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2766 backedges. 969 proven. 35 refuted. 0 times theorem prover too weak. 1762 trivial. 0 not checked. [2024-08-14 14:30:15,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 14:30:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2766 backedges. 189 proven. 823 refuted. 0 times theorem prover too weak. 1754 trivial. 0 not checked. [2024-08-14 14:30:22,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948291944] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 14:30:22,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 14:30:22,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 26, 35] total 69 [2024-08-14 14:30:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852042057] [2024-08-14 14:30:22,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 14:30:22,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-08-14 14:30:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:30:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-08-14 14:30:22,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=4105, Unknown=0, NotChecked=0, Total=4692 [2024-08-14 14:30:22,786 INFO L87 Difference]: Start difference. First operand 5338 states and 6629 transitions. Second operand has 69 states, 68 states have (on average 4.3088235294117645) internal successors, (293), 68 states have internal predecessors, (293), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2024-08-14 14:30:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:30:47,677 INFO L93 Difference]: Finished difference Result 22507 states and 26712 transitions. [2024-08-14 14:30:47,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2024-08-14 14:30:47,678 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 4.3088235294117645) internal successors, (293), 68 states have internal predecessors, (293), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 409 [2024-08-14 14:30:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:30:47,699 INFO L225 Difference]: With dead ends: 22507 [2024-08-14 14:30:47,699 INFO L226 Difference]: Without dead ends: 22231 [2024-08-14 14:30:47,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1134 GetRequests, 797 SyntacticMatches, 1 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43316 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=11540, Invalid=102366, Unknown=0, NotChecked=0, Total=113906 [2024-08-14 14:30:47,704 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2605 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 5520 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2605 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 5520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:30:47,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2605 Valid, 1723 Invalid, 5687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 5520 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-08-14 14:30:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22231 states. [2024-08-14 14:30:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22231 to 10935. [2024-08-14 14:30:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10935 states, 10330 states have (on average 1.2032913843175217) internal successors, (12430), 10539 states have internal predecessors, (12430), 573 states have call successors, (573), 32 states have call predecessors, (573), 31 states have return successors, (571), 363 states have call predecessors, (571), 571 states have call successors, (571) [2024-08-14 14:30:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10935 states to 10935 states and 13574 transitions. [2024-08-14 14:30:47,859 INFO L78 Accepts]: Start accepts. Automaton has 10935 states and 13574 transitions. Word has length 409 [2024-08-14 14:30:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:30:47,860 INFO L495 AbstractCegarLoop]: Abstraction has 10935 states and 13574 transitions. [2024-08-14 14:30:47,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 4.3088235294117645) internal successors, (293), 68 states have internal predecessors, (293), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2024-08-14 14:30:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 10935 states and 13574 transitions. [2024-08-14 14:30:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-08-14 14:30:47,872 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:30:47,872 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:30:47,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-08-14 14:30:48,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 14:30:48,077 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:30:48,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:30:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1024664934, now seen corresponding path program 4 times [2024-08-14 14:30:48,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:30:48,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966819080] [2024-08-14 14:30:48,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:30:48,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:30:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:30:58,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:31:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:31:09,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:31:09,329 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:31:09,330 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:31:09,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-08-14 14:31:09,335 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:31:09,339 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:31:09,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:31:09 BoogieIcfgContainer [2024-08-14 14:31:09,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:31:09,450 INFO L158 Benchmark]: Toolchain (without parser) took 409989.72ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 81.3MB in the beginning and 799.7MB in the end (delta: -718.5MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-08-14 14:31:09,450 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:31:09,451 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory was 127.9MB in the beginning and 127.7MB in the end (delta: 203.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:31:09,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.57ms. Allocated memory is still 159.4MB. Free memory was 81.1MB in the beginning and 67.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-14 14:31:09,451 INFO L158 Benchmark]: Boogie Preprocessor took 73.37ms. Allocated memory is still 159.4MB. Free memory was 67.2MB in the beginning and 64.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 14:31:09,452 INFO L158 Benchmark]: IcfgBuilder took 521.45ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 64.0MB in the beginning and 177.1MB in the end (delta: -113.1MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-08-14 14:31:09,452 INFO L158 Benchmark]: TraceAbstraction took 409123.08ms. Allocated memory was 228.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 177.1MB in the beginning and 799.7MB in the end (delta: -622.6MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-08-14 14:31:09,453 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory was 127.9MB in the beginning and 127.7MB in the end (delta: 203.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.57ms. Allocated memory is still 159.4MB. Free memory was 81.1MB in the beginning and 67.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.37ms. Allocated memory is still 159.4MB. Free memory was 67.2MB in the beginning and 64.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 521.45ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 64.0MB in the beginning and 177.1MB in the end (delta: -113.1MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 409123.08ms. Allocated memory was 228.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 177.1MB in the beginning and 799.7MB in the end (delta: -622.6MB). Peak memory consumption was 1.5GB. 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 115. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 4); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (4 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_3 var_7 = 1; [L34] const SORT_1 var_14 = 1; [L35] const SORT_3 var_20 = 15; [L37] SORT_1 input_2; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L39] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L40] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_7; [L45] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=2, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=2, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=2, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=2, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=2, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=2, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=3, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=3, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=3, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=3, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=3, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=3, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=4, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=4, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=4, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=4, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=4, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=4, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=5, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=5, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=5, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=5, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=5, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=5, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=6, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=6, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=6, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=6, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=6, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=6, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=7, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=7, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=7, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=7, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=7, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=7, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=8, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=8, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=8, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=8, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=8, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=8, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=9, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=9, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=9, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=9, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=9, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=9, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=10, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=10, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=10, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=10, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=10, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=10, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=11, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=11, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=11, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=11, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=11, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=11, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=12, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=12, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=12, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=12, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=12, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=12, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=13, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=13, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=13, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=13, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=13, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=13, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=14, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=14, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_22=1, var_24=1, var_25=0, var_7=1] [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=14, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=14, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=14, var_14=1, var_20=15, var_31=1, var_33=0, var_7=1] [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=14, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=15, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=15, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=0, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 [L80] EXPR var_22 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_26=15, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_26=15, var_7=1] [L89] EXPR var_26 & mask_SORT_3 [L89] EXPR var_26 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=15, state_5=0, state_8=15, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=0, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=15, state_5=0, state_8=15, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 [L103] EXPR var_31 & mask_SORT_1 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=15, state_5=0, state_8=15, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=15, var_14=1, var_20=15, var_34=0, var_7=1] [L115] EXPR var_34 & mask_SORT_3 [L115] EXPR var_34 & mask_SORT_3 VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=15, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=15, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=15, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=15, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=15, state_8=0, var_14=1, var_16=1, var_20=15, var_7=1] [L61] EXPR var_16 & mask_SORT_1 [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=15, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=1, mask_SORT_1=1, mask_SORT_3=15, state_5=15, state_8=0, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_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, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 409.0s, OverallIterations: 24, TraceHistogramMax: 16, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.2s, AutomataDifference: 151.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11342 SdHoareTripleChecker+Valid, 45.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11335 mSDsluCounter, 16569 SdHoareTripleChecker+Invalid, 39.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15502 mSDsCounter, 936 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68444 IncrementalHoareTripleChecker+Invalid, 69380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 936 mSolverCounterUnsat, 1067 mSDtfsCounter, 68444 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15750 GetRequests, 12734 SyntacticMatches, 7 SemanticMatches, 3009 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360973 ImplicationChecksByTransitivity, 123.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10935occurred in iteration=23, InterpolantAutomatonStates: 2364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 63367 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.2s SsaConstructionTime, 100.8s SatisfiabilityAnalysisTime, 126.6s InterpolantComputationTime, 16072 NumberOfCodeBlocks, 14850 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 21171 ConstructedInterpolants, 0 QuantifiedInterpolants, 189454 SizeOfPredicates, 139 NumberOfNonLiveVariables, 36269 ConjunctsInSsa, 2449 ConjunctsInUnsatCore, 54 InterpolantComputations, 9 PerfectInterpolantSequences, 130653/143397 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:31:09,524 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.cav14_example_v.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.cav14_example_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:31:11,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:31:11,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:31:11,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:31:11,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:31:12,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:31:12,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:31:12,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:31:12,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:31:12,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:31:12,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:31:12,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:31:12,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:31:12,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:31:12,031 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:31:12,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:31:12,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:31:12,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:31:12,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:31:12,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:31:12,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:31:12,036 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:31:12,036 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:31:12,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:31:12,036 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:31:12,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:31:12,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:31:12,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:31:12,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:31:12,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:31:12,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:31:12,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:31:12,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:31:12,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:31:12,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:31:12,039 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:31:12,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:31:12,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:31:12,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:31:12,040 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:31:12,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:31:12,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:31:12,041 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:31:12,041 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:31:12,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:31:12,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:31:12,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:31:12,328 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:31:12,329 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:31:12,331 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.cav14_example_v.yml/witness.yml [2024-08-14 14:31:12,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:31:12,424 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:31:12,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-08-14 14:31:13,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:31:14,020 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:31:14,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-08-14 14:31:14,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea4d1b1/888fb602404b4e12917c4bb82ed29a91/FLAG77660c724 [2024-08-14 14:31:14,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea4d1b1/888fb602404b4e12917c4bb82ed29a91 [2024-08-14 14:31:14,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:31:14,048 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:31:14,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:31:14,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:31:14,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:31:14,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:31:12" (1/2) ... [2024-08-14 14:31:14,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0a42f1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:14, skipping insertion in model container [2024-08-14 14:31:14,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:31:12" (1/2) ... [2024-08-14 14:31:14,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@16b1f2ef and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:31:14, skipping insertion in model container [2024-08-14 14:31:14,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:31:14" (2/2) ... [2024-08-14 14:31:14,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0a42f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14, skipping insertion in model container [2024-08-14 14:31:14,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:31:14" (2/2) ... [2024-08-14 14:31:14,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:31:14,214 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.cav14_example_v.c[1255,1268] [2024-08-14 14:31:14,262 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:31:14,275 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:31:14,285 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.cav14_example_v.c[1255,1268] [2024-08-14 14:31:14,309 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:31:14,327 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:31:14,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14 WrapperNode [2024-08-14 14:31:14,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:31:14,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:31:14,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:31:14,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:31:14,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (1/1) ... [2024-08-14 14:31:14,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (1/1) ... [2024-08-14 14:31:14,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (1/1) ... [2024-08-14 14:31:14,376 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:31:14,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (1/1) ... [2024-08-14 14:31:14,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (1/1) ... [2024-08-14 14:31:14,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (1/1) ... [2024-08-14 14:31:14,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (1/1) ... [2024-08-14 14:31:14,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (1/1) ... [2024-08-14 14:31:14,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:31:14,394 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:31:14,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:31:14,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:31:14,395 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (1/1) ... [2024-08-14 14:31:14,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:31:14,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:31:14,431 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:31:14,434 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:31:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:31:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:31:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:31:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:31:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:31:14,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:31:14,539 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:31:14,541 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:31:14,762 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-08-14 14:31:14,762 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:31:14,775 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:31:14,775 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:31:14,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:31:14 BoogieIcfgContainer [2024-08-14 14:31:14,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:31:14,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:31:14,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:31:14,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:31:14,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:31:12" (1/4) ... [2024-08-14 14:31:14,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738ef0fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:31:14, skipping insertion in model container [2024-08-14 14:31:14,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:31:14" (2/4) ... [2024-08-14 14:31:14,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738ef0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:31:14, skipping insertion in model container [2024-08-14 14:31:14,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:31:14" (3/4) ... [2024-08-14 14:31:14,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738ef0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:31:14, skipping insertion in model container [2024-08-14 14:31:14,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:31:14" (4/4) ... [2024-08-14 14:31:14,785 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2024-08-14 14:31:14,787 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:31:14,802 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:31:14,803 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:31:14,830 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [48] [2024-08-14 14:31:14,834 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:31:14,907 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 416 states to 236 states. [2024-08-14 14:31:14,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:31:14,925 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;@77581cca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:31:14,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:31:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2024-08-14 14:31:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-08-14 14:31:14,938 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:31:14,938 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:31:14,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:31:14,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:31:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash 84472225, now seen corresponding path program 1 times [2024-08-14 14:31:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:31:14,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389716032] [2024-08-14 14:31:14,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:31:14,957 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:31:14,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:31:14,963 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:31:14,965 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:31:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:31:15,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:31:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:31:15,987 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:31:15,989 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:31:15,990 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:31:16,003 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:31:16,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:31:16,200 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:31:16,203 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:31:16,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:31:16 BoogieIcfgContainer [2024-08-14 14:31:16,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:31:16,258 INFO L158 Benchmark]: Toolchain (without parser) took 2210.25ms. Allocated memory is still 94.4MB. Free memory was 64.0MB in the beginning and 44.8MB in the end (delta: 19.1MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-08-14 14:31:16,258 INFO L158 Benchmark]: Witness Parser took 0.83ms. Allocated memory is still 65.0MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:31:16,259 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 65.0MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 59.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:31:16,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.37ms. Allocated memory is still 94.4MB. Free memory was 63.8MB in the beginning and 49.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-14 14:31:16,259 INFO L158 Benchmark]: Boogie Preprocessor took 63.91ms. Allocated memory is still 94.4MB. Free memory was 49.8MB in the beginning and 72.9MB in the end (delta: -23.2MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2024-08-14 14:31:16,260 INFO L158 Benchmark]: IcfgBuilder took 382.25ms. Allocated memory is still 94.4MB. Free memory was 72.5MB in the beginning and 54.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-08-14 14:31:16,260 INFO L158 Benchmark]: TraceAbstraction took 1479.42ms. Allocated memory is still 94.4MB. Free memory was 54.2MB in the beginning and 44.8MB in the end (delta: 9.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-08-14 14:31:16,262 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.83ms. Allocated memory is still 65.0MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 65.0MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 59.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.37ms. Allocated memory is still 94.4MB. Free memory was 63.8MB in the beginning and 49.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.91ms. Allocated memory is still 94.4MB. Free memory was 49.8MB in the beginning and 72.9MB in the end (delta: -23.2MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * IcfgBuilder took 382.25ms. Allocated memory is still 94.4MB. Free memory was 72.5MB in the beginning and 54.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1479.42ms. Allocated memory is still 94.4MB. Free memory was 54.2MB in the beginning and 44.8MB in the end (delta: 9.3MB). Peak memory consumption was 21.0MB. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 4); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (4 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_3 var_7 = 1; [L34] const SORT_1 var_14 = 1; [L35] const SORT_3 var_20 = 15; [L37] SORT_1 input_2; [L39] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_7; [L45] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=2, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=3, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=4, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=5, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=6, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=7, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=8, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=9, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=10, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=11, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=12, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=13, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=14, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) VAL [bad_17_arg_0=0, mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=15, var_14=1, var_20=15, var_7=1] [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; VAL [bad_17_arg_0=1, mask_SORT_1=1, mask_SORT_3=15, state_5=15, state_8=0, var_14=1, var_20=15, var_7=1] [L63] CALL __VERIFIER_assert(!(bad_17_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.4s, OverallIterations: 1, TraceHistogramMax: 16, 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=236occurred 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, 116 NumberOfCodeBlocks, 116 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:31:16,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE