./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_arrays_bpbs_p4.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 03fe66fa 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.vis_arrays_bpbs_p4.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_arrays_bpbs_p4.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-03fe66f-m [2024-08-15 18:23:38,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:23:39,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-15 18:23:39,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:23:39,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:23:39,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:23:39,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:23:39,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:23:39,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:23:39,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:23:39,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:23:39,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:23:39,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:23:39,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:23:39,071 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:23:39,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:23:39,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:23:39,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-15 18:23:39,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:23:39,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:23:39,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:23:39,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:23:39,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:23:39,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:23:39,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:23:39,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:23:39,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:23:39,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:23:39,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:23:39,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:23:39,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:23:39,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:23:39,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:23:39,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-15 18:23:39,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-15 18:23:39,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:23:39,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:23:39,080 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:23:39,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:23:39,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:23:39,082 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-15 18:23:39,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:23:39,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:23:39,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:23:39,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:23:39,393 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:23:39,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c [2024-08-15 18:23:40,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:23:41,271 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:23:41,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c [2024-08-15 18:23:41,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b1595a5/b99e8248a9b94aa0b16d39393f0cddca/FLAG2739ef0ae [2024-08-15 18:23:41,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b1595a5/b99e8248a9b94aa0b16d39393f0cddca [2024-08-15 18:23:41,340 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:23:41,341 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:23:41,343 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.vis_arrays_bpbs_p4.yml/witness.yml [2024-08-15 18:23:41,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:23:41,411 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:23:41,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:23:41,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:23:41,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:23:41,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:23:41" (1/2) ... [2024-08-15 18:23:41,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387f5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:41, skipping insertion in model container [2024-08-15 18:23:41,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:23:41" (1/2) ... [2024-08-15 18:23:41,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f05a7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:41, skipping insertion in model container [2024-08-15 18:23:41,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:23:41" (2/2) ... [2024-08-15 18:23:41,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387f5f6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:41, skipping insertion in model container [2024-08-15 18:23:41,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:23:41" (2/2) ... [2024-08-15 18:23:41,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:23:41,779 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.vis_arrays_bpbs_p4.c[1258,1271] [2024-08-15 18:23:42,138 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:23:42,154 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:23:42,167 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.vis_arrays_bpbs_p4.c[1258,1271] [2024-08-15 18:23:42,454 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:23:42,489 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:23:42,490 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42 WrapperNode [2024-08-15 18:23:42,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:23:42,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:23:42,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:23:42,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:23:42,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (1/1) ... [2024-08-15 18:23:42,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (1/1) ... [2024-08-15 18:23:42,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (1/1) ... [2024-08-15 18:23:42,643 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-15 18:23:42,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (1/1) ... [2024-08-15 18:23:42,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (1/1) ... [2024-08-15 18:23:42,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (1/1) ... [2024-08-15 18:23:42,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (1/1) ... [2024-08-15 18:23:42,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (1/1) ... [2024-08-15 18:23:42,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:23:42,796 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:23:42,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:23:42,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:23:42,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (1/1) ... [2024-08-15 18:23:42,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:23:42,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:42,838 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-15 18:23:42,845 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-15 18:23:42,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:23:42,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:23:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:23:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:23:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:23:42,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:23:42,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:23:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:23:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:23:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:23:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:23:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:23:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:23:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:23:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:23:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:23:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:23:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:23:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-15 18:23:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:23:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-15 18:23:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-15 18:23:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:23:43,310 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:23:43,313 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:23:48,821 INFO L? ?]: Removed 2167 outVars from TransFormulas that were not future-live. [2024-08-15 18:23:48,821 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:23:48,844 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:23:48,844 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:23:48,845 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:23:48 BoogieIcfgContainer [2024-08-15 18:23:48,845 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:23:48,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:23:48,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:23:48,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:23:48,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:23:41" (1/4) ... [2024-08-15 18:23:48,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d4cfa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:23:48, skipping insertion in model container [2024-08-15 18:23:48,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:23:41" (2/4) ... [2024-08-15 18:23:48,856 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:23:48,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d4cfa5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:23:48, skipping insertion in model container [2024-08-15 18:23:48,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:42" (3/4) ... [2024-08-15 18:23:48,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d4cfa5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:23:48, skipping insertion in model container [2024-08-15 18:23:48,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:23:48" (4/4) ... [2024-08-15 18:23:48,860 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p4.c [2024-08-15 18:23:48,881 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:23:48,882 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:23:48,924 INFO L90 WitnessUtils]: Constructing product of automaton with 630 states and violation witness of the following lengths: [3] [2024-08-15 18:23:49,547 INFO L95 WitnessUtils]: Product has 1244 reachable states. [2024-08-15 18:23:49,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:23:49,582 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;@489ff99e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:23:49,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:23:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 2052 transitions. [2024-08-15 18:23:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-08-15 18:23:49,590 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:49,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:49,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:49,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash 717959132, now seen corresponding path program 1 times [2024-08-15 18:23:49,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:49,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566294099] [2024-08-15 18:23:49,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:50,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566294099] [2024-08-15 18:23:50,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566294099] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:50,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:23:50,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696228622] [2024-08-15 18:23:50,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:50,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:23:50,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:50,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:23:50,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:23:50,647 INFO L87 Difference]: Start difference. First operand 1244 states and 2052 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:50,803 INFO L93 Difference]: Finished difference Result 1193 states and 1973 transitions. [2024-08-15 18:23:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:23:50,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2024-08-15 18:23:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:50,832 INFO L225 Difference]: With dead ends: 1193 [2024-08-15 18:23:50,832 INFO L226 Difference]: Without dead ends: 1193 [2024-08-15 18:23:50,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-15 18:23:50,837 INFO L413 NwaCegarLoop]: 1026 mSDtfsCounter, 873 mSDsluCounter, 4100 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 5126 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-15 18:23:50,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 5126 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-08-15 18:23:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 630. [2024-08-15 18:23:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 622 states have (on average 1.6543408360128617) internal successors, (1029), 623 states have internal predecessors, (1029), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1036 transitions. [2024-08-15 18:23:50,937 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1036 transitions. Word has length 69 [2024-08-15 18:23:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:50,938 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 1036 transitions. [2024-08-15 18:23:50,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1036 transitions. [2024-08-15 18:23:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-08-15 18:23:50,942 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:50,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:50,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-15 18:23:50,943 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:50,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash -941925650, now seen corresponding path program 1 times [2024-08-15 18:23:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:50,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139063256] [2024-08-15 18:23:50,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:50,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:51,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:51,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:51,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139063256] [2024-08-15 18:23:51,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139063256] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:51,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-15 18:23:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705421676] [2024-08-15 18:23:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:51,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-15 18:23:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-15 18:23:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:23:51,254 INFO L87 Difference]: Start difference. First operand 630 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:51,287 INFO L93 Difference]: Finished difference Result 632 states and 1038 transitions. [2024-08-15 18:23:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-15 18:23:51,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-08-15 18:23:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:51,291 INFO L225 Difference]: With dead ends: 632 [2024-08-15 18:23:51,291 INFO L226 Difference]: Without dead ends: 632 [2024-08-15 18:23:51,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:23:51,294 INFO L413 NwaCegarLoop]: 1028 mSDtfsCounter, 0 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3077 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-15 18:23:51,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3077 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-08-15 18:23:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2024-08-15 18:23:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 624 states have (on average 1.6522435897435896) internal successors, (1031), 625 states have internal predecessors, (1031), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1038 transitions. [2024-08-15 18:23:51,321 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1038 transitions. Word has length 70 [2024-08-15 18:23:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:51,321 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1038 transitions. [2024-08-15 18:23:51,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1038 transitions. [2024-08-15 18:23:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-08-15 18:23:51,323 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:51,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:51,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-15 18:23:51,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:51,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash 87078169, now seen corresponding path program 1 times [2024-08-15 18:23:51,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:51,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756690358] [2024-08-15 18:23:51,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:51,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:51,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:51,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:51,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756690358] [2024-08-15 18:23:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756690358] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:51,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:51,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-15 18:23:51,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936220767] [2024-08-15 18:23:51,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:51,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-15 18:23:51,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-15 18:23:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:23:51,787 INFO L87 Difference]: Start difference. First operand 632 states and 1038 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:51,831 INFO L93 Difference]: Finished difference Result 634 states and 1040 transitions. [2024-08-15 18:23:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-15 18:23:51,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2024-08-15 18:23:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:51,835 INFO L225 Difference]: With dead ends: 634 [2024-08-15 18:23:51,835 INFO L226 Difference]: Without dead ends: 634 [2024-08-15 18:23:51,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:23:51,837 INFO L413 NwaCegarLoop]: 1028 mSDtfsCounter, 0 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3077 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-15 18:23:51,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3077 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-08-15 18:23:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2024-08-15 18:23:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 626 states have (on average 1.6501597444089458) internal successors, (1033), 627 states have internal predecessors, (1033), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1040 transitions. [2024-08-15 18:23:51,853 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1040 transitions. Word has length 71 [2024-08-15 18:23:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:51,854 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 1040 transitions. [2024-08-15 18:23:51,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1040 transitions. [2024-08-15 18:23:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-08-15 18:23:51,861 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:51,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:51,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-15 18:23:51,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:51,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash -301055951, now seen corresponding path program 1 times [2024-08-15 18:23:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:51,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996610706] [2024-08-15 18:23:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:52,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:52,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996610706] [2024-08-15 18:23:52,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996610706] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:52,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:52,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:23:52,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146327137] [2024-08-15 18:23:52,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:52,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:23:52,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:52,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:23:52,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:23:52,165 INFO L87 Difference]: Start difference. First operand 634 states and 1040 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:52,215 INFO L93 Difference]: Finished difference Result 639 states and 1047 transitions. [2024-08-15 18:23:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-15 18:23:52,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-08-15 18:23:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:52,221 INFO L225 Difference]: With dead ends: 639 [2024-08-15 18:23:52,221 INFO L226 Difference]: Without dead ends: 639 [2024-08-15 18:23:52,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:23:52,223 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 3 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4100 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:52,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4100 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-08-15 18:23:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2024-08-15 18:23:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 631 states have (on average 1.6481774960380349) internal successors, (1040), 632 states have internal predecessors, (1040), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1047 transitions. [2024-08-15 18:23:52,242 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1047 transitions. Word has length 72 [2024-08-15 18:23:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:52,243 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 1047 transitions. [2024-08-15 18:23:52,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1047 transitions. [2024-08-15 18:23:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-08-15 18:23:52,246 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:52,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:52,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-15 18:23:52,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:52,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:52,247 INFO L85 PathProgramCache]: Analyzing trace with hash -479649965, now seen corresponding path program 1 times [2024-08-15 18:23:52,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:52,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561974735] [2024-08-15 18:23:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:52,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:52,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:52,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561974735] [2024-08-15 18:23:52,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561974735] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:52,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:52,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:23:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724291731] [2024-08-15 18:23:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:52,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:23:52,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:52,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:23:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:23:52,573 INFO L87 Difference]: Start difference. First operand 639 states and 1047 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:52,637 INFO L93 Difference]: Finished difference Result 644 states and 1054 transitions. [2024-08-15 18:23:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-15 18:23:52,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2024-08-15 18:23:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:52,641 INFO L225 Difference]: With dead ends: 644 [2024-08-15 18:23:52,641 INFO L226 Difference]: Without dead ends: 644 [2024-08-15 18:23:52,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:23:52,644 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 3 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4100 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:52,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4100 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-08-15 18:23:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2024-08-15 18:23:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 636 states have (on average 1.6462264150943395) internal successors, (1047), 637 states have internal predecessors, (1047), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1054 transitions. [2024-08-15 18:23:52,663 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1054 transitions. Word has length 73 [2024-08-15 18:23:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:52,664 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1054 transitions. [2024-08-15 18:23:52,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1054 transitions. [2024-08-15 18:23:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-08-15 18:23:52,667 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:52,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:52,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-15 18:23:52,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:52,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:52,669 INFO L85 PathProgramCache]: Analyzing trace with hash 783174678, now seen corresponding path program 1 times [2024-08-15 18:23:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:52,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670256538] [2024-08-15 18:23:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670256538] [2024-08-15 18:23:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670256538] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:52,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:52,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-15 18:23:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247291565] [2024-08-15 18:23:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:52,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-15 18:23:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-15 18:23:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-15 18:23:52,972 INFO L87 Difference]: Start difference. First operand 644 states and 1054 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:53,023 INFO L93 Difference]: Finished difference Result 649 states and 1061 transitions. [2024-08-15 18:23:53,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-15 18:23:53,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-08-15 18:23:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:53,027 INFO L225 Difference]: With dead ends: 649 [2024-08-15 18:23:53,028 INFO L226 Difference]: Without dead ends: 649 [2024-08-15 18:23:53,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-15 18:23:53,029 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 3 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4100 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:53,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4100 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-08-15 18:23:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2024-08-15 18:23:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 641 states have (on average 1.6443057722308891) internal successors, (1054), 642 states have internal predecessors, (1054), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1061 transitions. [2024-08-15 18:23:53,044 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1061 transitions. Word has length 74 [2024-08-15 18:23:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:53,045 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1061 transitions. [2024-08-15 18:23:53,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1061 transitions. [2024-08-15 18:23:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-08-15 18:23:53,046 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:53,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:53,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-15 18:23:53,047 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:53,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2074614484, now seen corresponding path program 1 times [2024-08-15 18:23:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599260408] [2024-08-15 18:23:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:53,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599260408] [2024-08-15 18:23:53,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599260408] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:53,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:53,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-15 18:23:53,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510513396] [2024-08-15 18:23:53,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:53,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-15 18:23:53,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:53,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-15 18:23:53,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-08-15 18:23:53,662 INFO L87 Difference]: Start difference. First operand 649 states and 1061 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:53,824 INFO L93 Difference]: Finished difference Result 752 states and 1223 transitions. [2024-08-15 18:23:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:23:53,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-08-15 18:23:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:53,829 INFO L225 Difference]: With dead ends: 752 [2024-08-15 18:23:53,829 INFO L226 Difference]: Without dead ends: 752 [2024-08-15 18:23:53,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-08-15 18:23:53,831 INFO L413 NwaCegarLoop]: 1059 mSDtfsCounter, 1141 mSDsluCounter, 5242 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 6301 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:53,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 6301 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-08-15 18:23:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 709. [2024-08-15 18:23:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 701 states have (on average 1.6433666191155492) internal successors, (1152), 702 states have internal predecessors, (1152), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1159 transitions. [2024-08-15 18:23:53,847 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1159 transitions. Word has length 75 [2024-08-15 18:23:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:53,847 INFO L495 AbstractCegarLoop]: Abstraction has 709 states and 1159 transitions. [2024-08-15 18:23:53,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1159 transitions. [2024-08-15 18:23:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-08-15 18:23:53,849 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:53,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:53,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-15 18:23:53,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:53,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash 168322703, now seen corresponding path program 1 times [2024-08-15 18:23:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:53,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539316638] [2024-08-15 18:23:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:53,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:54,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:54,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539316638] [2024-08-15 18:23:54,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539316638] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:54,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:54,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-15 18:23:54,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773408942] [2024-08-15 18:23:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:54,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-15 18:23:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-15 18:23:54,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-08-15 18:23:54,897 INFO L87 Difference]: Start difference. First operand 709 states and 1159 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:55,076 INFO L93 Difference]: Finished difference Result 715 states and 1168 transitions. [2024-08-15 18:23:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-15 18:23:55,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2024-08-15 18:23:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:55,080 INFO L225 Difference]: With dead ends: 715 [2024-08-15 18:23:55,080 INFO L226 Difference]: Without dead ends: 715 [2024-08-15 18:23:55,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-08-15 18:23:55,082 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 7 mSDsluCounter, 7165 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8192 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:55,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8192 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-08-15 18:23:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-08-15 18:23:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 707 states have (on average 1.6421499292786421) internal successors, (1161), 708 states have internal predecessors, (1161), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1168 transitions. [2024-08-15 18:23:55,100 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1168 transitions. Word has length 76 [2024-08-15 18:23:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:55,101 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 1168 transitions. [2024-08-15 18:23:55,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-08-15 18:23:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1168 transitions. [2024-08-15 18:23:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-08-15 18:23:55,105 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:55,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:55,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-15 18:23:55,105 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:55,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:55,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2088588304, now seen corresponding path program 1 times [2024-08-15 18:23:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:55,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324289584] [2024-08-15 18:23:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:23:55,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:23:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:23:55,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-15 18:23:55,313 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:23:55,314 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:23:55,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-15 18:23:55,320 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:55,323 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:23:55,394 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:23:55 BoogieIcfgContainer [2024-08-15 18:23:55,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:23:55,395 INFO L158 Benchmark]: Toolchain (without parser) took 13983.48ms. Allocated memory was 134.2MB in the beginning and 543.2MB in the end (delta: 408.9MB). Free memory was 77.3MB in the beginning and 341.5MB in the end (delta: -264.2MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2024-08-15 18:23:55,395 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:55,395 INFO L158 Benchmark]: Witness Parser took 1.86ms. Allocated memory is still 134.2MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:55,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1075.91ms. Allocated memory is still 134.2MB. Free memory was 76.9MB in the beginning and 86.0MB in the end (delta: -9.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-08-15 18:23:55,396 INFO L158 Benchmark]: Boogie Preprocessor took 302.98ms. Allocated memory is still 134.2MB. Free memory was 86.0MB in the beginning and 59.5MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-08-15 18:23:55,396 INFO L158 Benchmark]: IcfgBuilder took 6049.22ms. Allocated memory was 134.2MB in the beginning and 308.3MB in the end (delta: 174.1MB). Free memory was 59.5MB in the beginning and 113.5MB in the end (delta: -54.0MB). Peak memory consumption was 164.4MB. Max. memory is 16.1GB. [2024-08-15 18:23:55,396 INFO L158 Benchmark]: TraceAbstraction took 6546.83ms. Allocated memory was 308.3MB in the beginning and 543.2MB in the end (delta: 234.9MB). Free memory was 112.4MB in the beginning and 341.5MB in the end (delta: -229.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-08-15 18:23:55,399 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 1.86ms. Allocated memory is still 134.2MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1075.91ms. Allocated memory is still 134.2MB. Free memory was 76.9MB in the beginning and 86.0MB in the end (delta: -9.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 302.98ms. Allocated memory is still 134.2MB. Free memory was 86.0MB in the beginning and 59.5MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 6049.22ms. Allocated memory was 134.2MB in the beginning and 308.3MB in the end (delta: 174.1MB). Free memory was 59.5MB in the beginning and 113.5MB in the end (delta: -54.0MB). Peak memory consumption was 164.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6546.83ms. Allocated memory was 308.3MB in the beginning and 543.2MB in the end (delta: 234.9MB). Free memory was 112.4MB in the beginning and 341.5MB in the end (delta: -229.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 105. 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 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 32); [L36] const SORT_66 msb_SORT_66 = (SORT_66)1 << (32 - 1); [L38] const SORT_100 mask_SORT_100 = (SORT_100)-1 >> (sizeof(SORT_100) * 8 - 3); [L39] const SORT_100 msb_SORT_100 = (SORT_100)1 << (3 - 1); [L41] const SORT_10 var_12 = 15; [L42] const SORT_1 var_16 = 1; [L43] const SORT_3 var_22 = 0; [L44] const SORT_1 var_25 = 0; [L45] const SORT_66 var_68 = 1; [L46] const SORT_3 var_106 = 3; [L47] const SORT_66 var_115 = 2; [L48] const SORT_66 var_122 = 0; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_3 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L57] SORT_1 input_90; [L58] SORT_3 input_105; [L59] SORT_3 input_127; [L60] SORT_3 input_128; [L61] SORT_3 input_129; [L62] SORT_3 input_137; [L63] SORT_3 input_139; [L64] SORT_3 input_141; [L65] SORT_3 input_167; [L66] SORT_3 input_168; [L67] SORT_3 input_176; [L68] SORT_3 input_178; [L69] SORT_3 input_180; [L70] SORT_3 input_182; [L71] SORT_3 input_236; [L72] SORT_3 input_245; [L73] SORT_3 input_246; [L74] SORT_3 input_247; [L75] SORT_3 input_248; [L76] SORT_3 input_273; [L77] SORT_3 input_274; [L78] SORT_3 input_275; [L79] SORT_3 input_284; [L80] SORT_3 input_330; [L81] SORT_3 input_340; [L82] SORT_3 input_341; [L83] SORT_3 input_342; [L84] SORT_3 input_343; [L85] SORT_3 input_352; [L86] SORT_3 input_371; [L87] SORT_3 input_372; [L88] SORT_3 input_373; [L89] SORT_3 input_382; [L90] SORT_3 input_384; [L91] SORT_3 input_430; [L92] SORT_3 input_441; [L93] SORT_3 input_442; [L94] SORT_3 input_443; [L95] SORT_3 input_444; [L96] SORT_3 input_453; [L97] SORT_3 input_455; [L98] SORT_3 input_475; [L99] SORT_3 input_476; [L100] SORT_3 input_477; [L101] SORT_3 input_486; [L102] SORT_3 input_488; [L103] SORT_3 input_490; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L105] SORT_10 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L106] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L107] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L108] SORT_3 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L109] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L110] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L111] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L112] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L112] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L112] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L113] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L113] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L113] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L114] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L115] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L116] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L117] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L118] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L119] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L120] SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L121] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L125] input_2 = __VERIFIER_nondet_uchar() [L126] EXPR input_2 & mask_SORT_1 [L126] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L126] input_2 = input_2 & mask_SORT_1 [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_5 = __VERIFIER_nondet_uchar() [L129] input_6 = __VERIFIER_nondet_uchar() [L130] input_7 = __VERIFIER_nondet_uchar() [L131] input_8 = __VERIFIER_nondet_uchar() [L132] input_9 = __VERIFIER_nondet_uchar() [L133] EXPR input_9 & mask_SORT_1 [L133] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L133] input_9 = input_9 & mask_SORT_1 [L134] input_90 = __VERIFIER_nondet_uchar() [L135] input_105 = __VERIFIER_nondet_uchar() [L136] input_127 = __VERIFIER_nondet_uchar() [L137] input_128 = __VERIFIER_nondet_uchar() [L138] input_129 = __VERIFIER_nondet_uchar() [L139] input_137 = __VERIFIER_nondet_uchar() [L140] input_139 = __VERIFIER_nondet_uchar() [L141] input_141 = __VERIFIER_nondet_uchar() [L142] input_167 = __VERIFIER_nondet_uchar() [L143] input_168 = __VERIFIER_nondet_uchar() [L144] input_176 = __VERIFIER_nondet_uchar() [L145] input_178 = __VERIFIER_nondet_uchar() [L146] input_180 = __VERIFIER_nondet_uchar() [L147] input_182 = __VERIFIER_nondet_uchar() [L148] input_236 = __VERIFIER_nondet_uchar() [L149] input_245 = __VERIFIER_nondet_uchar() [L150] input_246 = __VERIFIER_nondet_uchar() [L151] input_247 = __VERIFIER_nondet_uchar() [L152] input_248 = __VERIFIER_nondet_uchar() [L153] input_273 = __VERIFIER_nondet_uchar() [L154] input_274 = __VERIFIER_nondet_uchar() [L155] input_275 = __VERIFIER_nondet_uchar() [L156] input_284 = __VERIFIER_nondet_uchar() [L157] input_330 = __VERIFIER_nondet_uchar() [L158] input_340 = __VERIFIER_nondet_uchar() [L159] input_341 = __VERIFIER_nondet_uchar() [L160] input_342 = __VERIFIER_nondet_uchar() [L161] input_343 = __VERIFIER_nondet_uchar() [L162] input_352 = __VERIFIER_nondet_uchar() [L163] input_371 = __VERIFIER_nondet_uchar() [L164] input_372 = __VERIFIER_nondet_uchar() [L165] input_373 = __VERIFIER_nondet_uchar() [L166] input_382 = __VERIFIER_nondet_uchar() [L167] input_384 = __VERIFIER_nondet_uchar() [L168] input_430 = __VERIFIER_nondet_uchar() [L169] input_441 = __VERIFIER_nondet_uchar() [L170] input_442 = __VERIFIER_nondet_uchar() [L171] input_443 = __VERIFIER_nondet_uchar() [L172] input_444 = __VERIFIER_nondet_uchar() [L173] input_453 = __VERIFIER_nondet_uchar() [L174] input_455 = __VERIFIER_nondet_uchar() [L175] input_475 = __VERIFIER_nondet_uchar() [L176] input_476 = __VERIFIER_nondet_uchar() [L177] input_477 = __VERIFIER_nondet_uchar() [L178] input_486 = __VERIFIER_nondet_uchar() [L179] input_488 = __VERIFIER_nondet_uchar() [L180] input_490 = __VERIFIER_nondet_uchar() [L183] SORT_10 var_13_arg_0 = state_11; [L184] SORT_10 var_13_arg_1 = var_12; [L185] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L186] SORT_1 var_20_arg_0 = var_16; [L187] SORT_3 var_20_arg_1 = state_19; [L188] SORT_3 var_20_arg_2 = state_18; [L189] SORT_3 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L190] SORT_1 var_17_arg_0 = var_16; [L191] SORT_3 var_17_arg_1 = state_15; [L192] SORT_3 var_17_arg_2 = state_14; [L193] SORT_3 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L194] SORT_1 var_21_arg_0 = var_16; [L195] SORT_3 var_21_arg_1 = var_20; [L196] SORT_3 var_21_arg_2 = var_17; [L197] SORT_3 var_21 = var_21_arg_0 ? var_21_arg_1 : var_21_arg_2; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_13=1, var_16=1, var_21=0, var_22=0, var_25=0, var_68=1] [L198] EXPR var_21 & mask_SORT_3 [L198] EXPR var_21 & mask_SORT_3 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_13=1, var_16=1, var_22=0, var_25=0, var_68=1] [L198] var_21 = var_21 & mask_SORT_3 [L199] SORT_3 var_23_arg_0 = var_21; [L200] SORT_3 var_23_arg_1 = var_22; [L201] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L202] SORT_1 var_24_arg_0 = var_13; [L203] SORT_1 var_24_arg_1 = var_23; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_24_arg_0=1, var_24_arg_1=1, var_25=0, var_68=1] [L204] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_24_arg_0=1, var_24_arg_1=1, var_25=0, var_68=1] [L204] EXPR var_24_arg_0 & var_24_arg_1 [L204] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L204] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L205] SORT_1 var_27_arg_0 = var_25; [L206] SORT_3 var_27_arg_1 = state_19; [L207] SORT_3 var_27_arg_2 = state_18; [L208] SORT_3 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L209] SORT_1 var_26_arg_0 = var_25; [L210] SORT_3 var_26_arg_1 = state_15; [L211] SORT_3 var_26_arg_2 = state_14; [L212] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L213] SORT_1 var_28_arg_0 = var_16; [L214] SORT_3 var_28_arg_1 = var_27; [L215] SORT_3 var_28_arg_2 = var_26; [L216] SORT_3 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_24=1, var_25=0, var_28=0, var_68=1] [L217] EXPR var_28 & mask_SORT_3 [L217] EXPR var_28 & mask_SORT_3 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_24=1, var_25=0, var_68=1] [L217] var_28 = var_28 & mask_SORT_3 [L218] SORT_3 var_29_arg_0 = var_28; [L219] SORT_3 var_29_arg_1 = var_22; [L220] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L221] SORT_1 var_30_arg_0 = var_24; [L222] SORT_1 var_30_arg_1 = var_29; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_30_arg_0=1, var_30_arg_1=1, var_68=1] [L223] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_30_arg_0=1, var_30_arg_1=1, var_68=1] [L223] EXPR var_30_arg_0 & var_30_arg_1 [L223] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L223] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L224] SORT_1 var_32_arg_0 = var_16; [L225] SORT_3 var_32_arg_1 = state_19; [L226] SORT_3 var_32_arg_2 = state_18; [L227] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L228] SORT_1 var_31_arg_0 = var_16; [L229] SORT_3 var_31_arg_1 = state_15; [L230] SORT_3 var_31_arg_2 = state_14; [L231] SORT_3 var_31 = var_31_arg_0 ? var_31_arg_1 : var_31_arg_2; [L232] SORT_1 var_33_arg_0 = var_25; [L233] SORT_3 var_33_arg_1 = var_32; [L234] SORT_3 var_33_arg_2 = var_31; [L235] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_30=1, var_33=0, var_68=1] [L236] EXPR var_33 & mask_SORT_3 [L236] EXPR var_33 & mask_SORT_3 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_30=1, var_68=1] [L236] var_33 = var_33 & mask_SORT_3 [L237] SORT_3 var_34_arg_0 = var_33; [L238] SORT_3 var_34_arg_1 = var_22; [L239] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L240] SORT_1 var_35_arg_0 = var_30; [L241] SORT_1 var_35_arg_1 = var_34; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_35_arg_0=1, var_35_arg_1=1, var_68=1] [L242] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_35_arg_0=1, var_35_arg_1=1, var_68=1] [L242] EXPR var_35_arg_0 & var_35_arg_1 [L242] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L242] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L243] SORT_1 var_37_arg_0 = var_25; [L244] SORT_3 var_37_arg_1 = state_19; [L245] SORT_3 var_37_arg_2 = state_18; [L246] SORT_3 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L247] SORT_1 var_36_arg_0 = var_25; [L248] SORT_3 var_36_arg_1 = state_15; [L249] SORT_3 var_36_arg_2 = state_14; [L250] SORT_3 var_36 = var_36_arg_0 ? var_36_arg_1 : var_36_arg_2; [L251] SORT_1 var_38_arg_0 = var_25; [L252] SORT_3 var_38_arg_1 = var_37; [L253] SORT_3 var_38_arg_2 = var_36; [L254] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_35=1, var_38=0, var_68=1] [L255] EXPR var_38 & mask_SORT_3 [L255] EXPR var_38 & mask_SORT_3 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_35=1, var_68=1] [L255] var_38 = var_38 & mask_SORT_3 [L256] SORT_3 var_39_arg_0 = var_38; [L257] SORT_3 var_39_arg_1 = var_22; [L258] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L259] SORT_1 var_40_arg_0 = var_35; [L260] SORT_1 var_40_arg_1 = var_39; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_40_arg_0=1, var_40_arg_1=1, var_68=1] [L261] EXPR var_40_arg_0 & var_40_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_40_arg_0=1, var_40_arg_1=1, var_68=1] [L261] EXPR var_40_arg_0 & var_40_arg_1 [L261] EXPR var_40_arg_0 & var_40_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L261] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L262] SORT_1 var_41_arg_0 = var_40; [L263] SORT_1 var_41 = ~var_41_arg_0; [L264] SORT_1 var_44_arg_0 = var_41; [L265] SORT_1 var_44 = ~var_44_arg_0; [L266] SORT_1 var_45_arg_0 = var_16; [L267] SORT_1 var_45_arg_1 = var_44; VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_45_arg_0=1, var_45_arg_1=-255, var_68=1] [L268] EXPR var_45_arg_0 & var_45_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_45_arg_0=1, var_45_arg_1=-255, var_68=1] [L268] EXPR var_45_arg_0 & var_45_arg_1 [L268] EXPR var_45_arg_0 & var_45_arg_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L268] SORT_1 var_45 = var_45_arg_0 & var_45_arg_1; [L269] EXPR var_45 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_45=1, var_68=1] [L269] EXPR var_45 & mask_SORT_1 [L269] EXPR var_45 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L269] var_45 = var_45 & mask_SORT_1 [L270] SORT_1 bad_46_arg_0 = var_45; VAL [bad_46_arg_0=1, input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L271] CALL __VERIFIER_assert(!(bad_46_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, 637 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2033 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2030 mSDsluCounter, 38073 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29824 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 8249 mSDtfsCounter, 259 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1244occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 606 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 656 NumberOfCodeBlocks, 656 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 1135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 could not prove your program: unable to determine feasibility of some traces [2024-08-15 18:23:55,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_arrays_bpbs_p4.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-03fe66f-m [2024-08-15 18:23:57,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:23:57,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-15 18:23:57,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:23:57,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:23:57,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:23:57,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:23:57,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:23:57,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:23:57,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:23:57,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:23:57,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:23:57,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:23:57,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:23:57,914 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:23:57,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:23:57,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:23:57,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:23:57,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:23:57,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:23:57,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:23:57,917 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-15 18:23:57,918 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-15 18:23:57,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:23:57,918 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-15 18:23:57,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:23:57,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:23:57,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:23:57,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:23:57,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:23:57,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:23:57,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:23:57,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:23:57,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:23:57,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:23:57,922 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-15 18:23:57,922 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-15 18:23:57,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:23:57,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:23:57,923 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:23:57,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:23:57,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:23:57,924 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-15 18:23:57,924 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-15 18:23:58,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:23:58,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:23:58,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:23:58,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:23:58,285 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:23:58,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c [2024-08-15 18:23:59,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:24:00,279 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:24:00,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p4.c [2024-08-15 18:24:00,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55df1216/112ad1334f6f4683a69b32f6f61a4239/FLAGb1418b0b4 [2024-08-15 18:24:00,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55df1216/112ad1334f6f4683a69b32f6f61a4239 [2024-08-15 18:24:00,520 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:24:00,522 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:24:00,524 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.vis_arrays_bpbs_p4.yml/witness.yml [2024-08-15 18:24:00,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:24:00,581 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:24:00,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:24:00,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:24:00,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:24:00,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:24:00" (1/2) ... [2024-08-15 18:24:00,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585a7a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:24:00, skipping insertion in model container [2024-08-15 18:24:00,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:24:00" (1/2) ... [2024-08-15 18:24:00,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ed69937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:24:00, skipping insertion in model container [2024-08-15 18:24:00,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:24:00" (2/2) ... [2024-08-15 18:24:00,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585a7a3b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:00, skipping insertion in model container [2024-08-15 18:24:00,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:24:00" (2/2) ... [2024-08-15 18:24:00,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:24:00,891 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.vis_arrays_bpbs_p4.c[1258,1271] [2024-08-15 18:24:01,241 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:24:01,257 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:24:01,271 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.vis_arrays_bpbs_p4.c[1258,1271] [2024-08-15 18:24:01,477 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:24:01,495 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:24:01,497 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01 WrapperNode [2024-08-15 18:24:01,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:24:01,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:24:01,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:24:01,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:24:01,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (1/1) ... [2024-08-15 18:24:01,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (1/1) ... [2024-08-15 18:24:01,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (1/1) ... [2024-08-15 18:24:01,607 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-15 18:24:01,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (1/1) ... [2024-08-15 18:24:01,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (1/1) ... [2024-08-15 18:24:01,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (1/1) ... [2024-08-15 18:24:01,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (1/1) ... [2024-08-15 18:24:01,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (1/1) ... [2024-08-15 18:24:01,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:24:01,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:24:01,726 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:24:01,726 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:24:01,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (1/1) ... [2024-08-15 18:24:01,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:24:01,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:24:01,762 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-15 18:24:01,764 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-15 18:24:01,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:24:01,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:24:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:24:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:24:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:24:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:24:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:24:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:24:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:24:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:24:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:24:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:24:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:24:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:24:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:24:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:24:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:24:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:24:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-15 18:24:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:24:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-15 18:24:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-15 18:24:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:24:02,201 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:24:02,204 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:24:04,432 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-08-15 18:24:04,432 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:24:04,442 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:24:04,444 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:24:04,445 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:24:04 BoogieIcfgContainer [2024-08-15 18:24:04,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:24:04,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:24:04,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:24:04,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:24:04,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:24:00" (1/4) ... [2024-08-15 18:24:04,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475ed6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:24:04, skipping insertion in model container [2024-08-15 18:24:04,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:24:00" (2/4) ... [2024-08-15 18:24:04,454 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:24:04,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475ed6b5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:24:04, skipping insertion in model container [2024-08-15 18:24:04,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:24:01" (3/4) ... [2024-08-15 18:24:04,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475ed6b5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:24:04, skipping insertion in model container [2024-08-15 18:24:04,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:24:04" (4/4) ... [2024-08-15 18:24:04,458 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p4.c [2024-08-15 18:24:04,477 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:24:04,477 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:24:04,505 INFO L90 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [3] [2024-08-15 18:24:04,542 INFO L95 WitnessUtils]: Product has 41 reachable states. [2024-08-15 18:24:04,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:24:04,570 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;@59a98a29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:24:04,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:24:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-08-15 18:24:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-08-15 18:24:04,577 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:04,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:24:04,579 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:04,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1024331893, now seen corresponding path program 1 times [2024-08-15 18:24:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-15 18:24:04,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128431880] [2024-08-15 18:24:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:04,618 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-15 18:24:04,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-15 18:24:04,619 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-15 18:24:04,621 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-15 18:24:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:24:04,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:24:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:24:05,135 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-15 18:24:05,141 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:24:05,142 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:24:05,150 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-08-15 18:24:05,349 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-15 18:24:05,354 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-15 18:24:05,358 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:24:05,397 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:24:05 BoogieIcfgContainer [2024-08-15 18:24:05,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:24:05,399 INFO L158 Benchmark]: Toolchain (without parser) took 4817.67ms. Allocated memory was 60.8MB in the beginning and 172.0MB in the end (delta: 111.1MB). Free memory was 32.4MB in the beginning and 101.8MB in the end (delta: -69.4MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-08-15 18:24:05,399 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:24:05,400 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 60.8MB. Free memory is still 34.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:24:05,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 914.34ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 32.2MB in the beginning and 44.5MB in the end (delta: -12.2MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-08-15 18:24:05,401 INFO L158 Benchmark]: Boogie Preprocessor took 227.12ms. Allocated memory is still 90.2MB. Free memory was 44.4MB in the beginning and 55.2MB in the end (delta: -10.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-08-15 18:24:05,401 INFO L158 Benchmark]: IcfgBuilder took 2719.42ms. Allocated memory was 90.2MB in the beginning and 172.0MB in the end (delta: 81.8MB). Free memory was 55.2MB in the beginning and 43.0MB in the end (delta: 12.2MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2024-08-15 18:24:05,402 INFO L158 Benchmark]: TraceAbstraction took 950.47ms. Allocated memory is still 172.0MB. Free memory was 43.0MB in the beginning and 101.8MB in the end (delta: -58.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:24:05,404 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 60.8MB. Free memory is still 34.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 914.34ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 32.2MB in the beginning and 44.5MB in the end (delta: -12.2MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 227.12ms. Allocated memory is still 90.2MB. Free memory was 44.4MB in the beginning and 55.2MB in the end (delta: -10.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * IcfgBuilder took 2719.42ms. Allocated memory was 90.2MB in the beginning and 172.0MB in the end (delta: 81.8MB). Free memory was 55.2MB in the beginning and 43.0MB in the end (delta: 12.2MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. * TraceAbstraction took 950.47ms. Allocated memory is still 172.0MB. Free memory was 43.0MB in the beginning and 101.8MB in the end (delta: -58.8MB). There was no memory consumed. 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 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 32); [L36] const SORT_66 msb_SORT_66 = (SORT_66)1 << (32 - 1); [L38] const SORT_100 mask_SORT_100 = (SORT_100)-1 >> (sizeof(SORT_100) * 8 - 3); [L39] const SORT_100 msb_SORT_100 = (SORT_100)1 << (3 - 1); [L41] const SORT_10 var_12 = 15; [L42] const SORT_1 var_16 = 1; [L43] const SORT_3 var_22 = 0; [L44] const SORT_1 var_25 = 0; [L45] const SORT_66 var_68 = 1; [L46] const SORT_3 var_106 = 3; [L47] const SORT_66 var_115 = 2; [L48] const SORT_66 var_122 = 0; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_3 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L57] SORT_1 input_90; [L58] SORT_3 input_105; [L59] SORT_3 input_127; [L60] SORT_3 input_128; [L61] SORT_3 input_129; [L62] SORT_3 input_137; [L63] SORT_3 input_139; [L64] SORT_3 input_141; [L65] SORT_3 input_167; [L66] SORT_3 input_168; [L67] SORT_3 input_176; [L68] SORT_3 input_178; [L69] SORT_3 input_180; [L70] SORT_3 input_182; [L71] SORT_3 input_236; [L72] SORT_3 input_245; [L73] SORT_3 input_246; [L74] SORT_3 input_247; [L75] SORT_3 input_248; [L76] SORT_3 input_273; [L77] SORT_3 input_274; [L78] SORT_3 input_275; [L79] SORT_3 input_284; [L80] SORT_3 input_330; [L81] SORT_3 input_340; [L82] SORT_3 input_341; [L83] SORT_3 input_342; [L84] SORT_3 input_343; [L85] SORT_3 input_352; [L86] SORT_3 input_371; [L87] SORT_3 input_372; [L88] SORT_3 input_373; [L89] SORT_3 input_382; [L90] SORT_3 input_384; [L91] SORT_3 input_430; [L92] SORT_3 input_441; [L93] SORT_3 input_442; [L94] SORT_3 input_443; [L95] SORT_3 input_444; [L96] SORT_3 input_453; [L97] SORT_3 input_455; [L98] SORT_3 input_475; [L99] SORT_3 input_476; [L100] SORT_3 input_477; [L101] SORT_3 input_486; [L102] SORT_3 input_488; [L103] SORT_3 input_490; [L105] SORT_10 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L106] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L107] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L108] SORT_3 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L109] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L110] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L111] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L112] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L113] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L114] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L115] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L116] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L117] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L118] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L119] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L120] SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L121] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_2 = input_2 & mask_SORT_1 [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_5 = __VERIFIER_nondet_uchar() [L129] input_6 = __VERIFIER_nondet_uchar() [L130] input_7 = __VERIFIER_nondet_uchar() [L131] input_8 = __VERIFIER_nondet_uchar() [L132] input_9 = __VERIFIER_nondet_uchar() [L133] input_9 = input_9 & mask_SORT_1 [L134] input_90 = __VERIFIER_nondet_uchar() [L135] input_105 = __VERIFIER_nondet_uchar() [L136] input_127 = __VERIFIER_nondet_uchar() [L137] input_128 = __VERIFIER_nondet_uchar() [L138] input_129 = __VERIFIER_nondet_uchar() [L139] input_137 = __VERIFIER_nondet_uchar() [L140] input_139 = __VERIFIER_nondet_uchar() [L141] input_141 = __VERIFIER_nondet_uchar() [L142] input_167 = __VERIFIER_nondet_uchar() [L143] input_168 = __VERIFIER_nondet_uchar() [L144] input_176 = __VERIFIER_nondet_uchar() [L145] input_178 = __VERIFIER_nondet_uchar() [L146] input_180 = __VERIFIER_nondet_uchar() [L147] input_182 = __VERIFIER_nondet_uchar() [L148] input_236 = __VERIFIER_nondet_uchar() [L149] input_245 = __VERIFIER_nondet_uchar() [L150] input_246 = __VERIFIER_nondet_uchar() [L151] input_247 = __VERIFIER_nondet_uchar() [L152] input_248 = __VERIFIER_nondet_uchar() [L153] input_273 = __VERIFIER_nondet_uchar() [L154] input_274 = __VERIFIER_nondet_uchar() [L155] input_275 = __VERIFIER_nondet_uchar() [L156] input_284 = __VERIFIER_nondet_uchar() [L157] input_330 = __VERIFIER_nondet_uchar() [L158] input_340 = __VERIFIER_nondet_uchar() [L159] input_341 = __VERIFIER_nondet_uchar() [L160] input_342 = __VERIFIER_nondet_uchar() [L161] input_343 = __VERIFIER_nondet_uchar() [L162] input_352 = __VERIFIER_nondet_uchar() [L163] input_371 = __VERIFIER_nondet_uchar() [L164] input_372 = __VERIFIER_nondet_uchar() [L165] input_373 = __VERIFIER_nondet_uchar() [L166] input_382 = __VERIFIER_nondet_uchar() [L167] input_384 = __VERIFIER_nondet_uchar() [L168] input_430 = __VERIFIER_nondet_uchar() [L169] input_441 = __VERIFIER_nondet_uchar() [L170] input_442 = __VERIFIER_nondet_uchar() [L171] input_443 = __VERIFIER_nondet_uchar() [L172] input_444 = __VERIFIER_nondet_uchar() [L173] input_453 = __VERIFIER_nondet_uchar() [L174] input_455 = __VERIFIER_nondet_uchar() [L175] input_475 = __VERIFIER_nondet_uchar() [L176] input_476 = __VERIFIER_nondet_uchar() [L177] input_477 = __VERIFIER_nondet_uchar() [L178] input_486 = __VERIFIER_nondet_uchar() [L179] input_488 = __VERIFIER_nondet_uchar() [L180] input_490 = __VERIFIER_nondet_uchar() [L183] SORT_10 var_13_arg_0 = state_11; [L184] SORT_10 var_13_arg_1 = var_12; [L185] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L186] SORT_1 var_20_arg_0 = var_16; [L187] SORT_3 var_20_arg_1 = state_19; [L188] SORT_3 var_20_arg_2 = state_18; [L189] SORT_3 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L190] SORT_1 var_17_arg_0 = var_16; [L191] SORT_3 var_17_arg_1 = state_15; [L192] SORT_3 var_17_arg_2 = state_14; [L193] SORT_3 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L194] SORT_1 var_21_arg_0 = var_16; [L195] SORT_3 var_21_arg_1 = var_20; [L196] SORT_3 var_21_arg_2 = var_17; [L197] SORT_3 var_21 = var_21_arg_0 ? var_21_arg_1 : var_21_arg_2; [L198] var_21 = var_21 & mask_SORT_3 [L199] SORT_3 var_23_arg_0 = var_21; [L200] SORT_3 var_23_arg_1 = var_22; [L201] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L202] SORT_1 var_24_arg_0 = var_13; [L203] SORT_1 var_24_arg_1 = var_23; [L204] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L205] SORT_1 var_27_arg_0 = var_25; [L206] SORT_3 var_27_arg_1 = state_19; [L207] SORT_3 var_27_arg_2 = state_18; [L208] SORT_3 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L209] SORT_1 var_26_arg_0 = var_25; [L210] SORT_3 var_26_arg_1 = state_15; [L211] SORT_3 var_26_arg_2 = state_14; [L212] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L213] SORT_1 var_28_arg_0 = var_16; [L214] SORT_3 var_28_arg_1 = var_27; [L215] SORT_3 var_28_arg_2 = var_26; [L216] SORT_3 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; [L217] var_28 = var_28 & mask_SORT_3 [L218] SORT_3 var_29_arg_0 = var_28; [L219] SORT_3 var_29_arg_1 = var_22; [L220] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L221] SORT_1 var_30_arg_0 = var_24; [L222] SORT_1 var_30_arg_1 = var_29; [L223] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L224] SORT_1 var_32_arg_0 = var_16; [L225] SORT_3 var_32_arg_1 = state_19; [L226] SORT_3 var_32_arg_2 = state_18; [L227] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L228] SORT_1 var_31_arg_0 = var_16; [L229] SORT_3 var_31_arg_1 = state_15; [L230] SORT_3 var_31_arg_2 = state_14; [L231] SORT_3 var_31 = var_31_arg_0 ? var_31_arg_1 : var_31_arg_2; [L232] SORT_1 var_33_arg_0 = var_25; [L233] SORT_3 var_33_arg_1 = var_32; [L234] SORT_3 var_33_arg_2 = var_31; [L235] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L236] var_33 = var_33 & mask_SORT_3 [L237] SORT_3 var_34_arg_0 = var_33; [L238] SORT_3 var_34_arg_1 = var_22; [L239] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L240] SORT_1 var_35_arg_0 = var_30; [L241] SORT_1 var_35_arg_1 = var_34; [L242] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L243] SORT_1 var_37_arg_0 = var_25; [L244] SORT_3 var_37_arg_1 = state_19; [L245] SORT_3 var_37_arg_2 = state_18; [L246] SORT_3 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L247] SORT_1 var_36_arg_0 = var_25; [L248] SORT_3 var_36_arg_1 = state_15; [L249] SORT_3 var_36_arg_2 = state_14; [L250] SORT_3 var_36 = var_36_arg_0 ? var_36_arg_1 : var_36_arg_2; [L251] SORT_1 var_38_arg_0 = var_25; [L252] SORT_3 var_38_arg_1 = var_37; [L253] SORT_3 var_38_arg_2 = var_36; [L254] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L255] var_38 = var_38 & mask_SORT_3 [L256] SORT_3 var_39_arg_0 = var_38; [L257] SORT_3 var_39_arg_1 = var_22; [L258] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L259] SORT_1 var_40_arg_0 = var_35; [L260] SORT_1 var_40_arg_1 = var_39; [L261] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L262] SORT_1 var_41_arg_0 = var_40; [L263] SORT_1 var_41 = ~var_41_arg_0; [L264] SORT_1 var_44_arg_0 = var_41; [L265] SORT_1 var_44 = ~var_44_arg_0; [L266] SORT_1 var_45_arg_0 = var_16; [L267] SORT_1 var_45_arg_1 = var_44; [L268] SORT_1 var_45 = var_45_arg_0 & var_45_arg_1; [L269] var_45 = var_45 & mask_SORT_1 [L270] SORT_1 bad_46_arg_0 = var_45; VAL [bad_46_arg_0=1, input_2=0, input_9=0, mask_SORT_100=7, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_3=3, state_11=15, state_14=0, state_15=0, state_18=0, state_19=0, state_48=0, state_49=0, state_50=0, state_51=0, state_52=0, state_53=0, state_54=0, state_55=0, state_56=0, state_57=0, state_58=0, state_59=0, var_106=3, var_115=2, var_122=0, var_12=15, var_16=1, var_22=0, var_25=0, var_68=1] [L271] CALL __VERIFIER_assert(!(bad_46_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: 0.8s, OverallIterations: 1, TraceHistogramMax: 1, 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=41occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 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-15 18:24:05,435 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