./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_fru32_p3.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26998269 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_fru32_p3.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:27:43,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:27:43,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-14 14:27:43,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:27:43,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:27:43,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:27:43,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:27:43,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:27:43,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:27:43,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:27:43,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:27:43,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:27:43,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:27:43,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:27:43,645 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:27:43,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:27:43,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:27:43,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:27:43,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:27:43,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:27:43,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:27:43,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:27:43,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:27:43,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:27:43,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:27:43,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:27:43,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:27:43,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:27:43,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:27:43,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:27:43,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:27:43,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:27:43,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:27:43,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:27:43,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:27:43,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:27:43,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:27:43,651 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:27:43,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:27:43,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:27:43,652 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:27:43,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:27:43,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:27:43,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:27:43,883 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:27:43,884 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:27:43,884 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_QF_BV_fru32_p3.yml/witness.yml [2024-08-14 14:27:43,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:27:43,944 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:27:43,944 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_QF_BV_fru32_p3.c [2024-08-14 14:27:45,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:27:45,318 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:27:45,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-08-14 14:27:45,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e88001a/4e2c06ccc038467985d1317f091270a3/FLAG302cf9192 [2024-08-14 14:27:45,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e88001a/4e2c06ccc038467985d1317f091270a3 [2024-08-14 14:27:45,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:27:45,693 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:27:45,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:45,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:27:45,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:27:45,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:43" (1/2) ... [2024-08-14 14:27:45,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da3830a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:45, skipping insertion in model container [2024-08-14 14:27:45,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:43" (1/2) ... [2024-08-14 14:27:45,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4db2c7de and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:45, skipping insertion in model container [2024-08-14 14:27:45,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:45" (2/2) ... [2024-08-14 14:27:45,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da3830a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:45, skipping insertion in model container [2024-08-14 14:27:45,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:45" (2/2) ... [2024-08-14 14:27:45,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:27:45,863 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_QF_BV_fru32_p3.c[1258,1271] [2024-08-14 14:27:45,961 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:45,974 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:27:45,984 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_QF_BV_fru32_p3.c[1258,1271] [2024-08-14 14:27:46,058 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:46,070 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:27:46,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46 WrapperNode [2024-08-14 14:27:46,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:46,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:27:46,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:27:46,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:27:46,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (1/1) ... [2024-08-14 14:27:46,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (1/1) ... [2024-08-14 14:27:46,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (1/1) ... [2024-08-14 14:27:46,150 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:27:46,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (1/1) ... [2024-08-14 14:27:46,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (1/1) ... [2024-08-14 14:27:46,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (1/1) ... [2024-08-14 14:27:46,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (1/1) ... [2024-08-14 14:27:46,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (1/1) ... [2024-08-14 14:27:46,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:27:46,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:27:46,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:27:46,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:27:46,188 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (1/1) ... [2024-08-14 14:27:46,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:27:46,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:46,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:27:46,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:27:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:27:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:27:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:27:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:27:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:27:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:27:46,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:27:46,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:27:46,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:27:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:27:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:27:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:27:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:27:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:27:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:27:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:27:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:27:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:27:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:27:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:27:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:27:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:27:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:27:46,367 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:27:46,368 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:27:47,082 INFO L? ?]: Removed 450 outVars from TransFormulas that were not future-live. [2024-08-14 14:27:47,082 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:27:47,091 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:27:47,091 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:27:47,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:47 BoogieIcfgContainer [2024-08-14 14:27:47,091 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:27:47,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:27:47,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:27:47,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:27:47,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:43" (1/4) ... [2024-08-14 14:27:47,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a32766 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:27:47, skipping insertion in model container [2024-08-14 14:27:47,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:27:45" (2/4) ... [2024-08-14 14:27:47,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a32766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:47, skipping insertion in model container [2024-08-14 14:27:47,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:46" (3/4) ... [2024-08-14 14:27:47,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a32766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:47, skipping insertion in model container [2024-08-14 14:27:47,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:47" (4/4) ... [2024-08-14 14:27:47,100 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-08-14 14:27:47,100 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:27:47,118 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:27:47,119 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:27:47,149 INFO L92 WitnessUtils]: Constructing product of automaton with 195 states and violation witness of the following lengths: [3] [2024-08-14 14:27:47,154 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 195 states, 187 states have (on average 1.6363636363636365) internal successors, (306), 188 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:47,303 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 446 states to 431 states. [2024-08-14 14:27:47,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:27:47,325 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;@4d53fd95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:27:47,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:27:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states. [2024-08-14 14:27:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-08-14 14:27:47,335 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:47,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:27:47,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:47,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash 991428783, now seen corresponding path program 1 times [2024-08-14 14:27:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:47,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694433162] [2024-08-14 14:27:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:48,216 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-14 14:27:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:48,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694433162] [2024-08-14 14:27:48,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694433162] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:48,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:48,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501658058] [2024-08-14 14:27:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:48,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:48,248 INFO L87 Difference]: Start difference. First operand 431 states. Second operand has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-14 14:27:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:48,330 INFO L93 Difference]: Finished difference Result 323 states and 523 transitions. [2024-08-14 14:27:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:27:48,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 117 [2024-08-14 14:27:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:48,336 INFO L225 Difference]: With dead ends: 323 [2024-08-14 14:27:48,338 INFO L226 Difference]: Without dead ends: 323 [2024-08-14 14:27:48,339 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-14 14:27:48,342 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 28 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:48,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1501 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:27:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-08-14 14:27:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 195. [2024-08-14 14:27:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 187 states have (on average 1.625668449197861) internal successors, (304), 188 states have internal predecessors, (304), 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-14 14:27:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 311 transitions. [2024-08-14 14:27:48,392 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 311 transitions. Word has length 117 [2024-08-14 14:27:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:48,393 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 311 transitions. [2024-08-14 14:27:48,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-14 14:27:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 311 transitions. [2024-08-14 14:27:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-08-14 14:27:48,396 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:48,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:27:48,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:27:48,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:48,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:48,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1165124306, now seen corresponding path program 1 times [2024-08-14 14:27:48,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137295735] [2024-08-14 14:27:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:48,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:48,723 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-14 14:27:48,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:48,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137295735] [2024-08-14 14:27:48,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137295735] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:48,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:48,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:27:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029424970] [2024-08-14 14:27:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:48,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:27:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:48,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:27:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:27:48,729 INFO L87 Difference]: Start difference. First operand 195 states and 311 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-14 14:27:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:48,754 INFO L93 Difference]: Finished difference Result 197 states and 313 transitions. [2024-08-14 14:27:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:27:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 118 [2024-08-14 14:27:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:48,756 INFO L225 Difference]: With dead ends: 197 [2024-08-14 14:27:48,756 INFO L226 Difference]: Without dead ends: 197 [2024-08-14 14:27:48,756 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-14 14:27:48,757 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 0 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:48,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 902 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:27:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-08-14 14:27:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-08-14 14:27:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 189 states have (on average 1.619047619047619) internal successors, (306), 190 states have internal predecessors, (306), 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-14 14:27:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 313 transitions. [2024-08-14 14:27:48,767 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 313 transitions. Word has length 118 [2024-08-14 14:27:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:48,767 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 313 transitions. [2024-08-14 14:27:48,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-14 14:27:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 313 transitions. [2024-08-14 14:27:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-08-14 14:27:48,769 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:48,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:27:48,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 14:27:48,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:48,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1647031180, now seen corresponding path program 1 times [2024-08-14 14:27:48,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:48,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303127807] [2024-08-14 14:27:48,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:48,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:49,825 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-14 14:27:49,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:49,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303127807] [2024-08-14 14:27:49,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303127807] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:49,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:49,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:27:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711502915] [2024-08-14 14:27:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:49,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:27:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:49,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:27:49,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:27:49,830 INFO L87 Difference]: Start difference. First operand 197 states and 313 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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-14 14:27:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:49,928 INFO L93 Difference]: Finished difference Result 200 states and 316 transitions. [2024-08-14 14:27:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:49,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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 119 [2024-08-14 14:27:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:49,929 INFO L225 Difference]: With dead ends: 200 [2024-08-14 14:27:49,929 INFO L226 Difference]: Without dead ends: 200 [2024-08-14 14:27:49,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:49,930 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 206 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:49,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1382 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:27:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-08-14 14:27:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-08-14 14:27:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 192 states have (on average 1.609375) internal successors, (309), 193 states have internal predecessors, (309), 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-14 14:27:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2024-08-14 14:27:49,943 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 119 [2024-08-14 14:27:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:49,943 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2024-08-14 14:27:49,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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-14 14:27:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2024-08-14 14:27:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-08-14 14:27:49,944 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:49,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:27:49,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 14:27:49,945 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:49,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -160423283, now seen corresponding path program 1 times [2024-08-14 14:27:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255549019] [2024-08-14 14:27:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:50,577 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-14 14:27:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:50,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255549019] [2024-08-14 14:27:50,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255549019] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:50,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:50,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 14:27:50,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303023857] [2024-08-14 14:27:50,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:50,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-14 14:27:50,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:50,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-14 14:27:50,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:27:50,583 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-14 14:27:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:50,598 INFO L93 Difference]: Finished difference Result 200 states and 315 transitions. [2024-08-14 14:27:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-14 14:27:50,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 119 [2024-08-14 14:27:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:50,600 INFO L225 Difference]: With dead ends: 200 [2024-08-14 14:27:50,601 INFO L226 Difference]: Without dead ends: 200 [2024-08-14 14:27:50,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-14 14:27:50,602 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 13 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:50,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 878 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:27:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-08-14 14:27:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-08-14 14:27:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 192 states have (on average 1.6041666666666667) internal successors, (308), 193 states have internal predecessors, (308), 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-14 14:27:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 315 transitions. [2024-08-14 14:27:50,613 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 315 transitions. Word has length 119 [2024-08-14 14:27:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:50,613 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 315 transitions. [2024-08-14 14:27:50,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-14 14:27:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 315 transitions. [2024-08-14 14:27:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-08-14 14:27:50,616 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:50,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:27:50,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-14 14:27:50,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:50,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1105430574, now seen corresponding path program 1 times [2024-08-14 14:27:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:50,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685573732] [2024-08-14 14:27:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:50,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:51,386 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-14 14:27:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685573732] [2024-08-14 14:27:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685573732] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:51,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 14:27:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545938992] [2024-08-14 14:27:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:51,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 14:27:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 14:27:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:51,390 INFO L87 Difference]: Start difference. First operand 200 states and 315 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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-14 14:27:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:51,750 INFO L93 Difference]: Finished difference Result 327 states and 498 transitions. [2024-08-14 14:27:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 14:27:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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 120 [2024-08-14 14:27:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:51,752 INFO L225 Difference]: With dead ends: 327 [2024-08-14 14:27:51,752 INFO L226 Difference]: Without dead ends: 206 [2024-08-14 14:27:51,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-08-14 14:27:51,753 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 407 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:51,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 2158 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-14 14:27:51,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-08-14 14:27:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2024-08-14 14:27:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 197 states have (on average 1.5939086294416243) internal successors, (314), 198 states have internal predecessors, (314), 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-14 14:27:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 321 transitions. [2024-08-14 14:27:51,764 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 321 transitions. Word has length 120 [2024-08-14 14:27:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:51,764 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 321 transitions. [2024-08-14 14:27:51,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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-14 14:27:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 321 transitions. [2024-08-14 14:27:51,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-08-14 14:27:51,767 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:51,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:27:51,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 14:27:51,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:51,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1956912420, now seen corresponding path program 1 times [2024-08-14 14:27:51,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:51,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628040406] [2024-08-14 14:27:51,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:51,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:52,298 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-14 14:27:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:52,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628040406] [2024-08-14 14:27:52,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628040406] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:52,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 14:27:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91880455] [2024-08-14 14:27:52,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:52,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 14:27:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:52,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 14:27:52,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:52,300 INFO L87 Difference]: Start difference. First operand 205 states and 321 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-14 14:27:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:52,336 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2024-08-14 14:27:52,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 14:27:52,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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 121 [2024-08-14 14:27:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:52,338 INFO L225 Difference]: With dead ends: 212 [2024-08-14 14:27:52,338 INFO L226 Difference]: Without dead ends: 212 [2024-08-14 14:27:52,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 14:27:52,339 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 3 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:52,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1480 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-14 14:27:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-08-14 14:27:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2024-08-14 14:27:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 202 states have (on average 1.5841584158415842) internal successors, (320), 203 states have internal predecessors, (320), 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-14 14:27:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 327 transitions. [2024-08-14 14:27:52,342 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 327 transitions. Word has length 121 [2024-08-14 14:27:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:52,343 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 327 transitions. [2024-08-14 14:27:52,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-14 14:27:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 327 transitions. [2024-08-14 14:27:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-08-14 14:27:52,344 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:52,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:27:52,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-14 14:27:52,344 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:52,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash -401517694, now seen corresponding path program 1 times [2024-08-14 14:27:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:52,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74262415] [2024-08-14 14:27:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-14 14:27:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 14:27:53,000 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-14 14:27:53,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 14:27:53,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74262415] [2024-08-14 14:27:53,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74262415] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 14:27:53,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 14:27:53,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 14:27:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543580578] [2024-08-14 14:27:53,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 14:27:53,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-14 14:27:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 14:27:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-14 14:27:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-08-14 14:27:53,002 INFO L87 Difference]: Start difference. First operand 210 states and 327 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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-14 14:27:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-14 14:27:53,090 INFO L93 Difference]: Finished difference Result 210 states and 326 transitions. [2024-08-14 14:27:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 14:27:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 121 [2024-08-14 14:27:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-14 14:27:53,091 INFO L225 Difference]: With dead ends: 210 [2024-08-14 14:27:53,092 INFO L226 Difference]: Without dead ends: 210 [2024-08-14 14:27:53,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-08-14 14:27:53,092 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 185 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-14 14:27:53,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1407 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-14 14:27:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-08-14 14:27:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2024-08-14 14:27:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 201 states have (on average 1.5820895522388059) internal successors, (318), 202 states have internal predecessors, (318), 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-14 14:27:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 325 transitions. [2024-08-14 14:27:53,099 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 325 transitions. Word has length 121 [2024-08-14 14:27:53,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-14 14:27:53,099 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 325 transitions. [2024-08-14 14:27:53,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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-14 14:27:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 325 transitions. [2024-08-14 14:27:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-08-14 14:27:53,101 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:53,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:27:53,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 14:27:53,101 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:53,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2085995139, now seen corresponding path program 1 times [2024-08-14 14:27:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:27:53,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288463522] [2024-08-14 14:27:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:53,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:27:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:53,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:27:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:53,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:27:53,420 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:27:53,421 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:27:53,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-14 14:27:53,424 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:53,427 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:27:53,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:27:53 BoogieIcfgContainer [2024-08-14 14:27:53,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:27:53,507 INFO L158 Benchmark]: Toolchain (without parser) took 7814.83ms. Allocated memory was 205.5MB in the beginning and 450.9MB in the end (delta: 245.4MB). Free memory was 173.5MB in the beginning and 229.8MB in the end (delta: -56.3MB). Peak memory consumption was 188.4MB. Max. memory is 16.1GB. [2024-08-14 14:27:53,508 INFO L158 Benchmark]: Witness Parser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:53,508 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 134.2MB. Free memory was 106.8MB in the beginning and 106.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:53,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.32ms. Allocated memory is still 205.5MB. Free memory was 173.3MB in the beginning and 153.4MB in the end (delta: 19.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-08-14 14:27:53,510 INFO L158 Benchmark]: Boogie Preprocessor took 112.21ms. Allocated memory is still 205.5MB. Free memory was 153.4MB in the beginning and 147.1MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-14 14:27:53,510 INFO L158 Benchmark]: IcfgBuilder took 906.93ms. Allocated memory is still 205.5MB. Free memory was 147.1MB in the beginning and 118.7MB in the end (delta: 28.5MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-08-14 14:27:53,511 INFO L158 Benchmark]: TraceAbstraction took 6414.17ms. Allocated memory was 205.5MB in the beginning and 450.9MB in the end (delta: 245.4MB). Free memory was 118.7MB in the beginning and 229.8MB in the end (delta: -111.1MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. [2024-08-14 14:27:53,511 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 134.2MB. Free memory was 106.8MB in the beginning and 106.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.32ms. Allocated memory is still 205.5MB. Free memory was 173.3MB in the beginning and 153.4MB in the end (delta: 19.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.21ms. Allocated memory is still 205.5MB. Free memory was 153.4MB in the beginning and 147.1MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 906.93ms. Allocated memory is still 205.5MB. Free memory was 147.1MB in the beginning and 118.7MB in the end (delta: 28.5MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6414.17ms. Allocated memory was 205.5MB in the beginning and 450.9MB in the end (delta: 245.4MB). Free memory was 118.7MB in the beginning and 229.8MB in the end (delta: -111.1MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 325, overapproximation of bitwiseAnd at line 332. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 [L88] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 [L89] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 [L90] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] EXPR input_4 & mask_SORT_3 [L133] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] EXPR input_5 & mask_SORT_1 [L135] EXPR input_5 & mask_SORT_1 VAL [input_4=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] EXPR input_8 & mask_SORT_3 [L138] EXPR input_8 & mask_SORT_3 VAL [input_4=0, input_5=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] EXPR input_10 & mask_SORT_1 [L141] EXPR input_10 & mask_SORT_1 VAL [input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] EXPR input_11 & mask_SORT_1 [L143] EXPR input_11 & mask_SORT_1 VAL [input_10=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] EXPR input_14 & mask_SORT_3 [L147] EXPR input_14 & mask_SORT_3 VAL [input_10=0, input_11=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] EXPR input_16 & mask_SORT_3 [L150] EXPR input_16 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] EXPR input_17 & mask_SORT_3 [L152] EXPR input_17 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] EXPR input_18 & mask_SORT_3 [L154] EXPR input_18 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] EXPR input_19 & mask_SORT_3 [L156] EXPR input_19 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] EXPR var_27 & mask_SORT_3 [L170] EXPR var_27 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_71_arg_0=0, var_71_arg_1=1, var_89=0] [L179] EXPR var_71_arg_0 & var_71_arg_1 [L179] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_75_arg_0=0, var_75_arg_1=1, var_89=0] [L185] EXPR var_75_arg_0 & var_75_arg_1 [L185] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_79_arg_0=0, var_79_arg_1=0, var_89=0] [L191] EXPR var_79_arg_0 & var_79_arg_1 [L191] EXPR var_79_arg_0 & var_79_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83_arg_0=0, var_83_arg_1=0, var_89=0] [L197] EXPR var_83_arg_0 & var_83_arg_1 [L197] EXPR var_83_arg_0 & var_83_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] EXPR var_44 & mask_SORT_43 [L200] EXPR var_44 & mask_SORT_43 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85_arg_0=0, var_85_arg_1=1, var_89=0] [L206] EXPR var_85_arg_0 & var_85_arg_1 [L206] EXPR var_85_arg_0 & var_85_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] EXPR var_85 & mask_SORT_3 [L207] EXPR var_85 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_54_arg_0=0, var_54_arg_1=1, var_66=3, var_85=0, var_89=0] [L216] EXPR var_54_arg_0 & var_54_arg_1 [L216] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_58_arg_0=0, var_58_arg_1=0, var_66=3, var_85=0, var_89=0] [L222] EXPR var_58_arg_0 & var_58_arg_1 [L222] EXPR var_58_arg_0 & var_58_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_62_arg_0=0, var_62_arg_1=0, var_66=3, var_85=0, var_89=0] [L228] EXPR var_62_arg_0 & var_62_arg_1 [L228] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_64_arg_0=0, var_64_arg_1=1, var_66=3, var_85=0, var_89=0] [L234] EXPR var_64_arg_0 & var_64_arg_1 [L234] EXPR var_64_arg_0 & var_64_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] EXPR var_64 & mask_SORT_3 [L235] EXPR var_64 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_33_arg_0=0, var_33_arg_1=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] EXPR var_33_arg_0 & var_33_arg_1 [L244] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_38_arg_0=0, var_38_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] EXPR var_38_arg_0 & var_38_arg_1 [L250] EXPR var_38_arg_0 & var_38_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_42_arg_0=0, var_42_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] EXPR var_42_arg_0 & var_42_arg_1 [L256] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_47_arg_0=0, var_47_arg_1=1, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] EXPR var_47_arg_0 & var_47_arg_1 [L262] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] EXPR var_47 & mask_SORT_3 [L263] EXPR var_47 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_86=0, var_89=0] [L276] EXPR var_86 & mask_SORT_21 [L276] EXPR var_86 & mask_SORT_21 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_101_arg_0=0, var_101_arg_1=1, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] EXPR var_101_arg_0 | var_101_arg_1 [L293] EXPR var_101_arg_0 | var_101_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] EXPR var_101 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_101=1, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L294] EXPR var_101 & mask_SORT_3 [L294] EXPR var_101 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] EXPR var_105 & mask_SORT_1 [L316] EXPR var_105 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_106=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] EXPR var_106 & mask_SORT_1 [L319] EXPR var_106 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_108_arg_0=-1, var_108_arg_1=1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] EXPR var_108_arg_0 | var_108_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_108_arg_0=-1, var_108_arg_1=1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] EXPR var_108_arg_0 | var_108_arg_1 [L325] EXPR var_108_arg_0 | var_108_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_113_arg_0=1, var_113_arg_1=-1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] EXPR var_113_arg_0 & var_113_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_113_arg_0=1, var_113_arg_1=-1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] EXPR var_113_arg_0 & var_113_arg_1 [L332] EXPR var_113_arg_0 & var_113_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] EXPR var_113 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_113=1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L333] EXPR var_113 & mask_SORT_3 [L333] EXPR var_113 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; VAL [bad_114_arg_0=1, input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L335] CALL __VERIFIER_assert(!(bad_114_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, 202 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 842 mSDsluCounter, 9708 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7540 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 546 IncrementalHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 2168 mSDtfsCounter, 546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 132 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 956 NumberOfCodeBlocks, 956 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 828 ConstructedInterpolants, 0 QuantifiedInterpolants, 2019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-14 14:27:53,539 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_QF_BV_fru32_p3.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_fru32_p3.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-2699826-m [2024-08-14 14:27:55,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:27:55,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-14 14:27:55,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:27:55,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:27:55,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:27:55,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:27:55,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:27:55,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:27:55,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:27:55,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:27:55,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:27:55,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:27:55,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:27:55,369 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:27:55,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:27:55,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:27:55,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:27:55,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:27:55,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:27:55,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:27:55,371 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-14 14:27:55,371 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-14 14:27:55,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:27:55,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-14 14:27:55,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:27:55,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:27:55,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:27:55,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:27:55,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:27:55,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:27:55,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:27:55,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:27:55,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:27:55,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:27:55,375 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-14 14:27:55,375 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-14 14:27:55,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:27:55,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:27:55,376 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:27:55,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:27:55,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:27:55,376 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-14 14:27:55,376 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-14 14:27:55,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:27:55,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:27:55,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:27:55,659 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:27:55,659 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:27:55,660 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_QF_BV_fru32_p3.yml/witness.yml [2024-08-14 14:27:55,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:27:55,709 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:27:55,710 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_QF_BV_fru32_p3.c [2024-08-14 14:27:56,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:27:57,153 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:27:57,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-08-14 14:27:57,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fb27c3a/818e3a557355446dae941619145492f6/FLAG12b40c2d5 [2024-08-14 14:27:57,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92fb27c3a/818e3a557355446dae941619145492f6 [2024-08-14 14:27:57,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:27:57,182 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:27:57,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:57,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:27:57,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:27:57,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:55" (1/2) ... [2024-08-14 14:27:57,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57fd201a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:57, skipping insertion in model container [2024-08-14 14:27:57,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:55" (1/2) ... [2024-08-14 14:27:57,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b031dc6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:27:57, skipping insertion in model container [2024-08-14 14:27:57,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:57" (2/2) ... [2024-08-14 14:27:57,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57fd201a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57, skipping insertion in model container [2024-08-14 14:27:57,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:27:57" (2/2) ... [2024-08-14 14:27:57,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:27:57,357 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_QF_BV_fru32_p3.c[1258,1271] [2024-08-14 14:27:57,450 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:57,461 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:27:57,472 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_QF_BV_fru32_p3.c[1258,1271] [2024-08-14 14:27:57,563 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:27:57,578 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:27:57,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57 WrapperNode [2024-08-14 14:27:57,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:27:57,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:27:57,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:27:57,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:27:57,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (1/1) ... [2024-08-14 14:27:57,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (1/1) ... [2024-08-14 14:27:57,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (1/1) ... [2024-08-14 14:27:57,630 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-14 14:27:57,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (1/1) ... [2024-08-14 14:27:57,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (1/1) ... [2024-08-14 14:27:57,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (1/1) ... [2024-08-14 14:27:57,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (1/1) ... [2024-08-14 14:27:57,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (1/1) ... [2024-08-14 14:27:57,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:27:57,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:27:57,662 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:27:57,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:27:57,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (1/1) ... [2024-08-14 14:27:57,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:27:57,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:27:57,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-14 14:27:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-14 14:27:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:27:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:27:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:27:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-14 14:27:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-14 14:27:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:27:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-14 14:27:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-14 14:27:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-14 14:27:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-14 14:27:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:27:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-14 14:27:57,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-14 14:27:57,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:27:57,855 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:27:57,857 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:27:58,239 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2024-08-14 14:27:58,240 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:27:58,247 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:27:58,247 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:27:58,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:58 BoogieIcfgContainer [2024-08-14 14:27:58,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:27:58,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:27:58,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:27:58,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:27:58,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:27:55" (1/4) ... [2024-08-14 14:27:58,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edd02b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:27:58, skipping insertion in model container [2024-08-14 14:27:58,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:27:57" (2/4) ... [2024-08-14 14:27:58,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edd02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:58, skipping insertion in model container [2024-08-14 14:27:58,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:27:57" (3/4) ... [2024-08-14 14:27:58,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edd02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:27:58, skipping insertion in model container [2024-08-14 14:27:58,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:27:58" (4/4) ... [2024-08-14 14:27:58,257 INFO L119 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-08-14 14:27:58,257 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:27:58,272 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:27:58,273 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:27:58,290 INFO L92 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [3] [2024-08-14 14:27:58,293 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-14 14:27:58,314 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 41 states to 26 states. [2024-08-14 14:27:58,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:27:58,334 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;@16ee3ad9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:27:58,334 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:27:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2024-08-14 14:27:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-08-14 14:27:58,338 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:27:58,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 14:27:58,339 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:27:58,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:27:58,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1024331893, now seen corresponding path program 1 times [2024-08-14 14:27:58,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-14 14:27:58,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734788047] [2024-08-14 14:27:58,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:27:58,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:27:58,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-14 14:27:58,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-14 14:27:58,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-14 14:27:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:58,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:27:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:27:58,647 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-14 14:27:58,648 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:27:58,649 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:27:58,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-08-14 14:27:58,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-14 14:27:58,855 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:27:58,858 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:27:58,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:27:58 BoogieIcfgContainer [2024-08-14 14:27:58,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:27:58,891 INFO L158 Benchmark]: Toolchain (without parser) took 1707.86ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 53.0MB in the beginning and 57.3MB in the end (delta: -4.2MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-08-14 14:27:58,892 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 46.1MB. Free memory was 22.2MB in the beginning and 22.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:58,892 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 46.1MB. Free memory was 20.0MB in the beginning and 20.0MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:58,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.37ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 52.8MB in the end (delta: 46.8kB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-08-14 14:27:58,893 INFO L158 Benchmark]: Boogie Preprocessor took 82.83ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 48.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-14 14:27:58,894 INFO L158 Benchmark]: IcfgBuilder took 586.46ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 48.0MB in the beginning and 56.9MB in the end (delta: -9.0MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-08-14 14:27:58,895 INFO L158 Benchmark]: TraceAbstraction took 638.71ms. Allocated memory is still 104.9MB. Free memory was 56.4MB in the beginning and 57.3MB in the end (delta: -867.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:27:58,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.13ms. Allocated memory is still 46.1MB. Free memory was 22.2MB in the beginning and 22.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 46.1MB. Free memory was 20.0MB in the beginning and 20.0MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.37ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 52.8MB in the end (delta: 46.8kB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.83ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 48.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 586.46ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 48.0MB in the beginning and 56.9MB in the end (delta: -9.0MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 638.71ms. Allocated memory is still 104.9MB. Free memory was 56.4MB in the beginning and 57.3MB in the end (delta: -867.1kB). 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 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; VAL [bad_114_arg_0=1, input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L335] CALL __VERIFIER_assert(!(bad_114_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.6s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred 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-14 14:27:58,924 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