./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4 --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 --- 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-14 20:16:18,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 20:16:18,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 20:16:18,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 20:16:18,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 20:16:18,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 20:16:18,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 20:16:18,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 20:16:18,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 20:16:18,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 20:16:18,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 20:16:18,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 20:16:18,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 20:16:18,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 20:16:18,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 20:16:18,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 20:16:18,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 20:16:18,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 20:16:18,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 20:16:18,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 20:16:18,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 20:16:18,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 20:16:18,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 20:16:18,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 20:16:18,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 20:16:18,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 20:16:18,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 20:16:18,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 20:16:18,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 20:16:18,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 20:16:18,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 20:16:18,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 20:16:18,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 20:16:18,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 20:16:18,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 20:16:18,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 20:16:18,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 20:16:18,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 20:16:18,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 20:16:18,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 20:16:18,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 20:16:18,323 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 20:16:18,335 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 20:16:18,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 20:16:18,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 20:16:18,336 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 20:16:18,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 20:16:18,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 20:16:18,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 20:16:18,343 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 20:16:18,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 20:16:18,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 20:16:18,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 20:16:18,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 20:16:18,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 20:16:18,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 20:16:18,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 20:16:18,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 20:16:18,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 20:16:18,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 20:16:18,345 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 20:16:18,345 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 20:16:18,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 20:16:18,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 20:16:18,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 20:16:18,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 20:16:18,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 20:16:18,346 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 20:16:18,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 20:16:18,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 20:16:18,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/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_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4 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 -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 [2022-12-14 20:16:18,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 20:16:18,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 20:16:18,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 20:16:18,542 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 20:16:18,542 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 20:16:18,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2022-12-14 20:16:21,092 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 20:16:21,318 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 20:16:21,318 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2022-12-14 20:16:21,328 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/data/a94a214b6/d044e02e76244ff682ae05d874e9cbb5/FLAG39879b528 [2022-12-14 20:16:21,342 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/data/a94a214b6/d044e02e76244ff682ae05d874e9cbb5 [2022-12-14 20:16:21,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 20:16:21,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 20:16:21,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 20:16:21,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 20:16:21,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 20:16:21,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24349873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21, skipping insertion in model container [2022-12-14 20:16:21,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 20:16:21,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 20:16:21,637 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_bc088365-89db-4cae-8b09-d0e292b676cb/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2022-12-14 20:16:21,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 20:16:21,679 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 20:16:21,749 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_bc088365-89db-4cae-8b09-d0e292b676cb/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2022-12-14 20:16:21,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 20:16:21,782 INFO L208 MainTranslator]: Completed translation [2022-12-14 20:16:21,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21 WrapperNode [2022-12-14 20:16:21,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 20:16:21,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 20:16:21,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 20:16:21,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 20:16:21,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,845 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 20:16:21,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 20:16:21,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 20:16:21,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 20:16:21,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 20:16:21,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,889 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 20:16:21,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 20:16:21,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 20:16:21,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 20:16:21,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:16:21" (1/1) ... [2022-12-14 20:16:21,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 20:16:21,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 20:16:21,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 20:16:21,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 20:16:21,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 20:16:21,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 20:16:21,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 20:16:21,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 20:16:22,048 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 20:16:22,051 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 20:16:22,749 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 20:16:22,927 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 20:16:22,927 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 20:16:22,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:16:22 BoogieIcfgContainer [2022-12-14 20:16:22,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 20:16:22,931 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 20:16:22,931 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 20:16:22,941 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 20:16:22,941 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:16:22" (1/1) ... [2022-12-14 20:16:22,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 20:16:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 20:16:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 20:16:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 20:16:23,006 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:23,236 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-14 20:16:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2022-12-14 20:16:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2022-12-14 20:16:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 20:16:23,594 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2022-12-14 20:16:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2022-12-14 20:16:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 20:16:24,179 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:24,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:16:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2022-12-14 20:16:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2022-12-14 20:16:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 20:16:24,353 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:24,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 236 states and 328 transitions. [2022-12-14 20:16:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2022-12-14 20:16:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 20:16:24,546 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:16:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 237 states and 330 transitions. [2022-12-14 20:16:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2022-12-14 20:16:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 20:16:24,772 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:16:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 262 states and 361 transitions. [2022-12-14 20:16:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 361 transitions. [2022-12-14 20:16:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 20:16:25,125 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 288 states and 392 transitions. [2022-12-14 20:16:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 392 transitions. [2022-12-14 20:16:25,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 20:16:25,495 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:16:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 309 states and 416 transitions. [2022-12-14 20:16:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 416 transitions. [2022-12-14 20:16:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 20:16:25,806 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:25,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 334 states and 443 transitions. [2022-12-14 20:16:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 443 transitions. [2022-12-14 20:16:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 20:16:26,199 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:16:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 335 states and 445 transitions. [2022-12-14 20:16:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 445 transitions. [2022-12-14 20:16:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 20:16:26,372 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:16:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 338 states and 449 transitions. [2022-12-14 20:16:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2022-12-14 20:16:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-14 20:16:26,474 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:26,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 20:16:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 347 states and 463 transitions. [2022-12-14 20:16:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 463 transitions. [2022-12-14 20:16:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-14 20:16:26,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 353 states and 469 transitions. [2022-12-14 20:16:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2022-12-14 20:16:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 20:16:26,944 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:16:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 374 states and 492 transitions. [2022-12-14 20:16:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 492 transitions. [2022-12-14 20:16:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 20:16:27,338 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 392 states and 512 transitions. [2022-12-14 20:16:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 512 transitions. [2022-12-14 20:16:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 20:16:27,531 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 406 states and 528 transitions. [2022-12-14 20:16:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 528 transitions. [2022-12-14 20:16:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 20:16:27,656 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:27,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 412 states and 535 transitions. [2022-12-14 20:16:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 535 transitions. [2022-12-14 20:16:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 20:16:27,752 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 450 states and 577 transitions. [2022-12-14 20:16:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 577 transitions. [2022-12-14 20:16:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 20:16:28,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:16:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 462 states and 589 transitions. [2022-12-14 20:16:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 589 transitions. [2022-12-14 20:16:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 20:16:28,359 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:28,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 475 states and 604 transitions. [2022-12-14 20:16:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 604 transitions. [2022-12-14 20:16:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 20:16:28,523 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:28,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 481 states and 612 transitions. [2022-12-14 20:16:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 612 transitions. [2022-12-14 20:16:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-14 20:16:28,698 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 20:16:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 510 states and 644 transitions. [2022-12-14 20:16:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 644 transitions. [2022-12-14 20:16:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-14 20:16:29,102 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:16:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 520 states and 654 transitions. [2022-12-14 20:16:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 654 transitions. [2022-12-14 20:16:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 20:16:29,312 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:16:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 544 states and 679 transitions. [2022-12-14 20:16:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 679 transitions. [2022-12-14 20:16:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 20:16:29,448 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 566 states and 706 transitions. [2022-12-14 20:16:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 706 transitions. [2022-12-14 20:16:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 20:16:29,861 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:29,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 20:16:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 567 states and 708 transitions. [2022-12-14 20:16:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 708 transitions. [2022-12-14 20:16:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 20:16:30,019 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:30,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:16:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 666 states and 816 transitions. [2022-12-14 20:16:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 816 transitions. [2022-12-14 20:16:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-14 20:16:30,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 667 states and 817 transitions. [2022-12-14 20:16:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 817 transitions. [2022-12-14 20:16:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 20:16:31,222 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 20:16:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 668 states and 824 transitions. [2022-12-14 20:16:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 824 transitions. [2022-12-14 20:16:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 20:16:31,311 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 20:16:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 669 states and 824 transitions. [2022-12-14 20:16:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 824 transitions. [2022-12-14 20:16:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-12-14 20:16:31,414 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 20:16:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 686 states and 843 transitions. [2022-12-14 20:16:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 843 transitions. [2022-12-14 20:16:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 20:16:31,673 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:16:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 698 states and 856 transitions. [2022-12-14 20:16:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 856 transitions. [2022-12-14 20:16:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-14 20:16:31,945 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:16:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 712 states and 870 transitions. [2022-12-14 20:16:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 870 transitions. [2022-12-14 20:16:32,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-12-14 20:16:32,150 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:32,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:16:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 719 states and 879 transitions. [2022-12-14 20:16:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 879 transitions. [2022-12-14 20:16:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 20:16:32,251 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 740 states and 902 transitions. [2022-12-14 20:16:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 902 transitions. [2022-12-14 20:16:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 20:16:32,399 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 807 states and 987 transitions. [2022-12-14 20:16:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 987 transitions. [2022-12-14 20:16:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 20:16:33,260 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:33,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 835 states and 1017 transitions. [2022-12-14 20:16:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1017 transitions. [2022-12-14 20:16:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-14 20:16:33,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:33,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 20:16:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 837 states and 1018 transitions. [2022-12-14 20:16:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1018 transitions. [2022-12-14 20:16:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-14 20:16:33,939 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:16:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 921 states and 1112 transitions. [2022-12-14 20:16:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1112 transitions. [2022-12-14 20:16:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-14 20:16:35,188 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 989 states and 1192 transitions. [2022-12-14 20:16:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1192 transitions. [2022-12-14 20:16:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 20:16:36,184 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 20:16:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1016 states and 1220 transitions. [2022-12-14 20:16:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1220 transitions. [2022-12-14 20:16:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 20:16:36,736 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:36,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 20:16:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1039 states and 1243 transitions. [2022-12-14 20:16:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1243 transitions. [2022-12-14 20:16:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 20:16:36,936 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1060 states and 1272 transitions. [2022-12-14 20:16:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1272 transitions. [2022-12-14 20:16:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-12-14 20:16:37,099 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-14 20:16:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1113 states and 1326 transitions. [2022-12-14 20:16:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1326 transitions. [2022-12-14 20:16:37,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 20:16:37,589 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 20:16:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1118 states and 1337 transitions. [2022-12-14 20:16:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1337 transitions. [2022-12-14 20:16:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 20:16:38,048 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 20:16:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1119 states and 1337 transitions. [2022-12-14 20:16:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1337 transitions. [2022-12-14 20:16:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 20:16:38,227 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 20:16:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1121 states and 1338 transitions. [2022-12-14 20:16:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1338 transitions. [2022-12-14 20:16:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 20:16:38,405 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:38,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 20:16:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1146 states and 1363 transitions. [2022-12-14 20:16:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1363 transitions. [2022-12-14 20:16:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 20:16:38,713 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1148 states and 1368 transitions. [2022-12-14 20:16:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1368 transitions. [2022-12-14 20:16:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 20:16:38,961 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1213 states and 1436 transitions. [2022-12-14 20:16:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1436 transitions. [2022-12-14 20:16:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-14 20:16:39,655 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1279 states and 1506 transitions. [2022-12-14 20:16:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1506 transitions. [2022-12-14 20:16:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-14 20:16:40,508 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:40,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1306 states and 1532 transitions. [2022-12-14 20:16:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1532 transitions. [2022-12-14 20:16:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 20:16:41,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1377 states and 1603 transitions. [2022-12-14 20:16:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1603 transitions. [2022-12-14 20:16:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 20:16:42,300 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:42,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:16:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1398 states and 1636 transitions. [2022-12-14 20:16:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1636 transitions. [2022-12-14 20:16:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 20:16:43,014 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 20:16:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1400 states and 1637 transitions. [2022-12-14 20:16:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1637 transitions. [2022-12-14 20:16:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 20:16:43,183 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 20:16:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1402 states and 1639 transitions. [2022-12-14 20:16:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1639 transitions. [2022-12-14 20:16:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 20:16:43,447 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-14 20:16:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1403 states and 1639 transitions. [2022-12-14 20:16:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1639 transitions. [2022-12-14 20:16:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 20:16:43,654 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:43,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 20:16:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1426 states and 1662 transitions. [2022-12-14 20:16:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1662 transitions. [2022-12-14 20:16:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 20:16:44,740 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:16:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1427 states and 1667 transitions. [2022-12-14 20:16:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1667 transitions. [2022-12-14 20:16:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 20:16:44,971 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 20:16:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1497 states and 1739 transitions. [2022-12-14 20:16:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1739 transitions. [2022-12-14 20:16:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-14 20:16:45,751 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:45,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 163 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 20:16:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1554 states and 1812 transitions. [2022-12-14 20:16:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1812 transitions. [2022-12-14 20:16:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-14 20:16:47,230 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-14 20:16:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1616 states and 1874 transitions. [2022-12-14 20:16:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1874 transitions. [2022-12-14 20:16:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-14 20:16:47,743 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:16:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1660 states and 1927 transitions. [2022-12-14 20:16:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1927 transitions. [2022-12-14 20:16:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-14 20:16:48,600 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:16:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1668 states and 1934 transitions. [2022-12-14 20:16:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1934 transitions. [2022-12-14 20:16:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-14 20:16:48,908 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 20:16:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1714 states and 1988 transitions. [2022-12-14 20:16:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 1988 transitions. [2022-12-14 20:16:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 20:16:49,819 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:49,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 1751 states and 2029 transitions. [2022-12-14 20:16:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2029 transitions. [2022-12-14 20:16:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:16:50,501 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 164 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 20:16:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1781 states and 2068 transitions. [2022-12-14 20:16:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2068 transitions. [2022-12-14 20:16:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-14 20:16:51,919 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-14 20:16:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1787 states and 2076 transitions. [2022-12-14 20:16:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2076 transitions. [2022-12-14 20:16:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 20:16:52,398 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:52,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-14 20:16:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1807 states and 2095 transitions. [2022-12-14 20:16:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2095 transitions. [2022-12-14 20:16:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 20:16:52,883 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-12-14 20:16:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1808 states and 2095 transitions. [2022-12-14 20:16:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2095 transitions. [2022-12-14 20:16:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-14 20:16:53,005 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:53,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 204 proven. 35 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 20:16:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 1886 states and 2181 transitions. [2022-12-14 20:16:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2181 transitions. [2022-12-14 20:16:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-14 20:16:54,771 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 204 proven. 35 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 20:16:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 1914 states and 2210 transitions. [2022-12-14 20:16:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2210 transitions. [2022-12-14 20:16:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 20:16:55,321 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 168 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:16:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 1933 states and 2237 transitions. [2022-12-14 20:16:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2237 transitions. [2022-12-14 20:16:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-12-14 20:16:57,624 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 20:16:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:16:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 1936 states and 2242 transitions. [2022-12-14 20:16:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2242 transitions. [2022-12-14 20:16:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-14 20:16:58,017 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:16:58,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:16:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:16:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 146 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:17:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2027 states and 2359 transitions. [2022-12-14 20:17:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2359 transitions. [2022-12-14 20:17:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-12-14 20:17:00,694 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-14 20:17:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2048 states and 2388 transitions. [2022-12-14 20:17:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2388 transitions. [2022-12-14 20:17:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-14 20:17:03,164 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:03,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-14 20:17:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2049 states and 2394 transitions. [2022-12-14 20:17:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2394 transitions. [2022-12-14 20:17:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-14 20:17:03,532 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:17:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2068 states and 2414 transitions. [2022-12-14 20:17:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2414 transitions. [2022-12-14 20:17:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-14 20:17:04,295 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:17:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2086 states and 2432 transitions. [2022-12-14 20:17:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2432 transitions. [2022-12-14 20:17:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-12-14 20:17:04,749 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-14 20:17:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2090 states and 2434 transitions. [2022-12-14 20:17:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2434 transitions. [2022-12-14 20:17:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-12-14 20:17:05,196 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-14 20:17:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2094 states and 2436 transitions. [2022-12-14 20:17:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2436 transitions. [2022-12-14 20:17:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 20:17:05,681 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 20:17:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2166 states and 2521 transitions. [2022-12-14 20:17:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2521 transitions. [2022-12-14 20:17:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 20:17:09,585 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 20:17:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2180 states and 2536 transitions. [2022-12-14 20:17:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2536 transitions. [2022-12-14 20:17:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-12-14 20:17:10,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-14 20:17:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2181 states and 2538 transitions. [2022-12-14 20:17:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2538 transitions. [2022-12-14 20:17:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-12-14 20:17:10,769 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-12-14 20:17:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2249 states and 2608 transitions. [2022-12-14 20:17:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 2608 transitions. [2022-12-14 20:17:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-12-14 20:17:12,343 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:12,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-12-14 20:17:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2257 states and 2615 transitions. [2022-12-14 20:17:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2615 transitions. [2022-12-14 20:17:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-12-14 20:17:12,671 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:12,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 20:17:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2258 states and 2615 transitions. [2022-12-14 20:17:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2615 transitions. [2022-12-14 20:17:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-12-14 20:17:13,128 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:17:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2302 states and 2671 transitions. [2022-12-14 20:17:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2671 transitions. [2022-12-14 20:17:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-12-14 20:17:14,611 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:17:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2336 states and 2705 transitions. [2022-12-14 20:17:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 2705 transitions. [2022-12-14 20:17:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-12-14 20:17:15,307 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:17:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2344 states and 2712 transitions. [2022-12-14 20:17:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2712 transitions. [2022-12-14 20:17:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-12-14 20:17:15,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-14 20:17:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2351 states and 2723 transitions. [2022-12-14 20:17:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2723 transitions. [2022-12-14 20:17:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-12-14 20:17:16,526 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-14 20:17:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2355 states and 2726 transitions. [2022-12-14 20:17:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2726 transitions. [2022-12-14 20:17:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-12-14 20:17:16,843 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:16,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-14 20:17:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2359 states and 2729 transitions. [2022-12-14 20:17:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 2729 transitions. [2022-12-14 20:17:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-12-14 20:17:17,158 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:17,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 176 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 20:17:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2360 states and 2733 transitions. [2022-12-14 20:17:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2733 transitions. [2022-12-14 20:17:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-12-14 20:17:17,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:17:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 188 proven. 112 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-14 20:17:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:17:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2482 states and 2864 transitions. [2022-12-14 20:17:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 2864 transitions. [2022-12-14 20:17:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-12-14 20:17:19,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:17:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:17:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:17:19,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 20:17:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:17:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:17:20,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 20:17:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:17:20,268 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 96 iterations. [2022-12-14 20:17:20,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 08:17:20 ImpRootNode [2022-12-14 20:17:20,425 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 20:17:20,426 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 20:17:20,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 20:17:20,426 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 20:17:20,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:16:22" (3/4) ... [2022-12-14 20:17:20,427 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 20:17:20,512 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 20:17:20,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 20:17:20,512 INFO L158 Benchmark]: Toolchain (without parser) took 59167.34ms. Allocated memory was 134.2MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 96.7MB in the beginning and 895.2MB in the end (delta: -798.4MB). Peak memory consumption was 150.9MB. Max. memory is 16.1GB. [2022-12-14 20:17:20,513 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 20:17:20,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.83ms. Allocated memory is still 134.2MB. Free memory was 96.3MB in the beginning and 69.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 20:17:20,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.57ms. Allocated memory is still 134.2MB. Free memory was 69.1MB in the beginning and 63.5MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 20:17:20,513 INFO L158 Benchmark]: Boogie Preprocessor took 63.07ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 63.5MB in the beginning and 136.8MB in the end (delta: -73.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-12-14 20:17:20,513 INFO L158 Benchmark]: RCFGBuilder took 1020.01ms. Allocated memory is still 169.9MB. Free memory was 136.7MB in the beginning and 74.8MB in the end (delta: 61.9MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2022-12-14 20:17:20,514 INFO L158 Benchmark]: CodeCheck took 57494.69ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 74.8MB in the beginning and 917.2MB in the end (delta: -842.4MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2022-12-14 20:17:20,514 INFO L158 Benchmark]: Witness Printer took 86.44ms. Allocated memory is still 1.1GB. Free memory was 917.2MB in the beginning and 895.2MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 20:17:20,515 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.3s, OverallIterations: 96, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232663 SdHoareTripleChecker+Valid, 389.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231910 mSDsluCounter, 36377 SdHoareTripleChecker+Invalid, 333.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31886 mSDsCounter, 58033 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 502799 IncrementalHoareTripleChecker+Invalid, 560832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58033 mSolverCounterUnsat, 4491 mSDtfsCounter, 502799 mSolverCounterSat, 2.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108281 GetRequests, 105784 SyntacticMatches, 1775 SemanticMatches, 722 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316204 ImplicationChecksByTransitivity, 34.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 16194 NumberOfCodeBlocks, 16194 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 15856 ConstructedInterpolants, 0 QuantifiedInterpolants, 53899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 81 PerfectInterpolantSequences, 13952/15093 InterpolantCoveringCapability, 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: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 408]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\old(input)=1, \result=26, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L159] a16 = 4 [L160] a17 = 0 [L161] return 25; VAL [\old(input)=4, \result=25, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L140] a8 = 15 [L141] a17 = 0 [L142] a21 = 1 [L143] a20 = 0 [L144] a16 = 4 [L145] return -1; VAL [\old(input)=6, \result=-1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L408] reach_error() VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.83ms. Allocated memory is still 134.2MB. Free memory was 96.3MB in the beginning and 69.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.57ms. Allocated memory is still 134.2MB. Free memory was 69.1MB in the beginning and 63.5MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.07ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 63.5MB in the beginning and 136.8MB in the end (delta: -73.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1020.01ms. Allocated memory is still 169.9MB. Free memory was 136.7MB in the beginning and 74.8MB in the end (delta: 61.9MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * CodeCheck took 57494.69ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 74.8MB in the beginning and 917.2MB in the end (delta: -842.4MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * Witness Printer took 86.44ms. Allocated memory is still 1.1GB. Free memory was 917.2MB in the beginning and 895.2MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 20:17:20,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc088365-89db-4cae-8b09-d0e292b676cb/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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