./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label35.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_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/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_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label35.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/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_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/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 f4b477d0e6c60065d1b46e04f151e6fb74d379cb060b8e0e07c8eed55b9ff4ba --- 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 19:20:45,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 19:20:45,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 19:20:45,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 19:20:45,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 19:20:45,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 19:20:45,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 19:20:45,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 19:20:45,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 19:20:45,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 19:20:45,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 19:20:45,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 19:20:45,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 19:20:45,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 19:20:45,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 19:20:45,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 19:20:45,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 19:20:45,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 19:20:45,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 19:20:45,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 19:20:45,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 19:20:45,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 19:20:45,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 19:20:45,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 19:20:45,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 19:20:45,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 19:20:45,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 19:20:45,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 19:20:45,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 19:20:45,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 19:20:45,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 19:20:45,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 19:20:45,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 19:20:45,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 19:20:45,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 19:20:45,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 19:20:45,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 19:20:45,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 19:20:45,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 19:20:45,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 19:20:45,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 19:20:45,053 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 19:20:45,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 19:20:45,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 19:20:45,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 19:20:45,068 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 19:20:45,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 19:20:45,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 19:20:45,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 19:20:45,069 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 19:20:45,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 19:20:45,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 19:20:45,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 19:20:45,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 19:20:45,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 19:20:45,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 19:20:45,070 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 19:20:45,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 19:20:45,070 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 19:20:45,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 19:20:45,071 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 19:20:45,071 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 19:20:45,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 19:20:45,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:20:45,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 19:20:45,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 19:20:45,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 19:20:45,072 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 19:20:45,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 19:20:45,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 19:20:45,072 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_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/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_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/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 -> f4b477d0e6c60065d1b46e04f151e6fb74d379cb060b8e0e07c8eed55b9ff4ba [2022-12-14 19:20:45,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 19:20:45,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 19:20:45,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 19:20:45,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 19:20:45,280 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 19:20:45,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label35.c [2022-12-14 19:20:47,862 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 19:20:48,062 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 19:20:48,063 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/sv-benchmarks/c/eca-rers2012/Problem01_label35.c [2022-12-14 19:20:48,071 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/data/ebb4116af/618e427f5a544670b0fd54566494d1ef/FLAG330a85256 [2022-12-14 19:20:48,439 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/data/ebb4116af/618e427f5a544670b0fd54566494d1ef [2022-12-14 19:20:48,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 19:20:48,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 19:20:48,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 19:20:48,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 19:20:48,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 19:20:48,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44678020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48, skipping insertion in model container [2022-12-14 19:20:48,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 19:20:48,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 19:20:48,684 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_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/sv-benchmarks/c/eca-rers2012/Problem01_label35.c[15502,15515] [2022-12-14 19:20:48,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:20:48,724 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 19:20:48,772 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_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/sv-benchmarks/c/eca-rers2012/Problem01_label35.c[15502,15515] [2022-12-14 19:20:48,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:20:48,796 INFO L208 MainTranslator]: Completed translation [2022-12-14 19:20:48,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48 WrapperNode [2022-12-14 19:20:48,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 19:20:48,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 19:20:48,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 19:20:48,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 19:20:48,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,859 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 19:20:48,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 19:20:48,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 19:20:48,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 19:20:48,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 19:20:48,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 19:20:48,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 19:20:48,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 19:20:48,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 19:20:48,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:20:48" (1/1) ... [2022-12-14 19:20:48,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:20:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 19:20:48,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 19:20:48,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 19:20:48,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 19:20:48,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 19:20:48,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 19:20:48,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 19:20:49,046 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 19:20:49,048 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 19:20:49,759 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 19:20:49,883 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 19:20:49,884 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 19:20:49,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:20:49 BoogieIcfgContainer [2022-12-14 19:20:49,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 19:20:49,886 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 19:20:49,886 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 19:20:49,893 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 19:20:49,893 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:20:49" (1/1) ... [2022-12-14 19:20:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 19:20:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 19:20:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 19:20:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 19:20:49,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:49,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:50,216 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 19:20:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2022-12-14 19:20:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2022-12-14 19:20:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 19:20:50,578 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:20:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2022-12-14 19:20:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2022-12-14 19:20:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 19:20:50,801 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:50,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:20:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2022-12-14 19:20:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2022-12-14 19:20:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 19:20:50,897 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:20:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 221 states and 299 transitions. [2022-12-14 19:20:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2022-12-14 19:20:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-14 19:20:51,355 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:51,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:20:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 228 states and 308 transitions. [2022-12-14 19:20:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2022-12-14 19:20:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-14 19:20:51,546 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:20:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 239 states and 323 transitions. [2022-12-14 19:20:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2022-12-14 19:20:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 19:20:51,976 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:51,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:52,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:20:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 248 states and 332 transitions. [2022-12-14 19:20:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 332 transitions. [2022-12-14 19:20:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 19:20:52,123 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:20:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 256 states and 342 transitions. [2022-12-14 19:20:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 342 transitions. [2022-12-14 19:20:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 19:20:52,335 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 19:20:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 264 states and 355 transitions. [2022-12-14 19:20:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2022-12-14 19:20:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 19:20:52,566 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:52,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:20:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2022-12-14 19:20:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2022-12-14 19:20:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 19:20:52,861 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 19:20:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 285 states and 380 transitions. [2022-12-14 19:20:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2022-12-14 19:20:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 19:20:53,048 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 19:20:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 292 states and 389 transitions. [2022-12-14 19:20:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 389 transitions. [2022-12-14 19:20:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 19:20:53,303 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:53,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:20:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 295 states and 393 transitions. [2022-12-14 19:20:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 393 transitions. [2022-12-14 19:20:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 19:20:53,543 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:20:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 296 states and 395 transitions. [2022-12-14 19:20:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-12-14 19:20:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 19:20:53,691 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 19:20:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 312 states and 416 transitions. [2022-12-14 19:20:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 416 transitions. [2022-12-14 19:20:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 19:20:54,224 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:54,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 19:20:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 327 states and 434 transitions. [2022-12-14 19:20:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 434 transitions. [2022-12-14 19:20:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 19:20:54,743 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:20:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 338 states and 447 transitions. [2022-12-14 19:20:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2022-12-14 19:20:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 19:20:55,161 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:20:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 345 states and 456 transitions. [2022-12-14 19:20:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2022-12-14 19:20:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 19:20:55,326 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 19:20:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 354 states and 467 transitions. [2022-12-14 19:20:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 467 transitions. [2022-12-14 19:20:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 19:20:55,415 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 19:20:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 368 states and 481 transitions. [2022-12-14 19:20:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 481 transitions. [2022-12-14 19:20:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 19:20:55,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:55,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:20:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 372 states and 485 transitions. [2022-12-14 19:20:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 485 transitions. [2022-12-14 19:20:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 19:20:55,661 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:55,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 19:20:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 381 states and 496 transitions. [2022-12-14 19:20:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 496 transitions. [2022-12-14 19:20:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 19:20:55,879 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:55,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 19:20:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 395 states and 511 transitions. [2022-12-14 19:20:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 511 transitions. [2022-12-14 19:20:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 19:20:56,231 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:20:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 397 states and 513 transitions. [2022-12-14 19:20:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 513 transitions. [2022-12-14 19:20:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 19:20:56,301 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:20:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 398 states and 514 transitions. [2022-12-14 19:20:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 514 transitions. [2022-12-14 19:20:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 19:20:56,357 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:56,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 19:20:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 415 states and 532 transitions. [2022-12-14 19:20:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 532 transitions. [2022-12-14 19:20:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 19:20:56,551 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:56,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 19:20:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 418 states and 536 transitions. [2022-12-14 19:20:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 536 transitions. [2022-12-14 19:20:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 19:20:56,667 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:56,741 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 19:20:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 441 states and 561 transitions. [2022-12-14 19:20:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 561 transitions. [2022-12-14 19:20:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 19:20:56,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 19:20:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 456 states and 577 transitions. [2022-12-14 19:20:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 577 transitions. [2022-12-14 19:20:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 19:20:57,063 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:20:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 468 states and 590 transitions. [2022-12-14 19:20:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 590 transitions. [2022-12-14 19:20:57,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 19:20:57,219 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:20:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 476 states and 604 transitions. [2022-12-14 19:20:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 604 transitions. [2022-12-14 19:20:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 19:20:57,689 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:57,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:20:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 495 states and 625 transitions. [2022-12-14 19:20:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 625 transitions. [2022-12-14 19:20:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 19:20:57,893 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:20:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 497 states and 627 transitions. [2022-12-14 19:20:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 627 transitions. [2022-12-14 19:20:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 19:20:58,080 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:58,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 19:20:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 511 states and 641 transitions. [2022-12-14 19:20:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 641 transitions. [2022-12-14 19:20:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 19:20:58,200 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:20:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 519 states and 652 transitions. [2022-12-14 19:20:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 652 transitions. [2022-12-14 19:20:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 19:20:58,297 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:58,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:20:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 520 states and 653 transitions. [2022-12-14 19:20:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 653 transitions. [2022-12-14 19:20:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 19:20:58,360 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:20:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 550 states and 685 transitions. [2022-12-14 19:20:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 685 transitions. [2022-12-14 19:20:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 19:20:58,677 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:58,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 19:20:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 590 states and 727 transitions. [2022-12-14 19:20:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 727 transitions. [2022-12-14 19:20:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 19:20:59,400 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 19:20:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 595 states and 732 transitions. [2022-12-14 19:20:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 732 transitions. [2022-12-14 19:20:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 19:20:59,621 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:59,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:59,660 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 19:20:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:20:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 600 states and 738 transitions. [2022-12-14 19:20:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 738 transitions. [2022-12-14 19:20:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 19:20:59,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:20:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:20:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:20:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 19:21:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 606 states and 746 transitions. [2022-12-14 19:21:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 746 transitions. [2022-12-14 19:21:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 19:21:00,152 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:00,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:21:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 746 states and 895 transitions. [2022-12-14 19:21:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 895 transitions. [2022-12-14 19:21:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 19:21:01,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:01,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:21:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 817 states and 981 transitions. [2022-12-14 19:21:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 981 transitions. [2022-12-14 19:21:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 19:21:02,730 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:02,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:21:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 846 states and 1013 transitions. [2022-12-14 19:21:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1013 transitions. [2022-12-14 19:21:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 19:21:02,888 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 19:21:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 858 states and 1026 transitions. [2022-12-14 19:21:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1026 transitions. [2022-12-14 19:21:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 19:21:03,001 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:21:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 929 states and 1097 transitions. [2022-12-14 19:21:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1097 transitions. [2022-12-14 19:21:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 19:21:04,103 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:04,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 102 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 19:21:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 965 states and 1136 transitions. [2022-12-14 19:21:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1136 transitions. [2022-12-14 19:21:04,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 19:21:04,613 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:04,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 19:21:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1005 states and 1175 transitions. [2022-12-14 19:21:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1175 transitions. [2022-12-14 19:21:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 19:21:05,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 19:21:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1008 states and 1179 transitions. [2022-12-14 19:21:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1179 transitions. [2022-12-14 19:21:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 19:21:05,565 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:21:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1101 states and 1294 transitions. [2022-12-14 19:21:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1294 transitions. [2022-12-14 19:21:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 19:21:07,520 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:21:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1103 states and 1297 transitions. [2022-12-14 19:21:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1297 transitions. [2022-12-14 19:21:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 19:21:07,934 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:07,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 19:21:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1150 states and 1350 transitions. [2022-12-14 19:21:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1350 transitions. [2022-12-14 19:21:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 19:21:08,337 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 92 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-14 19:21:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1236 states and 1439 transitions. [2022-12-14 19:21:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1439 transitions. [2022-12-14 19:21:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-14 19:21:08,952 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:21:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1307 states and 1527 transitions. [2022-12-14 19:21:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1527 transitions. [2022-12-14 19:21:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 19:21:10,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:10,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 159 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 19:21:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1366 states and 1606 transitions. [2022-12-14 19:21:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1606 transitions. [2022-12-14 19:21:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 19:21:12,597 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:12,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 159 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 19:21:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1382 states and 1628 transitions. [2022-12-14 19:21:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1628 transitions. [2022-12-14 19:21:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 19:21:13,455 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 159 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 19:21:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1391 states and 1636 transitions. [2022-12-14 19:21:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1636 transitions. [2022-12-14 19:21:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 19:21:13,959 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:13,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:21:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:21:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:21:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1429 states and 1680 transitions. [2022-12-14 19:21:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1680 transitions. [2022-12-14 19:21:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 19:21:16,314 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:21:16,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:21:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:21:16,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:21:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:21:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:21:16,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:21:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:21:16,552 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 59 iterations. [2022-12-14 19:21:16,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 07:21:16 ImpRootNode [2022-12-14 19:21:16,682 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 19:21:16,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 19:21:16,682 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 19:21:16,682 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 19:21:16,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:20:49" (3/4) ... [2022-12-14 19:21:16,684 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 19:21:16,781 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 19:21:16,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 19:21:16,782 INFO L158 Benchmark]: Toolchain (without parser) took 28337.24ms. Allocated memory was 138.4MB in the beginning and 423.6MB in the end (delta: 285.2MB). Free memory was 102.1MB in the beginning and 247.7MB in the end (delta: -145.6MB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB. [2022-12-14 19:21:16,782 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 19:21:16,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.33ms. Allocated memory is still 138.4MB. Free memory was 102.1MB in the beginning and 74.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 19:21:16,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.09ms. Allocated memory is still 138.4MB. Free memory was 74.8MB in the beginning and 68.9MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 19:21:16,783 INFO L158 Benchmark]: Boogie Preprocessor took 62.43ms. Allocated memory is still 138.4MB. Free memory was 68.9MB in the beginning and 106.2MB in the end (delta: -37.3MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-12-14 19:21:16,784 INFO L158 Benchmark]: RCFGBuilder took 962.53ms. Allocated memory is still 138.4MB. Free memory was 106.2MB in the beginning and 87.9MB in the end (delta: 18.3MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2022-12-14 19:21:16,784 INFO L158 Benchmark]: CodeCheck took 26795.66ms. Allocated memory was 138.4MB in the beginning and 423.6MB in the end (delta: 285.2MB). Free memory was 87.9MB in the beginning and 266.5MB in the end (delta: -178.6MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. [2022-12-14 19:21:16,784 INFO L158 Benchmark]: Witness Printer took 99.49ms. Allocated memory is still 423.6MB. Free memory was 265.5MB in the beginning and 247.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 19:21:16,786 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: 26.6s, OverallIterations: 59, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63264 SdHoareTripleChecker+Valid, 125.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62463 mSDsluCounter, 10935 SdHoareTripleChecker+Invalid, 107.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9107 mSDsCounter, 22483 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141397 IncrementalHoareTripleChecker+Invalid, 163880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22483 mSolverCounterUnsat, 1828 mSDtfsCounter, 141397 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48742 GetRequests, 47320 SyntacticMatches, 1040 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102715 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 7396 NumberOfCodeBlocks, 7396 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 7144 ConstructedInterpolants, 0 QuantifiedInterpolants, 29656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 44 PerfectInterpolantSequences, 3690/4476 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: 426]: 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)=3, 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=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=6, a17=0, a20=0, 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=6, a17=0, a20=0, 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=6, a17=0, a20=0, 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 TRUE (((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)) [L65] a7 = 0 [L66] a20 = 1 [L67] a21 = 1 [L68] a16 = 4 [L69] a17 = 1 [L70] a8 = 13 [L71] return -1; VAL [\old(input)=3, \result=-1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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 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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] 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=1, a20=1, a21=1, a7=0, 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] [L425] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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] [L426] reach_error() VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.33ms. Allocated memory is still 138.4MB. Free memory was 102.1MB in the beginning and 74.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.09ms. Allocated memory is still 138.4MB. Free memory was 74.8MB in the beginning and 68.9MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.43ms. Allocated memory is still 138.4MB. Free memory was 68.9MB in the beginning and 106.2MB in the end (delta: -37.3MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * RCFGBuilder took 962.53ms. Allocated memory is still 138.4MB. Free memory was 106.2MB in the beginning and 87.9MB in the end (delta: 18.3MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * CodeCheck took 26795.66ms. Allocated memory was 138.4MB in the beginning and 423.6MB in the end (delta: 285.2MB). Free memory was 87.9MB in the beginning and 266.5MB in the end (delta: -178.6MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. * Witness Printer took 99.49ms. Allocated memory is still 423.6MB. Free memory was 265.5MB in the beginning and 247.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 19:21:16,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5372bd8-ea75-4a42-9914-f98cc3a8e2c0/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