./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2b04c290f1a7102f69086810812946480d0557325a865f39f1fc1d9d1f1627d8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 20:54:02,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:54:02,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:54:02,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:54:02,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:54:02,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:54:02,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:54:02,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:54:02,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:54:02,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:54:02,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:54:02,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:54:02,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:54:02,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:54:02,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:54:02,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:54:02,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:54:02,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:54:02,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:54:02,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:54:02,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:54:02,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:54:02,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:54:02,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:54:02,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:54:02,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:54:02,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:54:02,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:54:02,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:54:02,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:54:02,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:54:02,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:54:02,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:54:02,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:54:02,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:54:02,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:54:02,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:54:02,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:54:02,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:54:02,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:54:02,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:54:02,760 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 20:54:02,780 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:54:02,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:54:02,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:54:02,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:54:02,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:54:02,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:54:02,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:54:02,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:54:02,783 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:54:02,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:54:02,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:54:02,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:54:02,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:54:02,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:54:02,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:54:02,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:54:02,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:54:02,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:54:02,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:54:02,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:54:02,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:54:02,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:54:02,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:54:02,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:54:02,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:54:02,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:54:02,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:54:02,786 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:54:02,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:54:02,786 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:54:02,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:54:02,786 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:54:02,786 INFO L138 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b04c290f1a7102f69086810812946480d0557325a865f39f1fc1d9d1f1627d8 [2022-12-13 20:54:02,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:54:02,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:54:02,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:54:02,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:54:02,994 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:54:02,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2022-12-13 20:54:05,506 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:54:05,700 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:54:05,701 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2022-12-13 20:54:05,707 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/data/7ae552640/d8eaaac24d2d4a8da8fee1a980bef086/FLAG2f0c01476 [2022-12-13 20:54:06,083 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/data/7ae552640/d8eaaac24d2d4a8da8fee1a980bef086 [2022-12-13 20:54:06,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:54:06,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:54:06,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:54:06,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:54:06,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:54:06,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53605d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06, skipping insertion in model container [2022-12-13 20:54:06,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:54:06,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:54:06,211 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1107,1120] [2022-12-13 20:54:06,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:54:06,249 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:54:06,258 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1107,1120] [2022-12-13 20:54:06,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:54:06,280 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:54:06,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06 WrapperNode [2022-12-13 20:54:06,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:54:06,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:54:06,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:54:06,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:54:06,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,307 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2022-12-13 20:54:06,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:54:06,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:54:06,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:54:06,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:54:06,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,323 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:54:06,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:54:06,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:54:06,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:54:06,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (1/1) ... [2022-12-13 20:54:06,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:54:06,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:54:06,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:54:06,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:54:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:54:06,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:54:06,443 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:54:06,444 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:54:06,570 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:54:06,576 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:54:06,576 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 20:54:06,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:54:06 BoogieIcfgContainer [2022-12-13 20:54:06,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:54:06,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:54:06,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:54:06,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:54:06,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:54:06" (1/3) ... [2022-12-13 20:54:06,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aeaea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:54:06, skipping insertion in model container [2022-12-13 20:54:06,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:06" (2/3) ... [2022-12-13 20:54:06,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aeaea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:54:06, skipping insertion in model container [2022-12-13 20:54:06,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:54:06" (3/3) ... [2022-12-13 20:54:06,584 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2022-12-13 20:54:06,598 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:54:06,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:54:06,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:54:06,640 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4fd1c503, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:54:06,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:54:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 20:54:06,649 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:06,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 20:54:06,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-12-13 20:54:06,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:54:06,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118454433] [2022-12-13 20:54:06,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:06,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:54:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:54:06,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:54:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:54:06,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:54:06,808 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:54:06,809 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 20:54:06,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:54:06,814 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-13 20:54:06,817 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:54:06,826 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:54:06,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:54:06 BoogieIcfgContainer [2022-12-13 20:54:06,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:54:06,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:54:06,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:54:06,832 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:54:06,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:54:06" (3/4) ... [2022-12-13 20:54:06,835 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 20:54:06,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:54:06,836 INFO L158 Benchmark]: Toolchain (without parser) took 749.77ms. Allocated memory is still 172.0MB. Free memory was 133.6MB in the beginning and 84.8MB in the end (delta: 48.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2022-12-13 20:54:06,836 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:54:06,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.80ms. Allocated memory is still 172.0MB. Free memory was 133.1MB in the beginning and 121.8MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 20:54:06,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.27ms. Allocated memory is still 172.0MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:54:06,838 INFO L158 Benchmark]: Boogie Preprocessor took 17.08ms. Allocated memory is still 172.0MB. Free memory was 119.7MB in the beginning and 118.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:54:06,838 INFO L158 Benchmark]: RCFGBuilder took 252.15ms. Allocated memory is still 172.0MB. Free memory was 118.4MB in the beginning and 102.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 20:54:06,838 INFO L158 Benchmark]: TraceAbstraction took 252.11ms. Allocated memory is still 172.0MB. Free memory was 101.6MB in the beginning and 85.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 20:54:06,839 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 172.0MB. Free memory was 85.4MB in the beginning and 84.8MB in the end (delta: 580.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:54:06,841 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.80ms. Allocated memory is still 172.0MB. Free memory was 133.1MB in the beginning and 121.8MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.27ms. Allocated memory is still 172.0MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.08ms. Allocated memory is still 172.0MB. Free memory was 119.7MB in the beginning and 118.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 252.15ms. Allocated memory is still 172.0MB. Free memory was 118.4MB in the beginning and 102.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 252.11ms. Allocated memory is still 172.0MB. Free memory was 101.6MB in the beginning and 85.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 172.0MB. Free memory was 85.4MB in the beginning and 84.8MB in the end (delta: 580.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 65, overapproximation of bitwiseAnd at line 68. Possible FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L31] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L32] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L34] const SORT_4 var_5 = 0; [L35] const SORT_1 var_13 = 1; [L36] const SORT_1 var_17 = 0; [L37] const SORT_23 var_25 = 1; [L39] SORT_1 input_2; [L40] SORT_1 input_3; [L42] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L43] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_9_arg_1 = var_5; [L50] state_8 = init_9_arg_1 [L51] SORT_1 init_19_arg_1 = var_17; [L52] state_18 = init_19_arg_1 [L53] SORT_1 init_21_arg_1 = var_17; [L54] state_20 = init_21_arg_1 VAL [init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_17=0, var_25=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 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 could not prove your program: unable to determine feasibility of some traces [2022-12-13 20:54:06,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2b04c290f1a7102f69086810812946480d0557325a865f39f1fc1d9d1f1627d8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 20:54:08,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:54:08,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:54:08,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:54:08,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:54:08,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:54:08,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:54:08,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:54:08,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:54:08,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:54:08,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:54:08,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:54:08,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:54:08,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:54:08,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:54:08,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:54:08,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:54:08,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:54:08,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:54:08,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:54:08,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:54:08,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:54:08,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:54:08,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:54:08,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:54:08,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:54:08,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:54:08,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:54:08,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:54:08,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:54:08,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:54:08,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:54:08,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:54:08,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:54:08,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:54:08,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:54:08,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:54:08,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:54:08,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:54:08,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:54:08,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:54:08,408 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-12-13 20:54:08,430 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:54:08,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:54:08,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:54:08,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:54:08,431 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:54:08,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:54:08,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:54:08,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:54:08,433 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:54:08,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:54:08,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:54:08,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:54:08,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:54:08,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:54:08,434 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 20:54:08,434 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 20:54:08,434 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 20:54:08,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:54:08,435 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:54:08,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:54:08,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:54:08,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:54:08,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:54:08,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:54:08,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:54:08,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:54:08,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:54:08,436 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 20:54:08,436 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 20:54:08,437 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:54:08,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:54:08,437 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:54:08,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:54:08,437 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 20:54:08,438 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:54:08,438 INFO L138 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b04c290f1a7102f69086810812946480d0557325a865f39f1fc1d9d1f1627d8 [2022-12-13 20:54:08,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:54:08,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:54:08,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:54:08,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:54:08,704 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:54:08,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2022-12-13 20:54:11,278 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:54:11,431 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:54:11,431 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2022-12-13 20:54:11,436 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/data/2a18938fb/86c66a788381428a89534cb196df57a8/FLAGdf262870d [2022-12-13 20:54:11,836 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/data/2a18938fb/86c66a788381428a89534cb196df57a8 [2022-12-13 20:54:11,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:54:11,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:54:11,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:54:11,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:54:11,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:54:11,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:54:11" (1/1) ... [2022-12-13 20:54:11,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f180397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:11, skipping insertion in model container [2022-12-13 20:54:11,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:54:11" (1/1) ... [2022-12-13 20:54:11,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:54:11,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:54:11,957 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1107,1120] [2022-12-13 20:54:11,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:54:11,991 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:54:11,999 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1107,1120] [2022-12-13 20:54:12,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:54:12,022 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:54:12,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12 WrapperNode [2022-12-13 20:54:12,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:54:12,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:54:12,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:54:12,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:54:12,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,049 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2022-12-13 20:54:12,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:54:12,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:54:12,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:54:12,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:54:12,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,066 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:54:12,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:54:12,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:54:12,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:54:12,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (1/1) ... [2022-12-13 20:54:12,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:54:12,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:54:12,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:54:12,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:54:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:54:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:54:12,204 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:54:12,207 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:54:12,340 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:54:12,347 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:54:12,347 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 20:54:12,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:54:12 BoogieIcfgContainer [2022-12-13 20:54:12,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:54:12,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:54:12,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:54:12,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:54:12,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:54:11" (1/3) ... [2022-12-13 20:54:12,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d39d9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:54:12, skipping insertion in model container [2022-12-13 20:54:12,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:12" (2/3) ... [2022-12-13 20:54:12,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d39d9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:54:12, skipping insertion in model container [2022-12-13 20:54:12,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:54:12" (3/3) ... [2022-12-13 20:54:12,365 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2022-12-13 20:54:12,385 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:54:12,386 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:54:12,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:54:12,441 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4805ea74, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:54:12,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:54:12,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 20:54:12,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:12,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 20:54:12,452 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-12-13 20:54:12,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:54:12,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606611658] [2022-12-13 20:54:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:12,472 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 [2022-12-13 20:54:12,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:54:12,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 20:54:12,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 20:54:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:12,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 20:54:12,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:12,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:54:12,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:54:12,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606611658] [2022-12-13 20:54:12,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606611658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:54:12,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:54:12,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:54:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953912292] [2022-12-13 20:54:12,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:54:12,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:54:12,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:54:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:54:12,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:54:12,723 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:54:12,762 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2022-12-13 20:54:12,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:54:12,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 20:54:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:54:12,770 INFO L225 Difference]: With dead ends: 20 [2022-12-13 20:54:12,770 INFO L226 Difference]: Without dead ends: 11 [2022-12-13 20:54:12,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:54:12,774 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:54:12,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:54:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-12-13 20:54:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2022-12-13 20:54:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-12-13 20:54:12,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-12-13 20:54:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:54:12,807 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-12-13 20:54:12,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-12-13 20:54:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 20:54:12,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:12,807 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-13 20:54:12,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:54:13,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 20:54:13,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:13,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2022-12-13 20:54:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:54:13,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202319848] [2022-12-13 20:54:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:13,011 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 [2022-12-13 20:54:13,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:54:13,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 20:54:13,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (3)] Waiting until timeout for monitored process [2022-12-13 20:54:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:13,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 20:54:13,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:13,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:54:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:13,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:54:13,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202319848] [2022-12-13 20:54:13,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202319848] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:54:13,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:54:13,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-12-13 20:54:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067031465] [2022-12-13 20:54:13,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:54:13,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:54:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:54:13,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:54:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:54:13,804 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:54:13,863 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-12-13 20:54:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:54:13,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-13 20:54:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:54:13,864 INFO L225 Difference]: With dead ends: 16 [2022-12-13 20:54:13,864 INFO L226 Difference]: Without dead ends: 14 [2022-12-13 20:54:13,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:54:13,866 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:54:13,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:54:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-13 20:54:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-12-13 20:54:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-12-13 20:54:13,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2022-12-13 20:54:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:54:13,871 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-12-13 20:54:13,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-12-13 20:54:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 20:54:13,872 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:13,872 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-12-13 20:54:13,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (3)] Ended with exit code 0 [2022-12-13 20:54:14,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 20:54:14,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:14,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1020920393, now seen corresponding path program 2 times [2022-12-13 20:54:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:54:14,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36059231] [2022-12-13 20:54:14,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:54:14,081 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 [2022-12-13 20:54:14,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:54:14,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 20:54:14,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (4)] Waiting until timeout for monitored process [2022-12-13 20:54:14,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:54:14,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:54:14,268 WARN L261 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-13 20:54:14,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:14,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:54:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:15,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:54:15,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36059231] [2022-12-13 20:54:15,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36059231] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:54:15,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:54:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-12-13 20:54:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573577647] [2022-12-13 20:54:15,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:54:15,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 20:54:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:54:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 20:54:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:54:15,515 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:54:15,963 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-12-13 20:54:15,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 20:54:15,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 20:54:15,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:54:15,964 INFO L225 Difference]: With dead ends: 27 [2022-12-13 20:54:15,964 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 20:54:15,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 20:54:15,965 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:54:15,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:54:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 20:54:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-12-13 20:54:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-12-13 20:54:15,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 11 [2022-12-13 20:54:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:54:15,972 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-12-13 20:54:15,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-12-13 20:54:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 20:54:15,973 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:15,973 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2022-12-13 20:54:15,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (4)] Ended with exit code 0 [2022-12-13 20:54:16,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 20:54:16,175 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 3 times [2022-12-13 20:54:16,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:54:16,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725475911] [2022-12-13 20:54:16,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:54:16,180 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 [2022-12-13 20:54:16,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:54:16,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 20:54:16,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (5)] Waiting until timeout for monitored process [2022-12-13 20:54:16,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 20:54:16,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:54:16,358 WARN L261 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-13 20:54:16,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:16,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:54:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:18,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:54:18,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725475911] [2022-12-13 20:54:18,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725475911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:54:18,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:54:18,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-12-13 20:54:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752222618] [2022-12-13 20:54:18,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:54:18,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 20:54:18,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:54:18,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 20:54:18,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 20:54:18,310 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:54:18,933 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-12-13 20:54:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 20:54:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 20:54:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:54:18,934 INFO L225 Difference]: With dead ends: 28 [2022-12-13 20:54:18,934 INFO L226 Difference]: Without dead ends: 26 [2022-12-13 20:54:18,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-12-13 20:54:18,935 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:54:18,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:54:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-13 20:54:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-12-13 20:54:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-12-13 20:54:18,939 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2022-12-13 20:54:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:54:18,940 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-12-13 20:54:18,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-12-13 20:54:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 20:54:18,940 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:18,940 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2022-12-13 20:54:18,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (5)] Ended with exit code 0 [2022-12-13 20:54:19,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 20:54:19,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash 142558665, now seen corresponding path program 4 times [2022-12-13 20:54:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:54:19,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912961687] [2022-12-13 20:54:19,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:54:19,146 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 [2022-12-13 20:54:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:54:19,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 20:54:19,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (6)] Waiting until timeout for monitored process [2022-12-13 20:54:19,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:54:19,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:54:19,285 WARN L261 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 174 conjunts are in the unsatisfiable core [2022-12-13 20:54:19,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:19,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:54:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:24,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:54:24,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912961687] [2022-12-13 20:54:24,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912961687] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:54:24,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:54:24,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-12-13 20:54:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373192244] [2022-12-13 20:54:24,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:54:24,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 20:54:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:54:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 20:54:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-12-13 20:54:24,710 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:54:30,213 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-12-13 20:54:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 20:54:30,214 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 20:54:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:54:30,214 INFO L225 Difference]: With dead ends: 55 [2022-12-13 20:54:30,214 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 20:54:30,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2022-12-13 20:54:30,215 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 64 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:54:30,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 43 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 20:54:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 20:54:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-12-13 20:54:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-12-13 20:54:30,224 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 23 [2022-12-13 20:54:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:54:30,224 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-12-13 20:54:30,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-12-13 20:54:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:54:30,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:30,225 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2022-12-13 20:54:30,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (6)] Forceful destruction successful, exit code 0 [2022-12-13 20:54:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 20:54:30,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:30,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash -752690141, now seen corresponding path program 5 times [2022-12-13 20:54:30,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:54:30,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041188583] [2022-12-13 20:54:30,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 20:54:30,430 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 [2022-12-13 20:54:30,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:54:30,431 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 20:54:30,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (7)] Waiting until timeout for monitored process [2022-12-13 20:54:30,576 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-12-13 20:54:30,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:54:30,585 WARN L261 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 200 conjunts are in the unsatisfiable core [2022-12-13 20:54:30,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:31,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:54:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:37,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:54:37,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041188583] [2022-12-13 20:54:37,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041188583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:54:37,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:54:37,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-12-13 20:54:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285583943] [2022-12-13 20:54:37,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:54:37,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 20:54:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:54:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 20:54:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-13 20:54:37,236 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:54:43,459 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-12-13 20:54:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 20:54:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 20:54:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:54:43,460 INFO L225 Difference]: With dead ends: 52 [2022-12-13 20:54:43,461 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 20:54:43,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2022-12-13 20:54:43,462 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:54:43,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 41 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 20:54:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 20:54:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-12-13 20:54:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-12-13 20:54:43,478 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 26 [2022-12-13 20:54:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:54:43,478 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-12-13 20:54:43,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:54:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-12-13 20:54:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 20:54:43,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:43,479 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2022-12-13 20:54:43,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (7)] Ended with exit code 0 [2022-12-13 20:54:43,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 20:54:43,680 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:43,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash 969805001, now seen corresponding path program 6 times [2022-12-13 20:54:43,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:54:43,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165661068] [2022-12-13 20:54:43,682 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 20:54:43,683 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 [2022-12-13 20:54:43,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:54:43,684 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 20:54:43,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (8)] Waiting until timeout for monitored process [2022-12-13 20:54:43,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-12-13 20:54:43,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:54:44,008 WARN L261 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 382 conjunts are in the unsatisfiable core [2022-12-13 20:54:44,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:46,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:55:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:55:16,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 20:55:16,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165661068] [2022-12-13 20:55:16,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165661068] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:55:16,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:55:16,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-12-13 20:55:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063200189] [2022-12-13 20:55:16,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:55:16,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 20:55:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 20:55:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 20:55:16,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 20:55:16,116 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:57:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:57:03,618 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2022-12-13 20:57:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-13 20:57:03,618 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-12-13 20:57:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:57:03,620 INFO L225 Difference]: With dead ends: 111 [2022-12-13 20:57:03,620 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 20:57:03,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 131.0s TimeCoverageRelationStatistics Valid=1128, Invalid=5678, Unknown=0, NotChecked=0, Total=6806 [2022-12-13 20:57:03,623 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 124 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:57:03,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 82 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-12-13 20:57:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 20:57:03,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2022-12-13 20:57:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.0869565217391304) internal successors, (100), 92 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:57:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-12-13 20:57:03,655 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 47 [2022-12-13 20:57:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:57:03,655 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-12-13 20:57:03,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:57:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-12-13 20:57:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 20:57:03,656 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:57:03,656 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2022-12-13 20:57:03,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (8)] Ended with exit code 0 [2022-12-13 20:57:03,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 20:57:03,858 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:57:03,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:57:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash -779438813, now seen corresponding path program 7 times [2022-12-13 20:57:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 20:57:03,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108260953] [2022-12-13 20:57:03,861 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 20:57:03,862 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 [2022-12-13 20:57:03,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 20:57:03,865 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 20:57:03,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (9)] Waiting until timeout for monitored process [2022-12-13 20:57:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:57:04,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:57:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:57:04,380 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 20:57:04,380 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:57:04,381 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 20:57:04,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 (9)] Forceful destruction successful, exit code 0 [2022-12-13 20:57:04,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 20:57:04,592 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1] [2022-12-13 20:57:04,602 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,662 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,663 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,663 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,663 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:57:04 BoogieIcfgContainer [2022-12-13 20:57:04,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:57:04,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:57:04,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:57:04,684 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:57:04,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:54:12" (3/4) ... [2022-12-13 20:57:04,685 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,700 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,701 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,701 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,701 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 20:57:04,765 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:57:04,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:57:04,765 INFO L158 Benchmark]: Toolchain (without parser) took 172926.33ms. Allocated memory was 58.7MB in the beginning and 232.8MB in the end (delta: 174.1MB). Free memory was 25.4MB in the beginning and 117.1MB in the end (delta: -91.6MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2022-12-13 20:57:04,765 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 37.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:57:04,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.90ms. Allocated memory was 58.7MB in the beginning and 90.2MB in the end (delta: 31.5MB). Free memory was 25.2MB in the beginning and 62.8MB in the end (delta: -37.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-12-13 20:57:04,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.64ms. Allocated memory is still 90.2MB. Free memory was 62.8MB in the beginning and 60.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:57:04,766 INFO L158 Benchmark]: Boogie Preprocessor took 18.14ms. Allocated memory is still 90.2MB. Free memory was 60.9MB in the beginning and 59.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:57:04,766 INFO L158 Benchmark]: RCFGBuilder took 280.50ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 47.2MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 20:57:04,766 INFO L158 Benchmark]: TraceAbstraction took 172324.84ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 69.3MB in the beginning and 137.0MB in the end (delta: -67.7MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2022-12-13 20:57:04,766 INFO L158 Benchmark]: Witness Printer took 81.36ms. Allocated memory is still 232.8MB. Free memory was 137.0MB in the beginning and 117.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 20:57:04,767 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 37.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.90ms. Allocated memory was 58.7MB in the beginning and 90.2MB in the end (delta: 31.5MB). Free memory was 25.2MB in the beginning and 62.8MB in the end (delta: -37.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.64ms. Allocated memory is still 90.2MB. Free memory was 62.8MB in the beginning and 60.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.14ms. Allocated memory is still 90.2MB. Free memory was 60.9MB in the beginning and 59.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.50ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 47.2MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 172324.84ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 69.3MB in the beginning and 137.0MB in the end (delta: -67.7MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Witness Printer took 81.36ms. Allocated memory is still 232.8MB. Free memory was 137.0MB in the beginning and 117.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L31] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L32] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L34] const SORT_4 var_5 = 0; [L35] const SORT_1 var_13 = 1; [L36] const SORT_1 var_17 = 0; [L37] const SORT_23 var_25 = 1; [L39] SORT_1 input_2; [L40] SORT_1 input_3; [L42] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L43] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_9_arg_1 = var_5; [L50] state_8 = init_9_arg_1 [L51] SORT_1 init_19_arg_1 = var_17; [L52] state_18 = init_19_arg_1 [L53] SORT_1 init_21_arg_1 = var_17; [L54] state_20 = init_21_arg_1 VAL [init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_17=0, var_25=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=9, input_3=10, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=0, next_35_arg_1=1, next_37_arg_1=1, next_38_arg_1=0, state_18=1, state_20=0, state_6=0, state_8=1, var_10=1, var_10_arg_0=0, var_10_arg_1=0, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=0, var_24_arg_0=0, var_25=1, var_26=1, var_26_arg_0=0, var_26_arg_1=1, var_27=1, var_27_arg_0=1, var_28=1, var_28_arg_0=0, var_28_arg_1=0, var_29=0, var_29_arg_0=1, var_29_arg_1=0, var_29_arg_2=1, var_31=0, var_31_arg_0=0, var_32=1, var_32_arg_0=0, var_32_arg_1=1, var_33=1, var_33_arg_0=1, var_34=1, var_34_arg_0=1, var_34_arg_1=1, var_34_arg_2=0, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=11, input_3=12, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=1, next_35_arg_1=1, next_37_arg_1=1, next_38_arg_1=1, state_18=1, state_20=1, state_6=1, state_8=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=0, var_24_arg_0=0, var_25=1, var_26=1, var_26_arg_0=0, var_26_arg_1=1, var_27=1, var_27_arg_0=1, var_28=0, var_28_arg_0=1, var_28_arg_1=0, var_29=1, var_29_arg_0=0, var_29_arg_1=0, var_29_arg_2=1, var_31=1, var_31_arg_0=1, var_32=2, var_32_arg_0=1, var_32_arg_1=1, var_33=2, var_33_arg_0=2, var_34=1, var_34_arg_0=0, var_34_arg_1=2, var_34_arg_2=1, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=13, input_3=14, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=1, next_35_arg_1=2, next_37_arg_1=0, next_38_arg_1=1, state_18=0, state_20=1, state_6=1, state_8=2, var_10=1, var_10_arg_0=1, var_10_arg_1=1, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=1, var_24_arg_0=1, var_25=1, var_26=2, var_26_arg_0=1, var_26_arg_1=1, var_27=2, var_27_arg_0=2, var_28=1, var_28_arg_0=1, var_28_arg_1=1, var_29=1, var_29_arg_0=1, var_29_arg_1=1, var_29_arg_2=2, var_31=1, var_31_arg_0=1, var_32=2, var_32_arg_0=1, var_32_arg_1=1, var_33=2, var_33_arg_0=2, var_34=2, var_34_arg_0=1, var_34_arg_1=2, var_34_arg_2=1, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=15, input_3=16, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=2, next_35_arg_1=2, next_37_arg_1=0, next_38_arg_1=0, state_18=0, state_20=0, state_6=2, state_8=2, var_10=1, var_10_arg_0=1, var_10_arg_1=2, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=1, var_24_arg_0=1, var_25=1, var_26=2, var_26_arg_0=1, var_26_arg_1=1, var_27=2, var_27_arg_0=2, var_28=0, var_28_arg_0=0, var_28_arg_1=1, var_29=2, var_29_arg_0=0, var_29_arg_1=1, var_29_arg_2=2, var_31=2, var_31_arg_0=2, var_32=3, var_32_arg_0=2, var_32_arg_1=1, var_33=3, var_33_arg_0=3, var_34=2, var_34_arg_0=0, var_34_arg_1=3, var_34_arg_2=2, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=17, input_3=18, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=2, next_35_arg_1=3, next_37_arg_1=1, next_38_arg_1=0, state_18=1, state_20=0, state_6=2, state_8=3, var_10=1, var_10_arg_0=2, var_10_arg_1=2, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=2, var_24_arg_0=2, var_25=1, var_26=3, var_26_arg_0=2, var_26_arg_1=1, var_27=3, var_27_arg_0=3, var_28=1, var_28_arg_0=0, var_28_arg_1=0, var_29=2, var_29_arg_0=1, var_29_arg_1=2, var_29_arg_2=3, var_31=2, var_31_arg_0=2, var_32=3, var_32_arg_0=2, var_32_arg_1=1, var_33=3, var_33_arg_0=3, var_34=3, var_34_arg_0=1, var_34_arg_1=3, var_34_arg_2=2, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=19, input_3=20, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=3, next_35_arg_1=3, next_37_arg_1=1, next_38_arg_1=1, state_18=1, state_20=1, state_6=3, state_8=3, var_10=1, var_10_arg_0=2, var_10_arg_1=3, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=2, var_24_arg_0=2, var_25=1, var_26=3, var_26_arg_0=2, var_26_arg_1=1, var_27=3, var_27_arg_0=3, var_28=0, var_28_arg_0=1, var_28_arg_1=0, var_29=3, var_29_arg_0=0, var_29_arg_1=2, var_29_arg_2=3, var_31=3, var_31_arg_0=3, var_32=4, var_32_arg_0=3, var_32_arg_1=1, var_33=4, var_33_arg_0=4, var_34=3, var_34_arg_0=0, var_34_arg_1=4, var_34_arg_2=3, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=21, input_3=22, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=3, next_35_arg_1=4, next_37_arg_1=0, next_38_arg_1=1, state_18=0, state_20=1, state_6=3, state_8=4, var_10=1, var_10_arg_0=3, var_10_arg_1=3, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=3, var_24_arg_0=3, var_25=1, var_26=4, var_26_arg_0=3, var_26_arg_1=1, var_27=4, var_27_arg_0=4, var_28=1, var_28_arg_0=1, var_28_arg_1=1, var_29=3, var_29_arg_0=1, var_29_arg_1=3, var_29_arg_2=4, var_31=3, var_31_arg_0=3, var_32=4, var_32_arg_0=3, var_32_arg_1=1, var_33=4, var_33_arg_0=4, var_34=4, var_34_arg_0=1, var_34_arg_1=4, var_34_arg_2=3, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=23, input_3=24, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=4, next_35_arg_1=4, next_37_arg_1=0, next_38_arg_1=0, state_18=0, state_20=0, state_6=4, state_8=4, var_10=1, var_10_arg_0=3, var_10_arg_1=4, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=3, var_24_arg_0=3, var_25=1, var_26=4, var_26_arg_0=3, var_26_arg_1=1, var_27=4, var_27_arg_0=4, var_28=0, var_28_arg_0=0, var_28_arg_1=1, var_29=4, var_29_arg_0=0, var_29_arg_1=3, var_29_arg_2=4, var_31=4, var_31_arg_0=4, var_32=5, var_32_arg_0=4, var_32_arg_1=1, var_33=5, var_33_arg_0=5, var_34=4, var_34_arg_0=0, var_34_arg_1=5, var_34_arg_2=4, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=25, input_3=26, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=4, next_35_arg_1=5, next_37_arg_1=1, next_38_arg_1=0, state_18=1, state_20=0, state_6=4, state_8=5, var_10=1, var_10_arg_0=4, var_10_arg_1=4, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=4, var_24_arg_0=4, var_25=1, var_26=5, var_26_arg_0=4, var_26_arg_1=1, var_27=5, var_27_arg_0=5, var_28=1, var_28_arg_0=0, var_28_arg_1=0, var_29=4, var_29_arg_0=1, var_29_arg_1=4, var_29_arg_2=5, var_31=4, var_31_arg_0=4, var_32=5, var_32_arg_0=4, var_32_arg_1=1, var_33=5, var_33_arg_0=5, var_34=5, var_34_arg_0=1, var_34_arg_1=5, var_34_arg_2=4, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=27, input_3=28, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=5, next_35_arg_1=5, next_37_arg_1=1, next_38_arg_1=1, state_18=1, state_20=1, state_6=5, state_8=5, var_10=1, var_10_arg_0=4, var_10_arg_1=5, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=4, var_24_arg_0=4, var_25=1, var_26=5, var_26_arg_0=4, var_26_arg_1=1, var_27=5, var_27_arg_0=5, var_28=0, var_28_arg_0=1, var_28_arg_1=0, var_29=5, var_29_arg_0=0, var_29_arg_1=4, var_29_arg_2=5, var_31=5, var_31_arg_0=5, var_32=6, var_32_arg_0=5, var_32_arg_1=1, var_33=6, var_33_arg_0=6, var_34=5, var_34_arg_0=0, var_34_arg_1=6, var_34_arg_2=5, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=29, input_3=30, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=5, next_35_arg_1=6, next_37_arg_1=0, next_38_arg_1=1, state_18=0, state_20=1, state_6=5, state_8=6, var_10=1, var_10_arg_0=5, var_10_arg_1=5, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=5, var_24_arg_0=5, var_25=1, var_26=6, var_26_arg_0=5, var_26_arg_1=1, var_27=6, var_27_arg_0=6, var_28=1, var_28_arg_0=1, var_28_arg_1=1, var_29=5, var_29_arg_0=1, var_29_arg_1=5, var_29_arg_2=6, var_31=5, var_31_arg_0=5, var_32=6, var_32_arg_0=5, var_32_arg_1=1, var_33=6, var_33_arg_0=6, var_34=6, var_34_arg_0=1, var_34_arg_1=6, var_34_arg_2=5, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=31, input_3=32, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=6, next_35_arg_1=6, next_37_arg_1=0, next_38_arg_1=0, state_18=0, state_20=0, state_6=6, state_8=6, var_10=1, var_10_arg_0=5, var_10_arg_1=6, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=5, var_24_arg_0=5, var_25=1, var_26=6, var_26_arg_0=5, var_26_arg_1=1, var_27=6, var_27_arg_0=6, var_28=0, var_28_arg_0=0, var_28_arg_1=1, var_29=6, var_29_arg_0=0, var_29_arg_1=5, var_29_arg_2=6, var_31=6, var_31_arg_0=6, var_32=7, var_32_arg_0=6, var_32_arg_1=1, var_33=7, var_33_arg_0=7, var_34=6, var_34_arg_0=0, var_34_arg_1=7, var_34_arg_2=6, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=33, input_3=34, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=6, next_35_arg_1=7, next_37_arg_1=1, next_38_arg_1=0, state_18=1, state_20=0, state_6=6, state_8=7, var_10=1, var_10_arg_0=6, var_10_arg_1=6, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=6, var_24_arg_0=6, var_25=1, var_26=7, var_26_arg_0=6, var_26_arg_1=1, var_27=7, var_27_arg_0=7, var_28=1, var_28_arg_0=0, var_28_arg_1=0, var_29=6, var_29_arg_0=1, var_29_arg_1=6, var_29_arg_2=7, var_31=6, var_31_arg_0=6, var_32=7, var_32_arg_0=6, var_32_arg_1=1, var_33=7, var_33_arg_0=7, var_34=7, var_34_arg_0=1, var_34_arg_1=7, var_34_arg_2=6, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=35, input_3=36, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=7, next_35_arg_1=7, next_37_arg_1=1, next_38_arg_1=1, state_18=1, state_20=1, state_6=7, state_8=7, var_10=1, var_10_arg_0=6, var_10_arg_1=7, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=6, var_24_arg_0=6, var_25=1, var_26=7, var_26_arg_0=6, var_26_arg_1=1, var_27=7, var_27_arg_0=7, var_28=0, var_28_arg_0=1, var_28_arg_1=0, var_29=7, var_29_arg_0=0, var_29_arg_1=6, var_29_arg_2=7, var_31=7, var_31_arg_0=7, var_32=8, var_32_arg_0=7, var_32_arg_1=1, var_33=8, var_33_arg_0=8, var_34=7, var_34_arg_0=0, var_34_arg_1=8, var_34_arg_2=7, var_36=1, var_36_arg_0=0, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_16_arg_0)) [L73] SORT_1 var_28_arg_0 = state_18; [L74] SORT_1 var_28_arg_1 = state_20; [L75] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L76] SORT_4 var_24_arg_0 = state_6; [L77] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L78] SORT_23 var_24 = var_24_arg_0; [L79] SORT_23 var_26_arg_0 = var_24; [L80] SORT_23 var_26_arg_1 = var_25; [L81] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L82] SORT_23 var_27_arg_0 = var_26; [L83] SORT_4 var_27 = var_27_arg_0 >> 0; [L84] SORT_1 var_29_arg_0 = var_28; [L85] SORT_4 var_29_arg_1 = state_6; [L86] SORT_4 var_29_arg_2 = var_27; [L87] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L88] var_29 = var_29 & mask_SORT_4 [L89] SORT_4 next_30_arg_1 = var_29; [L90] SORT_4 var_31_arg_0 = state_8; [L91] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L92] SORT_23 var_31 = var_31_arg_0; [L93] SORT_23 var_32_arg_0 = var_31; [L94] SORT_23 var_32_arg_1 = var_25; [L95] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L96] SORT_23 var_33_arg_0 = var_32; [L97] SORT_4 var_33 = var_33_arg_0 >> 0; [L98] SORT_1 var_34_arg_0 = var_28; [L99] SORT_4 var_34_arg_1 = var_33; [L100] SORT_4 var_34_arg_2 = state_8; [L101] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L102] var_34 = var_34 & mask_SORT_4 [L103] SORT_4 next_35_arg_1 = var_34; [L104] SORT_1 var_36_arg_0 = state_20; [L105] SORT_1 var_36 = ~var_36_arg_0; [L106] var_36 = var_36 & mask_SORT_1 [L107] SORT_1 next_37_arg_1 = var_36; [L108] SORT_1 next_38_arg_1 = state_18; [L110] state_6 = next_30_arg_1 [L111] state_8 = next_35_arg_1 [L112] state_18 = next_37_arg_1 [L113] state_20 = next_38_arg_1 VAL [bad_16_arg_0=0, init_19_arg_1=0, init_21_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_2=37, input_3=38, mask_SORT_1=1, mask_SORT_23=4294967295, mask_SORT_4=7, msb_SORT_1=1, msb_SORT_23=2147483648, msb_SORT_4=4, next_30_arg_1=7, next_35_arg_1=0, next_37_arg_1=0, next_38_arg_1=1, state_18=0, state_20=1, state_6=7, state_8=0, var_10=1, var_10_arg_0=7, var_10_arg_1=7, var_13=1, var_14=254, var_14_arg_0=1, var_15=0, var_15_arg_0=1, var_15_arg_1=254, var_17=0, var_24=7, var_24_arg_0=7, var_25=1, var_26=8, var_26_arg_0=7, var_26_arg_1=1, var_27=8, var_27_arg_0=8, var_28=1, var_28_arg_0=1, var_28_arg_1=1, var_29=7, var_29_arg_0=1, var_29_arg_1=7, var_29_arg_2=8, var_31=7, var_31_arg_0=7, var_32=8, var_32_arg_0=7, var_32_arg_1=1, var_33=8, var_33_arg_0=8, var_34=0, var_34_arg_0=1, var_34_arg_1=8, var_34_arg_2=7, var_36=0, var_36_arg_0=1, var_5=0] [L57] input_2 = __VERIFIER_nondet_uchar() [L58] input_3 = __VERIFIER_nondet_uchar() [L61] SORT_4 var_10_arg_0 = state_6; [L62] SORT_4 var_10_arg_1 = state_8; [L63] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L64] SORT_1 var_14_arg_0 = var_10; [L65] SORT_1 var_14 = ~var_14_arg_0; [L66] SORT_1 var_15_arg_0 = var_13; [L67] SORT_1 var_15_arg_1 = var_14; [L68] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 bad_16_arg_0 = var_15; [L71] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 172.2s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 120.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 279 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1370 IncrementalHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 29 mSDtfsCounter, 1370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 152.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 36 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 48.2s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 250 ConstructedInterpolants, 105 QuantifiedInterpolants, 39232 SizeOfPredicates, 893 NumberOfNonLiveVariables, 1869 ConjunctsInSsa, 964 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 0/918 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! [2022-12-13 20:57:04,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af7e61da-4c8e-4723-94cd-f71900247d4f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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