./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.mul6.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03fe66fa Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.mul6.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-03fe66f-m [2024-08-15 18:19:55,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:19:55,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-15 18:19:55,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:19:55,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:19:55,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:19:55,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:19:55,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:19:55,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:19:55,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:19:55,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:19:55,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:19:55,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:19:55,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:19:55,633 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:19:55,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:19:55,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:19:55,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-15 18:19:55,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:19:55,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:19:55,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:19:55,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:19:55,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:19:55,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:19:55,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:19:55,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:19:55,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:19:55,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:19:55,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:19:55,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:19:55,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:19:55,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:19:55,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:19:55,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-15 18:19:55,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-15 18:19:55,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:19:55,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:19:55,640 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:19:55,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:19:55,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:19:55,641 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-15 18:19:55,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:19:55,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:19:55,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:19:55,960 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:19:55,961 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:19:55,963 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.mul6.yml/witness.yml [2024-08-15 18:19:56,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:19:56,044 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:19:56,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-08-15 18:19:57,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:19:57,817 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:19:57,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-08-15 18:19:57,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fac0796b/b051923430a14ca988e07d35bb58db21/FLAGab23e456f [2024-08-15 18:19:57,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fac0796b/b051923430a14ca988e07d35bb58db21 [2024-08-15 18:19:57,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:19:57,843 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:19:57,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:19:57,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:19:57,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:19:57,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:19:56" (1/2) ... [2024-08-15 18:19:57,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5762f9f4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:57, skipping insertion in model container [2024-08-15 18:19:57,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:19:56" (1/2) ... [2024-08-15 18:19:57,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3501e5fc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:19:57, skipping insertion in model container [2024-08-15 18:19:57,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:19:57" (2/2) ... [2024-08-15 18:19:57,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5762f9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:57, skipping insertion in model container [2024-08-15 18:19:57,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:19:57" (2/2) ... [2024-08-15 18:19:57,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:19:58,104 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.mul6.c[1298,1311] [2024-08-15 18:19:58,174 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:19:58,191 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:19:58,207 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.mul6.c[1298,1311] [2024-08-15 18:19:58,277 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:19:58,305 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:19:58,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58 WrapperNode [2024-08-15 18:19:58,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:19:58,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:19:58,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:19:58,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:19:58,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (1/1) ... [2024-08-15 18:19:58,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (1/1) ... [2024-08-15 18:19:58,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (1/1) ... [2024-08-15 18:19:58,388 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-08-15 18:19:58,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (1/1) ... [2024-08-15 18:19:58,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (1/1) ... [2024-08-15 18:19:58,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (1/1) ... [2024-08-15 18:19:58,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (1/1) ... [2024-08-15 18:19:58,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (1/1) ... [2024-08-15 18:19:58,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:19:58,433 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:19:58,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:19:58,434 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:19:58,434 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (1/1) ... [2024-08-15 18:19:58,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:19:58,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:19:58,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-15 18:19:58,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-15 18:19:58,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:19:58,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:19:58,506 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:19:58,506 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:19:58,507 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:19:58,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:19:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:19:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:19:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:19:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:19:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint128 [2024-08-15 18:19:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:19:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:19:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:19:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:19:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:19:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:19:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:19:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:19:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-15 18:19:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-15 18:19:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:19:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-15 18:19:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-15 18:19:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-15 18:19:58,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-15 18:19:58,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:19:58,644 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:19:58,646 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:19:59,473 INFO L? ?]: Removed 209 outVars from TransFormulas that were not future-live. [2024-08-15 18:19:59,473 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:19:59,490 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:19:59,491 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:19:59,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:19:59 BoogieIcfgContainer [2024-08-15 18:19:59,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:19:59,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:19:59,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:19:59,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:19:59,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:19:56" (1/4) ... [2024-08-15 18:19:59,502 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:19:59,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2915128a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:19:59, skipping insertion in model container [2024-08-15 18:19:59,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:19:57" (2/4) ... [2024-08-15 18:19:59,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2915128a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:19:59, skipping insertion in model container [2024-08-15 18:19:59,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:19:58" (3/4) ... [2024-08-15 18:19:59,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2915128a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:19:59, skipping insertion in model container [2024-08-15 18:19:59,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:19:59" (4/4) ... [2024-08-15 18:19:59,510 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul6.c [2024-08-15 18:19:59,531 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:19:59,532 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:19:59,570 INFO L90 WitnessUtils]: Constructing product of automaton with 114 states and violation witness of the following lengths: [9] [2024-08-15 18:19:59,741 INFO L95 WitnessUtils]: Product has 520 reachable states. [2024-08-15 18:19:59,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:19:59,774 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;@27974d37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:19:59,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:19:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 818 transitions. [2024-08-15 18:19:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-08-15 18:19:59,792 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:19:59,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:19:59,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:19:59,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:19:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1228237153, now seen corresponding path program 1 times [2024-08-15 18:19:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:19:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050064982] [2024-08-15 18:19:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:19:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:01,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:20:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-15 18:20:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-08-15 18:20:01,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:01,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050064982] [2024-08-15 18:20:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050064982] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:20:01,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:20:01,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:20:01,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434117575] [2024-08-15 18:20:01,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:20:01,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:20:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:01,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:20:01,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:20:01,442 INFO L87 Difference]: Start difference. First operand 520 states and 818 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:20:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:01,554 INFO L93 Difference]: Finished difference Result 424 states and 670 transitions. [2024-08-15 18:20:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:20:01,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 143 [2024-08-15 18:20:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:01,575 INFO L225 Difference]: With dead ends: 424 [2024-08-15 18:20:01,575 INFO L226 Difference]: Without dead ends: 420 [2024-08-15 18:20:01,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:20:01,580 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 73 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 826 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.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:01,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 826 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:20:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-08-15 18:20:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 205. [2024-08-15 18:20:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 195 states have (on average 1.6102564102564103) internal successors, (314), 196 states have internal predecessors, (314), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:20:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 323 transitions. [2024-08-15 18:20:01,632 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 323 transitions. Word has length 143 [2024-08-15 18:20:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:01,633 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 323 transitions. [2024-08-15 18:20:01,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:20:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions. [2024-08-15 18:20:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-08-15 18:20:01,636 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:01,636 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:01,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-15 18:20:01,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:01,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2047201513, now seen corresponding path program 1 times [2024-08-15 18:20:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:01,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306955741] [2024-08-15 18:20:01,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:20:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:02,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-15 18:20:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-08-15 18:20:02,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:02,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306955741] [2024-08-15 18:20:02,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306955741] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:20:02,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:20:02,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-15 18:20:02,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940793671] [2024-08-15 18:20:02,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:20:02,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-15 18:20:02,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:02,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-15 18:20:02,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:20:02,212 INFO L87 Difference]: Start difference. First operand 205 states and 323 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:20:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:02,247 INFO L93 Difference]: Finished difference Result 211 states and 329 transitions. [2024-08-15 18:20:02,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-15 18:20:02,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 144 [2024-08-15 18:20:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:02,251 INFO L225 Difference]: With dead ends: 211 [2024-08-15 18:20:02,252 INFO L226 Difference]: Without dead ends: 211 [2024-08-15 18:20:02,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:20:02,254 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:02,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 497 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:20:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-08-15 18:20:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2024-08-15 18:20:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.5979899497487438) internal successors, (318), 200 states have internal predecessors, (318), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:20:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 327 transitions. [2024-08-15 18:20:02,280 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 327 transitions. Word has length 144 [2024-08-15 18:20:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:02,281 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 327 transitions. [2024-08-15 18:20:02,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:20:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 327 transitions. [2024-08-15 18:20:02,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-08-15 18:20:02,287 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:02,287 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:02,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-15 18:20:02,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:02,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1683849890, now seen corresponding path program 1 times [2024-08-15 18:20:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326716812] [2024-08-15 18:20:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:03,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:03,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:20:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-08-15 18:20:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-08-15 18:20:03,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:03,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326716812] [2024-08-15 18:20:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326716812] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:20:03,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:20:03,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-15 18:20:03,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494073900] [2024-08-15 18:20:03,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:20:03,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-15 18:20:03,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:03,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-15 18:20:03,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:20:03,069 INFO L87 Difference]: Start difference. First operand 209 states and 327 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:20:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:03,107 INFO L93 Difference]: Finished difference Result 209 states and 323 transitions. [2024-08-15 18:20:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-15 18:20:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 145 [2024-08-15 18:20:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:03,109 INFO L225 Difference]: With dead ends: 209 [2024-08-15 18:20:03,109 INFO L226 Difference]: Without dead ends: 209 [2024-08-15 18:20:03,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-08-15 18:20:03,112 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 97 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:03,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 338 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:20:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-08-15 18:20:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-08-15 18:20:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.5778894472361809) internal successors, (314), 200 states have internal predecessors, (314), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:20:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions. [2024-08-15 18:20:03,122 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 145 [2024-08-15 18:20:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:03,123 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions. [2024-08-15 18:20:03,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:20:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions. [2024-08-15 18:20:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-08-15 18:20:03,125 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:03,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:03,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-15 18:20:03,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:03,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1174152532, now seen corresponding path program 1 times [2024-08-15 18:20:03,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:03,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827918661] [2024-08-15 18:20:03,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:20:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-08-15 18:20:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-08-15 18:20:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:03,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827918661] [2024-08-15 18:20:03,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827918661] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:20:03,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166411269] [2024-08-15 18:20:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:03,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:03,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:20:03,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:20:03,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-15 18:20:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:04,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 26 conjunts are in the unsatisfiable core [2024-08-15 18:20:04,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:20:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-08-15 18:20:04,671 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:20:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166411269] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:20:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:20:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-08-15 18:20:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308679204] [2024-08-15 18:20:04,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:20:04,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-15 18:20:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:04,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-15 18:20:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-08-15 18:20:04,674 INFO L87 Difference]: Start difference. First operand 209 states and 323 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:20:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:04,895 INFO L93 Difference]: Finished difference Result 212 states and 325 transitions. [2024-08-15 18:20:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:20:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 147 [2024-08-15 18:20:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:04,897 INFO L225 Difference]: With dead ends: 212 [2024-08-15 18:20:04,897 INFO L226 Difference]: Without dead ends: 212 [2024-08-15 18:20:04,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-08-15 18:20:04,898 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 172 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:04,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 614 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-15 18:20:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-08-15 18:20:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-08-15 18:20:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.5643564356435644) internal successors, (316), 203 states have internal predecessors, (316), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:20:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 325 transitions. [2024-08-15 18:20:04,917 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 325 transitions. Word has length 147 [2024-08-15 18:20:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:04,918 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 325 transitions. [2024-08-15 18:20:04,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:20:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 325 transitions. [2024-08-15 18:20:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-08-15 18:20:04,920 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:04,920 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:04,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-08-15 18:20:05,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:05,128 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:05,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash 242801240, now seen corresponding path program 1 times [2024-08-15 18:20:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113144883] [2024-08-15 18:20:05,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:05,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:20:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:05,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-08-15 18:20:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-08-15 18:20:05,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:05,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113144883] [2024-08-15 18:20:05,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113144883] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:20:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:20:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:20:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385690701] [2024-08-15 18:20:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:20:05,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:20:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:05,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:20:05,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:20:05,757 INFO L87 Difference]: Start difference. First operand 212 states and 325 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:20:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:05,885 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2024-08-15 18:20:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:20:05,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 148 [2024-08-15 18:20:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:05,888 INFO L225 Difference]: With dead ends: 332 [2024-08-15 18:20:05,888 INFO L226 Difference]: Without dead ends: 212 [2024-08-15 18:20:05,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:20:05,889 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 130 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:05,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 788 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:20:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-08-15 18:20:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-08-15 18:20:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.5594059405940595) internal successors, (315), 203 states have internal predecessors, (315), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:20:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 324 transitions. [2024-08-15 18:20:05,902 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 324 transitions. Word has length 148 [2024-08-15 18:20:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:05,902 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 324 transitions. [2024-08-15 18:20:05,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:20:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 324 transitions. [2024-08-15 18:20:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-08-15 18:20:05,904 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:05,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:05,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-15 18:20:05,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:05,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:05,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1239746107, now seen corresponding path program 1 times [2024-08-15 18:20:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:05,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66564482] [2024-08-15 18:20:05,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:05,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:06,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:20:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:06,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-15 18:20:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 64 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:20:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:06,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66564482] [2024-08-15 18:20:06,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66564482] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:20:06,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501203866] [2024-08-15 18:20:06,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:06,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:06,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:20:06,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:20:06,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-15 18:20:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:06,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-15 18:20:06,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:20:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:20:07,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:20:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 64 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:20:08,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501203866] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:20:08,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:20:08,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2024-08-15 18:20:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598712417] [2024-08-15 18:20:08,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:20:08,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-15 18:20:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-15 18:20:08,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-08-15 18:20:08,110 INFO L87 Difference]: Start difference. First operand 212 states and 324 transitions. Second operand has 16 states, 16 states have (on average 19.25) internal successors, (308), 16 states have internal predecessors, (308), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-15 18:20:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:08,448 INFO L93 Difference]: Finished difference Result 212 states and 322 transitions. [2024-08-15 18:20:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:20:08,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 19.25) internal successors, (308), 16 states have internal predecessors, (308), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 149 [2024-08-15 18:20:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:08,451 INFO L225 Difference]: With dead ends: 212 [2024-08-15 18:20:08,451 INFO L226 Difference]: Without dead ends: 212 [2024-08-15 18:20:08,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-08-15 18:20:08,452 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 145 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:08,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 958 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-15 18:20:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-08-15 18:20:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-08-15 18:20:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.5495049504950495) internal successors, (313), 203 states have internal predecessors, (313), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:20:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 322 transitions. [2024-08-15 18:20:08,461 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 322 transitions. Word has length 149 [2024-08-15 18:20:08,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:08,461 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 322 transitions. [2024-08-15 18:20:08,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.25) internal successors, (308), 16 states have internal predecessors, (308), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-15 18:20:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 322 transitions. [2024-08-15 18:20:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-08-15 18:20:08,463 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:08,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:08,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-08-15 18:20:08,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-08-15 18:20:08,664 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:08,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash -730905633, now seen corresponding path program 1 times [2024-08-15 18:20:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405917117] [2024-08-15 18:20:08,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:09,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:10,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:20:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-08-15 18:20:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:20:10,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:10,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405917117] [2024-08-15 18:20:10,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405917117] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:20:10,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481590461] [2024-08-15 18:20:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:10,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:10,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:20:10,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:20:10,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-15 18:20:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:10,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 47 conjunts are in the unsatisfiable core [2024-08-15 18:20:10,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:20:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:20:11,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:20:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:20:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481590461] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:20:12,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:20:12,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 30 [2024-08-15 18:20:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37596796] [2024-08-15 18:20:12,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:20:12,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-08-15 18:20:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-08-15 18:20:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2024-08-15 18:20:12,860 INFO L87 Difference]: Start difference. First operand 212 states and 322 transitions. Second operand has 30 states, 30 states have (on average 12.9) internal successors, (387), 30 states have internal predecessors, (387), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-15 18:20:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:14,187 INFO L93 Difference]: Finished difference Result 298 states and 452 transitions. [2024-08-15 18:20:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-15 18:20:14,187 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 12.9) internal successors, (387), 30 states have internal predecessors, (387), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 150 [2024-08-15 18:20:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:14,189 INFO L225 Difference]: With dead ends: 298 [2024-08-15 18:20:14,189 INFO L226 Difference]: Without dead ends: 298 [2024-08-15 18:20:14,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=572, Invalid=2184, Unknown=0, NotChecked=0, Total=2756 [2024-08-15 18:20:14,191 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 559 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:14,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1582 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-08-15 18:20:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-08-15 18:20:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2024-08-15 18:20:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 286 states have (on average 1.534965034965035) internal successors, (439), 287 states have internal predecessors, (439), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:20:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 450 transitions. [2024-08-15 18:20:14,201 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 450 transitions. Word has length 150 [2024-08-15 18:20:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:14,202 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 450 transitions. [2024-08-15 18:20:14,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 12.9) internal successors, (387), 30 states have internal predecessors, (387), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-15 18:20:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 450 transitions. [2024-08-15 18:20:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-08-15 18:20:14,204 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:14,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:14,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-15 18:20:14,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:14,409 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:14,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1701574528, now seen corresponding path program 1 times [2024-08-15 18:20:14,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:14,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948727401] [2024-08-15 18:20:14,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:15,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-08-15 18:20:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-08-15 18:20:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-08-15 18:20:15,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948727401] [2024-08-15 18:20:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948727401] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:20:15,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:20:15,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-15 18:20:15,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480857680] [2024-08-15 18:20:15,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:20:15,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-15 18:20:15,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:15,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-15 18:20:15,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-15 18:20:15,267 INFO L87 Difference]: Start difference. First operand 297 states and 450 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:20:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:15,306 INFO L93 Difference]: Finished difference Result 297 states and 449 transitions. [2024-08-15 18:20:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-15 18:20:15,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 152 [2024-08-15 18:20:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:15,309 INFO L225 Difference]: With dead ends: 297 [2024-08-15 18:20:15,309 INFO L226 Difference]: Without dead ends: 297 [2024-08-15 18:20:15,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:20:15,310 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 58 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:15,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 591 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:20:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-08-15 18:20:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-08-15 18:20:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 286 states have (on average 1.5314685314685315) internal successors, (438), 287 states have internal predecessors, (438), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:20:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 449 transitions. [2024-08-15 18:20:15,321 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 449 transitions. Word has length 152 [2024-08-15 18:20:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:15,322 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 449 transitions. [2024-08-15 18:20:15,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:20:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 449 transitions. [2024-08-15 18:20:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-08-15 18:20:15,324 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:15,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:15,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-15 18:20:15,325 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:15,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1372534514, now seen corresponding path program 1 times [2024-08-15 18:20:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:15,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401506895] [2024-08-15 18:20:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-08-15 18:20:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:16,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-08-15 18:20:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-08-15 18:20:16,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401506895] [2024-08-15 18:20:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401506895] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:20:16,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018789334] [2024-08-15 18:20:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:16,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:16,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:20:16,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:20:16,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-15 18:20:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:16,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 22 conjunts are in the unsatisfiable core [2024-08-15 18:20:16,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:20:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-08-15 18:20:16,953 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:20:16,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018789334] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:20:16,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:20:16,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-08-15 18:20:16,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387793719] [2024-08-15 18:20:16,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:20:16,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-15 18:20:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:16,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-15 18:20:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-08-15 18:20:16,957 INFO L87 Difference]: Start difference. First operand 297 states and 449 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:20:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:17,096 INFO L93 Difference]: Finished difference Result 297 states and 448 transitions. [2024-08-15 18:20:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-15 18:20:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 153 [2024-08-15 18:20:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:17,099 INFO L225 Difference]: With dead ends: 297 [2024-08-15 18:20:17,099 INFO L226 Difference]: Without dead ends: 297 [2024-08-15 18:20:17,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-08-15 18:20:17,100 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 169 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:17,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 379 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:20:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-08-15 18:20:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-08-15 18:20:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 286 states have (on average 1.527972027972028) internal successors, (437), 287 states have internal predecessors, (437), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:20:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 448 transitions. [2024-08-15 18:20:17,108 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 448 transitions. Word has length 153 [2024-08-15 18:20:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:17,108 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 448 transitions. [2024-08-15 18:20:17,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:20:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 448 transitions. [2024-08-15 18:20:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-08-15 18:20:17,110 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:17,110 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:17,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-15 18:20:17,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:17,315 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:17,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1635950477, now seen corresponding path program 1 times [2024-08-15 18:20:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:17,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934354008] [2024-08-15 18:20:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:18,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:20:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:18,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-08-15 18:20:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-08-15 18:20:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-08-15 18:20:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:20:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934354008] [2024-08-15 18:20:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934354008] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:20:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518309503] [2024-08-15 18:20:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:18,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:20:18,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:20:18,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-15 18:20:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:20:18,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 24 conjunts are in the unsatisfiable core [2024-08-15 18:20:18,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:20:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 49 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-15 18:20:18,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:20:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-08-15 18:20:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518309503] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-15 18:20:18,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-15 18:20:19,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 19 [2024-08-15 18:20:19,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015990027] [2024-08-15 18:20:19,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:20:19,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-15 18:20:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:20:19,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-15 18:20:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-08-15 18:20:19,002 INFO L87 Difference]: Start difference. First operand 297 states and 448 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:20:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:20:19,068 INFO L93 Difference]: Finished difference Result 449 states and 678 transitions. [2024-08-15 18:20:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:20:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2024-08-15 18:20:19,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:20:19,070 INFO L225 Difference]: With dead ends: 449 [2024-08-15 18:20:19,071 INFO L226 Difference]: Without dead ends: 449 [2024-08-15 18:20:19,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-08-15 18:20:19,072 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 40 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:20:19,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 957 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:20:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-08-15 18:20:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 443. [2024-08-15 18:20:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 432 states have (on average 1.5231481481481481) internal successors, (658), 433 states have internal predecessors, (658), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:20:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 669 transitions. [2024-08-15 18:20:19,082 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 669 transitions. Word has length 153 [2024-08-15 18:20:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:20:19,083 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 669 transitions. [2024-08-15 18:20:19,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:20:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 669 transitions. [2024-08-15 18:20:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-08-15 18:20:19,085 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:19,085 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:19,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-08-15 18:20:19,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-08-15 18:20:19,290 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:19,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash 613419441, now seen corresponding path program 1 times [2024-08-15 18:20:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:20:19,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803247683] [2024-08-15 18:20:19,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:19,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:20:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-08-15 18:20:19,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949123235] [2024-08-15 18:20:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:19,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:20:19,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:20:19,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-15 18:20:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:20:19,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:20:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:20:20,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-15 18:20:20,174 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:20:20,175 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:20:20,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-08-15 18:20:20,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:20:20,384 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:20,388 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:20:20,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:20:20 BoogieIcfgContainer [2024-08-15 18:20:20,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:20:20,512 INFO L158 Benchmark]: Toolchain (without parser) took 22669.06ms. Allocated memory was 167.8MB in the beginning and 524.3MB in the end (delta: 356.5MB). Free memory was 96.1MB in the beginning and 270.4MB in the end (delta: -174.3MB). Peak memory consumption was 182.8MB. Max. memory is 16.1GB. [2024-08-15 18:20:20,513 INFO L158 Benchmark]: Witness Parser took 0.41ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 133.8MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:20:20,513 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:20:20,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.41ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 125.9MB in the end (delta: -29.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-08-15 18:20:20,513 INFO L158 Benchmark]: Boogie Preprocessor took 125.46ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 121.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-15 18:20:20,514 INFO L158 Benchmark]: IcfgBuilder took 1059.30ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 133.4MB in the end (delta: -11.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-08-15 18:20:20,514 INFO L158 Benchmark]: TraceAbstraction took 21015.02ms. Allocated memory was 167.8MB in the beginning and 524.3MB in the end (delta: 356.5MB). Free memory was 133.4MB in the beginning and 270.4MB in the end (delta: -137.0MB). Peak memory consumption was 221.6MB. Max. memory is 16.1GB. [2024-08-15 18:20:20,515 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.41ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 133.8MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.41ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 125.9MB in the end (delta: -29.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.46ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 121.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1059.30ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 133.4MB in the end (delta: -11.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21015.02ms. Allocated memory was 167.8MB in the beginning and 524.3MB in the end (delta: 356.5MB). Free memory was 133.4MB in the beginning and 270.4MB in the end (delta: -137.0MB). Peak memory consumption was 221.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 111, overapproximation of bitwiseAnd at line 173. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L36] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 128); [L37] const SORT_14 msb_SORT_14 = (SORT_14)1 << (128 - 1); [L39] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 32); [L40] const SORT_57 msb_SORT_57 = (SORT_57)1 << (32 - 1); [L42] const SORT_1 var_10 = 0; [L43] const SORT_14 var_15 = 0; [L44] const SORT_1 var_24 = 1; [L45] const SORT_5 var_28 = 0; [L46] const SORT_8 var_35 = 0; [L47] const SORT_57 var_58 = 1; [L48] const SORT_57 var_62 = 1000; [L49] const SORT_5 var_64 = 9223372036854775807; [L50] const SORT_5 var_67 = 12245771; [L52] SORT_1 input_2; [L53] SORT_1 input_3; [L54] SORT_1 input_4; [L55] SORT_5 input_6; [L56] SORT_5 input_7; [L57] SORT_8 input_9; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L59] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 [L60] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L60] SORT_14 state_16 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L61] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 [L61] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L61] SORT_14 state_18 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L62] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 [L62] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L62] SORT_5 state_29 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L63] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 [L63] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L63] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_ushort() & mask_SORT_8 [L64] EXPR __VERIFIER_nondet_ushort() & mask_SORT_8 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L64] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L65] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L66] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 [L67] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L67] SORT_5 state_42 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L68] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 [L68] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L68] SORT_5 state_44 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L70] SORT_1 init_12_arg_1 = var_10; [L71] state_11 = init_12_arg_1 [L72] SORT_14 init_17_arg_1 = var_15; [L73] state_16 = init_17_arg_1 [L74] SORT_14 init_19_arg_1 = var_15; [L75] state_18 = init_19_arg_1 [L76] SORT_5 init_30_arg_1 = var_28; [L77] state_29 = init_30_arg_1 [L78] SORT_5 init_32_arg_1 = var_28; [L79] state_31 = init_32_arg_1 [L80] SORT_8 init_37_arg_1 = var_35; [L81] state_36 = init_37_arg_1 [L82] SORT_1 init_39_arg_1 = var_24; [L83] state_38 = init_39_arg_1 [L84] SORT_1 init_41_arg_1 = var_24; [L85] state_40 = init_41_arg_1 [L86] SORT_5 init_43_arg_1 = var_28; [L87] state_42 = init_43_arg_1 [L88] SORT_5 init_45_arg_1 = var_28; [L89] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] EXPR input_3 & mask_SORT_1 [L94] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] EXPR input_4 & mask_SORT_1 [L96] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] EXPR input_6 & mask_SORT_5 [L98] EXPR input_6 & mask_SORT_5 VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] EXPR input_7 & mask_SORT_5 [L100] EXPR input_7 & mask_SORT_5 VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] EXPR var_21_arg_0 | var_21_arg_1 [L111] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-256, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] EXPR var_26_arg_0 & var_26_arg_1 [L116] EXPR var_26_arg_0 & var_26_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] EXPR var_26 & mask_SORT_1 [L117] EXPR var_26 & mask_SORT_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=-1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L124] EXPR var_33 & mask_SORT_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=-1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L124] EXPR var_33 & mask_SORT_1 [L124] EXPR var_33 & mask_SORT_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_52_arg_0=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L126] EXPR var_52_arg_0 & mask_SORT_5 [L126] EXPR var_52_arg_0 & mask_SORT_5 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_52=0, var_53_arg_0=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L129] EXPR var_53_arg_0 & mask_SORT_5 [L129] EXPR var_53_arg_0 & mask_SORT_5 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_52=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_55=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L138] EXPR var_55 & mask_SORT_14 [L138] EXPR var_55 & mask_SORT_14 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71_arg_0=1, var_71_arg_1=1] [L142] EXPR var_71_arg_0 | var_71_arg_1 [L142] EXPR var_71_arg_0 | var_71_arg_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] EXPR var_71 & mask_SORT_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=1] [L143] EXPR var_71 & mask_SORT_1 [L143] EXPR var_71 & mask_SORT_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_61_arg_0=0, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=1] [L145] EXPR var_61_arg_0 & mask_SORT_8 [L145] EXPR var_61_arg_0 & mask_SORT_8 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=1] [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_66_arg_0=0, var_66_arg_1=0, var_67=12245771, var_71=1] [L155] EXPR var_66_arg_0 & var_66_arg_1 [L155] EXPR var_66_arg_0 & var_66_arg_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=1] [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69_arg_0=0, var_69_arg_1=0, var_71=1] [L161] EXPR var_69_arg_0 & var_69_arg_1 [L161] EXPR var_69_arg_0 & var_69_arg_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=1] [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] EXPR var_69 & mask_SORT_1 [L162] EXPR var_69 & mask_SORT_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=1] [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_46_arg_0=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=1] [L164] EXPR var_46_arg_0 & mask_SORT_5 [L164] EXPR var_46_arg_0 & mask_SORT_5 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=1] [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_46=0, var_47_arg_0=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=1] [L167] EXPR var_47_arg_0 & mask_SORT_5 [L167] EXPR var_47_arg_0 & mask_SORT_5 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_46=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=1] [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_48=0, var_58=1, var_59_arg_0=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=1] [L173] EXPR var_59_arg_0 & mask_SORT_57 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_48=0, var_58=1, var_59_arg_0=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=1] [L173] EXPR var_59_arg_0 & mask_SORT_57 [L173] EXPR var_59_arg_0 & mask_SORT_57 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_48=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=1] [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_73=0] [L190] EXPR var_73 & mask_SORT_14 [L190] EXPR var_73 & mask_SORT_14 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] EXPR input_3 & mask_SORT_1 [L94] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] EXPR input_4 & mask_SORT_1 [L96] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] EXPR input_6 & mask_SORT_5 [L98] EXPR input_6 & mask_SORT_5 VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] EXPR input_7 & mask_SORT_5 [L100] EXPR input_7 & mask_SORT_5 VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_21_arg_0=-2, var_21_arg_1=1, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_21_arg_0=-2, var_21_arg_1=1, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] EXPR var_21_arg_0 | var_21_arg_1 [L111] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-256, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] EXPR var_26_arg_0 & var_26_arg_1 [L116] EXPR var_26_arg_0 & var_26_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] EXPR var_26 & mask_SORT_1 [L117] EXPR var_26 & mask_SORT_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=-2, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L124] EXPR var_33 & mask_SORT_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=-2, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L124] EXPR var_33 & mask_SORT_1 [L124] EXPR var_33 & mask_SORT_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_52_arg_0=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L126] EXPR var_52_arg_0 & mask_SORT_5 [L126] EXPR var_52_arg_0 & mask_SORT_5 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_52=0, var_53_arg_0=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L129] EXPR var_53_arg_0 & mask_SORT_5 [L129] EXPR var_53_arg_0 & mask_SORT_5 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_52=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_55=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L138] EXPR var_55 & mask_SORT_14 [L138] EXPR var_55 & mask_SORT_14 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71_arg_0=0, var_71_arg_1=0] [L142] EXPR var_71_arg_0 | var_71_arg_1 [L142] EXPR var_71_arg_0 | var_71_arg_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] EXPR var_71 & mask_SORT_1 [L143] EXPR var_71 & mask_SORT_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_61_arg_0=0, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=0] [L145] EXPR var_61_arg_0 & mask_SORT_8 [L145] EXPR var_61_arg_0 & mask_SORT_8 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=0] [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_66_arg_0=0, var_66_arg_1=0, var_67=12245771, var_71=0] [L155] EXPR var_66_arg_0 & var_66_arg_1 [L155] EXPR var_66_arg_0 & var_66_arg_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=0] [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69_arg_0=0, var_69_arg_1=0, var_71=0] [L161] EXPR var_69_arg_0 & var_69_arg_1 [L161] EXPR var_69_arg_0 & var_69_arg_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=0] [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] EXPR var_69 & mask_SORT_1 [L162] EXPR var_69 & mask_SORT_1 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_71=0] [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_46_arg_0=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=0] [L164] EXPR var_46_arg_0 & mask_SORT_5 [L164] EXPR var_46_arg_0 & mask_SORT_5 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=0] [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_46=0, var_47_arg_0=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=0] [L167] EXPR var_47_arg_0 & mask_SORT_5 [L167] EXPR var_47_arg_0 & mask_SORT_5 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_46=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=0] [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_48=0, var_58=1, var_59_arg_0=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=0] [L173] EXPR var_59_arg_0 & mask_SORT_57 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_48=0, var_58=1, var_59_arg_0=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=0] [L173] EXPR var_59_arg_0 & mask_SORT_57 [L173] EXPR var_59_arg_0 & mask_SORT_57 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_18=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_48=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_69=0, var_71=0] [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771, var_73=0] [L190] EXPR var_73 & mask_SORT_14 [L190] EXPR var_73 & mask_SORT_14 VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, next_51_arg_1=1, next_56_arg_1=0, state_29=0, state_31=0, state_36=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_33=1, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] EXPR input_3 & mask_SORT_1 [L94] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] EXPR input_4 & mask_SORT_1 [L96] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] EXPR input_6 & mask_SORT_5 [L98] EXPR input_6 & mask_SORT_5 VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] EXPR input_7 & mask_SORT_5 [L100] EXPR input_7 & mask_SORT_5 VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-2, var_21_arg_1=1, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-2, var_21_arg_1=1, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] EXPR var_21_arg_0 | var_21_arg_1 [L111] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-255, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] EXPR var_26_arg_0 & var_26_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-255, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] EXPR var_26_arg_0 & var_26_arg_1 [L116] EXPR var_26_arg_0 & var_26_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] EXPR var_26 & mask_SORT_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L117] EXPR var_26 & mask_SORT_1 [L117] EXPR var_26 & mask_SORT_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; VAL [bad_27_arg_0=1, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) VAL [\old(cond)=0] [L22] COND TRUE !(cond) VAL [\old(cond)=0] [L22] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1448 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1443 mSDsluCounter, 7530 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5987 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1848 IncrementalHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 1543 mSDtfsCounter, 1848 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1359 GetRequests, 1236 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=520occurred in iteration=0, InterpolantAutomatonStates: 79, 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, 10 MinimizatonAttempts, 224 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2542 NumberOfCodeBlocks, 2542 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2670 ConstructedInterpolants, 0 QuantifiedInterpolants, 13846 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3987 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 1340/1570 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-08-15 18:20:20,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.mul6.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-03fe66f-m [2024-08-15 18:20:23,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:20:23,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-15 18:20:23,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:20:23,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:20:23,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:20:23,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:20:23,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:20:23,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:20:23,190 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:20:23,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:20:23,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:20:23,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:20:23,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:20:23,192 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:20:23,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:20:23,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:20:23,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:20:23,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:20:23,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:20:23,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:20:23,196 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-15 18:20:23,196 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-15 18:20:23,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:20:23,197 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-15 18:20:23,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:20:23,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:20:23,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:20:23,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:20:23,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:20:23,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:20:23,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:20:23,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:20:23,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:20:23,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:20:23,200 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-15 18:20:23,200 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-15 18:20:23,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:20:23,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:20:23,201 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:20:23,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:20:23,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:20:23,202 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-15 18:20:23,202 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-15 18:20:23,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:20:23,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:20:23,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:20:23,589 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:20:23,591 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:20:23,593 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.mul6.yml/witness.yml [2024-08-15 18:20:23,672 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:20:23,672 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:20:23,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-08-15 18:20:25,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:20:25,625 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:20:25,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-08-15 18:20:25,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e7bc116/b44a7d05e0d1493b8108f3bcf1ba3f0d/FLAG7c151b39f [2024-08-15 18:20:25,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e7bc116/b44a7d05e0d1493b8108f3bcf1ba3f0d [2024-08-15 18:20:25,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:20:25,996 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:20:25,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:20:26,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:20:26,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:20:26,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:20:23" (1/2) ... [2024-08-15 18:20:26,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ee95c3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:20:26, skipping insertion in model container [2024-08-15 18:20:26,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:20:23" (1/2) ... [2024-08-15 18:20:26,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c9fa63 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:20:26, skipping insertion in model container [2024-08-15 18:20:26,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:20:25" (2/2) ... [2024-08-15 18:20:26,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ee95c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26, skipping insertion in model container [2024-08-15 18:20:26,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:20:25" (2/2) ... [2024-08-15 18:20:26,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:20:26,233 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.mul6.c[1298,1311] [2024-08-15 18:20:26,337 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:20:26,358 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:20:26,370 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.mul6.c[1298,1311] [2024-08-15 18:20:26,411 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:20:26,443 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:20:26,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26 WrapperNode [2024-08-15 18:20:26,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:20:26,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:20:26,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:20:26,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:20:26,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (1/1) ... [2024-08-15 18:20:26,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (1/1) ... [2024-08-15 18:20:26,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (1/1) ... [2024-08-15 18:20:26,492 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-08-15 18:20:26,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (1/1) ... [2024-08-15 18:20:26,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (1/1) ... [2024-08-15 18:20:26,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (1/1) ... [2024-08-15 18:20:26,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (1/1) ... [2024-08-15 18:20:26,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (1/1) ... [2024-08-15 18:20:26,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:20:26,514 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:20:26,514 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:20:26,514 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:20:26,515 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (1/1) ... [2024-08-15 18:20:26,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:20:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:20:26,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-15 18:20:26,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-15 18:20:26,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:20:26,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:20:26,593 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:20:26,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:20:26,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:20:26,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:20:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:20:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:20:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:20:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:20:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint128 [2024-08-15 18:20:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:20:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-15 18:20:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-08-15 18:20:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-15 18:20:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-08-15 18:20:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:20:26,718 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:20:26,720 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:20:27,467 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-08-15 18:20:27,467 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:20:27,477 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:20:27,477 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:20:27,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:20:27 BoogieIcfgContainer [2024-08-15 18:20:27,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:20:27,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:20:27,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:20:27,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:20:27,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:20:23" (1/4) ... [2024-08-15 18:20:27,485 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:20:27,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5f6295 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:20:27, skipping insertion in model container [2024-08-15 18:20:27,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:20:25" (2/4) ... [2024-08-15 18:20:27,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5f6295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:20:27, skipping insertion in model container [2024-08-15 18:20:27,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:20:26" (3/4) ... [2024-08-15 18:20:27,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5f6295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:20:27, skipping insertion in model container [2024-08-15 18:20:27,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:20:27" (4/4) ... [2024-08-15 18:20:27,492 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul6.c [2024-08-15 18:20:27,512 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:20:27,512 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:20:27,546 INFO L90 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [9] [2024-08-15 18:20:27,598 INFO L95 WitnessUtils]: Product has 91 reachable states. [2024-08-15 18:20:27,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:20:27,619 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;@74da1355, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:20:27,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:20:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-08-15 18:20:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-08-15 18:20:27,626 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:20:27,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:20:27,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:20:27,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:20:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2090759925, now seen corresponding path program 1 times [2024-08-15 18:20:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-15 18:20:27,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909903317] [2024-08-15 18:20:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:20:27,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-15 18:20:27,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-15 18:20:27,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-15 18:20:27,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-15 18:20:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:20:28,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:20:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:20:29,662 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-15 18:20:29,665 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:20:29,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:20:29,708 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-15 18:20:29,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-15 18:20:29,873 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-15 18:20:29,877 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:20:29,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:20:29 BoogieIcfgContainer [2024-08-15 18:20:29,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:20:29,923 INFO L158 Benchmark]: Toolchain (without parser) took 3927.78ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 57.1MB in the end (delta: 2.9MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-08-15 18:20:29,924 INFO L158 Benchmark]: Witness Parser took 0.24ms. Allocated memory is still 56.6MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:20:29,924 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:20:29,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.87ms. Allocated memory is still 86.0MB. Free memory was 59.8MB in the beginning and 64.4MB in the end (delta: -4.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-08-15 18:20:29,925 INFO L158 Benchmark]: Boogie Preprocessor took 68.20ms. Allocated memory is still 86.0MB. Free memory was 64.4MB in the beginning and 61.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-15 18:20:29,926 INFO L158 Benchmark]: IcfgBuilder took 963.52ms. Allocated memory is still 86.0MB. Free memory was 61.2MB in the beginning and 62.5MB in the end (delta: -1.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-08-15 18:20:29,926 INFO L158 Benchmark]: TraceAbstraction took 2441.25ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 57.1MB in the end (delta: 4.9MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-08-15 18:20:29,930 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.24ms. Allocated memory is still 56.6MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.87ms. Allocated memory is still 86.0MB. Free memory was 59.8MB in the beginning and 64.4MB in the end (delta: -4.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.20ms. Allocated memory is still 86.0MB. Free memory was 64.4MB in the beginning and 61.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 963.52ms. Allocated memory is still 86.0MB. Free memory was 61.2MB in the beginning and 62.5MB in the end (delta: -1.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2441.25ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 57.1MB in the end (delta: 4.9MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L36] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 128); [L37] const SORT_14 msb_SORT_14 = (SORT_14)1 << (128 - 1); [L39] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 32); [L40] const SORT_57 msb_SORT_57 = (SORT_57)1 << (32 - 1); [L42] const SORT_1 var_10 = 0; [L43] const SORT_14 var_15 = 0; [L44] const SORT_1 var_24 = 1; [L45] const SORT_5 var_28 = 0; [L46] const SORT_8 var_35 = 0; [L47] const SORT_57 var_58 = 1; [L48] const SORT_57 var_62 = 1000; [L49] const SORT_5 var_64 = 9223372036854775807; [L50] const SORT_5 var_67 = 12245771; [L52] SORT_1 input_2; [L53] SORT_1 input_3; [L54] SORT_1 input_4; [L55] SORT_5 input_6; [L56] SORT_5 input_7; [L57] SORT_8 input_9; [L59] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] SORT_14 state_16 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L61] SORT_14 state_18 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L62] SORT_5 state_29 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L63] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L64] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L65] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] SORT_5 state_42 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L68] SORT_5 state_44 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L70] SORT_1 init_12_arg_1 = var_10; [L71] state_11 = init_12_arg_1 [L72] SORT_14 init_17_arg_1 = var_15; [L73] state_16 = init_17_arg_1 [L74] SORT_14 init_19_arg_1 = var_15; [L75] state_18 = init_19_arg_1 [L76] SORT_5 init_30_arg_1 = var_28; [L77] state_29 = init_30_arg_1 [L78] SORT_5 init_32_arg_1 = var_28; [L79] state_31 = init_32_arg_1 [L80] SORT_8 init_37_arg_1 = var_35; [L81] state_36 = init_37_arg_1 [L82] SORT_1 init_39_arg_1 = var_24; [L83] state_38 = init_39_arg_1 [L84] SORT_1 init_41_arg_1 = var_24; [L85] state_40 = init_41_arg_1 [L86] SORT_5 init_43_arg_1 = var_28; [L87] state_42 = init_43_arg_1 [L88] SORT_5 init_45_arg_1 = var_28; [L89] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=9223372036854775807, input_7=12245771, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=1008, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) VAL [\old(cond)=1] [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) VAL [bad_27_arg_0=0, input_3=0, input_4=0, input_6=9223372036854775807, input_7=12245771, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=0, state_29=0, state_31=0, state_36=1008, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; VAL [bad_27_arg_0=1, input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=1, state_18=1, state_29=0, state_31=0, state_36=1008, state_38=0, state_40=0, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) VAL [\old(cond)=0] [L22] COND TRUE !(cond) VAL [\old(cond)=0] [L22] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-15 18:20:29,993 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