./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB --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 a72af9635062057dd6c19863d310cc14f9352c104eb0a387b7496a065455bebf --- 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-dbf71c6-m [2022-10-17 16:38:04,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 16:38:04,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 16:38:04,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 16:38:04,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 16:38:04,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 16:38:04,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 16:38:04,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 16:38:04,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 16:38:04,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 16:38:04,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 16:38:04,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 16:38:04,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 16:38:04,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 16:38:04,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 16:38:04,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 16:38:04,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 16:38:04,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 16:38:04,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 16:38:04,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 16:38:04,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 16:38:04,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 16:38:04,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 16:38:04,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 16:38:04,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 16:38:04,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 16:38:04,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 16:38:04,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 16:38:04,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 16:38:04,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 16:38:04,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 16:38:04,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 16:38:04,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 16:38:04,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 16:38:04,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 16:38:04,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 16:38:04,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 16:38:04,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 16:38:04,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 16:38:04,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 16:38:04,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 16:38:04,357 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-10-17 16:38:04,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 16:38:04,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 16:38:04,404 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 16:38:04,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-10-17 16:38:04,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 16:38:04,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 16:38:04,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 16:38:04,406 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 16:38:04,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 16:38:04,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 16:38:04,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 16:38:04,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 16:38:04,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 16:38:04,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 16:38:04,408 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 16:38:04,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 16:38:04,409 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 16:38:04,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 16:38:04,409 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-10-17 16:38:04,409 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-10-17 16:38:04,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 16:38:04,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-10-17 16:38:04,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 16:38:04,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 16:38:04,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 16:38:04,411 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-10-17 16:38:04,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 16:38:04,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 16:38:04,411 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_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/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_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB 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 -> a72af9635062057dd6c19863d310cc14f9352c104eb0a387b7496a065455bebf [2022-10-17 16:38:04,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 16:38:04,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 16:38:04,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 16:38:04,776 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 16:38:04,777 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 16:38:04,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c [2022-10-17 16:38:04,866 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/data/d0f0c500b/73833bfbefdc4cb18928f9130fdf8521/FLAG7ef625787 [2022-10-17 16:38:05,475 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 16:38:05,476 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/sv-benchmarks/c/eca-rers2012/Problem02_label44.c [2022-10-17 16:38:05,509 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/data/d0f0c500b/73833bfbefdc4cb18928f9130fdf8521/FLAG7ef625787 [2022-10-17 16:38:05,752 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/data/d0f0c500b/73833bfbefdc4cb18928f9130fdf8521 [2022-10-17 16:38:05,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 16:38:05,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 16:38:05,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 16:38:05,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 16:38:05,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 16:38:05,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:38:05" (1/1) ... [2022-10-17 16:38:05,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d2dc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:05, skipping insertion in model container [2022-10-17 16:38:05,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:38:05" (1/1) ... [2022-10-17 16:38:05,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 16:38:05,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 16:38:06,218 WARN L230 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_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/sv-benchmarks/c/eca-rers2012/Problem02_label44.c[15425,15438] [2022-10-17 16:38:06,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 16:38:06,288 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 16:38:06,400 WARN L230 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_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/sv-benchmarks/c/eca-rers2012/Problem02_label44.c[15425,15438] [2022-10-17 16:38:06,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 16:38:06,486 INFO L208 MainTranslator]: Completed translation [2022-10-17 16:38:06,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06 WrapperNode [2022-10-17 16:38:06,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 16:38:06,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 16:38:06,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 16:38:06,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 16:38:06,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,600 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2022-10-17 16:38:06,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 16:38:06,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 16:38:06,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 16:38:06,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 16:38:06,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,692 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 16:38:06,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 16:38:06,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 16:38:06,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 16:38:06,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:38:06" (1/1) ... [2022-10-17 16:38:06,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-10-17 16:38:06,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/z3 [2022-10-17 16:38:06,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-10-17 16:38:06,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-10-17 16:38:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 16:38:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 16:38:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 16:38:06,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 16:38:06,986 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 16:38:06,989 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 16:38:08,411 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 16:38:08,727 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 16:38:08,727 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-17 16:38:08,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:38:08 BoogieIcfgContainer [2022-10-17 16:38:08,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 16:38:08,731 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-10-17 16:38:08,731 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-10-17 16:38:08,743 INFO L275 PluginConnector]: CodeCheck initialized [2022-10-17 16:38:08,743 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:38:08" (1/1) ... [2022-10-17 16:38:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 16:38:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2022-10-17 16:38:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2022-10-17 16:38:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-17 16:38:08,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2022-10-17 16:38:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2022-10-17 16:38:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-10-17 16:38:10,029 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2022-10-17 16:38:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2022-10-17 16:38:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-17 16:38:11,070 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2022-10-17 16:38:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2022-10-17 16:38:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-17 16:38:11,292 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2022-10-17 16:38:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2022-10-17 16:38:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-10-17 16:38:11,515 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 16:38:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2022-10-17 16:38:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2022-10-17 16:38:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-10-17 16:38:11,786 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2022-10-17 16:38:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2022-10-17 16:38:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-10-17 16:38:11,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2022-10-17 16:38:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2022-10-17 16:38:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-10-17 16:38:12,110 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2022-10-17 16:38:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2022-10-17 16:38:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-10-17 16:38:12,547 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:12,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 386 states and 488 transitions. [2022-10-17 16:38:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 488 transitions. [2022-10-17 16:38:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-10-17 16:38:13,489 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 418 states and 528 transitions. [2022-10-17 16:38:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 528 transitions. [2022-10-17 16:38:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-10-17 16:38:14,549 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 16:38:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 521 states and 636 transitions. [2022-10-17 16:38:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 636 transitions. [2022-10-17 16:38:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-10-17 16:38:16,278 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:16,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 528 states and 643 transitions. [2022-10-17 16:38:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 643 transitions. [2022-10-17 16:38:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-10-17 16:38:16,485 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 541 states and 658 transitions. [2022-10-17 16:38:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 658 transitions. [2022-10-17 16:38:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-10-17 16:38:16,977 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-17 16:38:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 547 states and 665 transitions. [2022-10-17 16:38:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 665 transitions. [2022-10-17 16:38:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-10-17 16:38:17,268 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-17 16:38:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 550 states and 668 transitions. [2022-10-17 16:38:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 668 transitions. [2022-10-17 16:38:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-10-17 16:38:17,453 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 16:38:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 581 states and 701 transitions. [2022-10-17 16:38:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 701 transitions. [2022-10-17 16:38:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-10-17 16:38:17,811 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:17,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-17 16:38:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 605 states and 732 transitions. [2022-10-17 16:38:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 732 transitions. [2022-10-17 16:38:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-10-17 16:38:18,617 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-17 16:38:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 614 states and 741 transitions. [2022-10-17 16:38:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 741 transitions. [2022-10-17 16:38:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-10-17 16:38:18,808 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 16:38:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 617 states and 744 transitions. [2022-10-17 16:38:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 744 transitions. [2022-10-17 16:38:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-10-17 16:38:18,991 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-17 16:38:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 630 states and 760 transitions. [2022-10-17 16:38:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 760 transitions. [2022-10-17 16:38:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-10-17 16:38:19,466 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 656 states and 793 transitions. [2022-10-17 16:38:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 793 transitions. [2022-10-17 16:38:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-10-17 16:38:20,419 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-17 16:38:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 687 states and 836 transitions. [2022-10-17 16:38:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 836 transitions. [2022-10-17 16:38:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-10-17 16:38:21,326 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:21,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-17 16:38:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 693 states and 842 transitions. [2022-10-17 16:38:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 842 transitions. [2022-10-17 16:38:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-10-17 16:38:21,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:21,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-17 16:38:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 744 states and 901 transitions. [2022-10-17 16:38:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 901 transitions. [2022-10-17 16:38:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-10-17 16:38:22,650 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:22,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-17 16:38:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 754 states and 913 transitions. [2022-10-17 16:38:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 913 transitions. [2022-10-17 16:38:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-10-17 16:38:23,203 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:38:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 819 states and 982 transitions. [2022-10-17 16:38:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 982 transitions. [2022-10-17 16:38:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-10-17 16:38:24,817 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:24,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-17 16:38:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 850 states and 1016 transitions. [2022-10-17 16:38:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1016 transitions. [2022-10-17 16:38:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-10-17 16:38:25,314 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:25,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-17 16:38:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 863 states and 1028 transitions. [2022-10-17 16:38:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1028 transitions. [2022-10-17 16:38:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-10-17 16:38:25,933 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:25,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-17 16:38:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 870 states and 1036 transitions. [2022-10-17 16:38:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1036 transitions. [2022-10-17 16:38:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-10-17 16:38:26,277 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-17 16:38:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 876 states and 1041 transitions. [2022-10-17 16:38:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1041 transitions. [2022-10-17 16:38:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-10-17 16:38:26,704 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:26,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-17 16:38:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 894 states and 1062 transitions. [2022-10-17 16:38:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1062 transitions. [2022-10-17 16:38:27,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-10-17 16:38:27,646 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:38:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-10-17 16:38:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:38:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 915 states and 1084 transitions. [2022-10-17 16:38:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1084 transitions. [2022-10-17 16:38:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-10-17 16:38:28,178 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:38:28,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:38:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:38:28,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 16:38:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:38:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:38:28,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 16:38:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:38:28,562 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 33 iterations. [2022-10-17 16:38:28,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 17.10 04:38:28 ImpRootNode [2022-10-17 16:38:28,757 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-10-17 16:38:28,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 16:38:28,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 16:38:28,757 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 16:38:28,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:38:08" (3/4) ... [2022-10-17 16:38:28,760 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 16:38:28,945 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/witness.graphml [2022-10-17 16:38:28,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 16:38:28,946 INFO L158 Benchmark]: Toolchain (without parser) took 23189.52ms. Allocated memory was 92.3MB in the beginning and 375.4MB in the end (delta: 283.1MB). Free memory was 55.2MB in the beginning and 138.1MB in the end (delta: -83.0MB). Peak memory consumption was 199.9MB. Max. memory is 16.1GB. [2022-10-17 16:38:28,946 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 92.3MB. Free memory was 65.9MB in the beginning and 65.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 16:38:28,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.14ms. Allocated memory is still 92.3MB. Free memory was 54.9MB in the beginning and 50.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-10-17 16:38:28,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.60ms. Allocated memory is still 92.3MB. Free memory was 49.7MB in the beginning and 44.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 16:38:28,950 INFO L158 Benchmark]: Boogie Preprocessor took 120.89ms. Allocated memory is still 92.3MB. Free memory was 44.4MB in the beginning and 39.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 16:38:28,951 INFO L158 Benchmark]: RCFGBuilder took 2007.34ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 39.8MB in the beginning and 49.1MB in the end (delta: -9.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-10-17 16:38:28,951 INFO L158 Benchmark]: CodeCheck took 20025.36ms. Allocated memory was 111.1MB in the beginning and 375.4MB in the end (delta: 264.2MB). Free memory was 49.1MB in the beginning and 152.8MB in the end (delta: -103.7MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. [2022-10-17 16:38:28,951 INFO L158 Benchmark]: Witness Printer took 187.92ms. Allocated memory is still 375.4MB. Free memory was 152.8MB in the beginning and 138.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-10-17 16:38:28,954 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 33, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31880 SdHoareTripleChecker+Valid, 94.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31600 mSDsluCounter, 4766 SdHoareTripleChecker+Invalid, 76.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3956 mSDsCounter, 13454 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74590 IncrementalHoareTripleChecker+Invalid, 88044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13454 mSolverCounterUnsat, 810 mSDtfsCounter, 74590 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28771 GetRequests, 28503 SyntacticMatches, 44 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23245 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 4161 NumberOfCodeBlocks, 4161 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3975 ConstructedInterpolants, 0 QuantifiedInterpolants, 9288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 30 PerfectInterpolantSequences, 1898/1910 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: 446]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [\old(input)=1, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L360] a28 = 9 [L361] a11 = 1 [L362] a25 = 0 [L363] return -1; VAL [\old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L442] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L445] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L446] reach_error() VAL [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, 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.33ms. Allocated memory is still 92.3MB. Free memory was 65.9MB in the beginning and 65.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 727.14ms. Allocated memory is still 92.3MB. Free memory was 54.9MB in the beginning and 50.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.60ms. Allocated memory is still 92.3MB. Free memory was 49.7MB in the beginning and 44.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.89ms. Allocated memory is still 92.3MB. Free memory was 44.4MB in the beginning and 39.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2007.34ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 39.8MB in the beginning and 49.1MB in the end (delta: -9.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * CodeCheck took 20025.36ms. Allocated memory was 111.1MB in the beginning and 375.4MB in the end (delta: 264.2MB). Free memory was 49.1MB in the beginning and 152.8MB in the end (delta: -103.7MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. * Witness Printer took 187.92ms. Allocated memory is still 375.4MB. Free memory was 152.8MB in the beginning and 138.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-10-17 16:38:29,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94ca0192-c5d2-4e76-8ee1-3b7f963aa23d/bin/ukojak-92XMlrwhuB/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