./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:59:58,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:59:58,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:59:58,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:59:58,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:59:58,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:59:58,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:59:58,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:59:58,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:59:58,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:59:58,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:59:58,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:59:58,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:59:58,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:59:58,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:59:58,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:59:58,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:59:58,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:59:58,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:59:58,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:59:58,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:59:58,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:59:58,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:59:58,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:59:58,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:59:58,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:59:58,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:59:58,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:59:58,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:59:58,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:59:58,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:59:58,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:59:58,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:59:58,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:59:58,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:59:58,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:59:58,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:59:58,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:59:58,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:59:58,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:59:58,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:59:58,807 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 22:59:58,874 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:59:58,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:59:58,875 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:59:58,875 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:59:58,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:59:58,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:59:58,886 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:59:58,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:59:58,887 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:59:58,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:59:58,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:59:58,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:59:58,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 22:59:58,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:59:58,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 22:59:58,890 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:59:58,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:59:58,891 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:59:58,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 22:59:58,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:59:58,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:59:58,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:59:58,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:59:58,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:59:58,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:59:58,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 22:59:58,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:59:58,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 22:59:58,894 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 22:59:58,894 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 22:59:58,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 22:59:58,895 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:59:58,896 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_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/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_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 [2021-11-02 22:59:59,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:59:59,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:59:59,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:59:59,287 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:59:59,288 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:59:59,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2021-11-02 22:59:59,371 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/data/0fb37c517/94a4d9aa0107419aa3a08e84a0cb3821/FLAG62dc7f7be [2021-11-02 23:00:00,102 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 23:00:00,103 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2021-11-02 23:00:00,120 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/data/0fb37c517/94a4d9aa0107419aa3a08e84a0cb3821/FLAG62dc7f7be [2021-11-02 23:00:00,315 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/data/0fb37c517/94a4d9aa0107419aa3a08e84a0cb3821 [2021-11-02 23:00:00,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 23:00:00,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 23:00:00,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 23:00:00,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 23:00:00,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 23:00:00,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:00:00" (1/1) ... [2021-11-02 23:00:00,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b4394e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:00, skipping insertion in model container [2021-11-02 23:00:00,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:00:00" (1/1) ... [2021-11-02 23:00:00,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 23:00:00,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 23:00:00,855 WARN L228 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_17719a0c-8285-41d6-8bb9-b296c2d6308d/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2021-11-02 23:00:00,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:00:00,952 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 23:00:01,104 WARN L228 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_17719a0c-8285-41d6-8bb9-b296c2d6308d/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2021-11-02 23:00:01,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:00:01,145 INFO L208 MainTranslator]: Completed translation [2021-11-02 23:00:01,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01 WrapperNode [2021-11-02 23:00:01,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 23:00:01,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 23:00:01,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 23:00:01,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 23:00:01,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 23:00:01,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 23:00:01,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 23:00:01,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 23:00:01,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 23:00:01,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 23:00:01,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 23:00:01,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 23:00:01,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (1/1) ... [2021-11-02 23:00:01,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:00:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:00:01,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 23:00:01,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 23:00:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 23:00:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 23:00:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 23:00:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 23:00:03,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 23:00:03,007 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-02 23:00:03,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:00:03 BoogieIcfgContainer [2021-11-02 23:00:03,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 23:00:03,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 23:00:03,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 23:00:03,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 23:00:03,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:00:00" (1/3) ... [2021-11-02 23:00:03,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c266a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:00:03, skipping insertion in model container [2021-11-02 23:00:03,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:00:01" (2/3) ... [2021-11-02 23:00:03,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c266a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:00:03, skipping insertion in model container [2021-11-02 23:00:03,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:00:03" (3/3) ... [2021-11-02 23:00:03,022 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label37.c [2021-11-02 23:00:03,029 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 23:00:03,029 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-02 23:00:03,093 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 23:00:03,101 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-02 23:00:03,101 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-02 23:00:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 23:00:03,179 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:03,180 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:03,180 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:03,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1590501662, now seen corresponding path program 1 times [2021-11-02 23:00:03,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:03,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57194458] [2021-11-02 23:00:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:03,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:00:03,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:03,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57194458] [2021-11-02 23:00:03,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57194458] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:03,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:00:03,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 23:00:03,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113409091] [2021-11-02 23:00:03,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:00:03,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:00:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:03,757 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:04,774 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2021-11-02 23:00:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:00:04,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-02 23:00:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:04,812 INFO L225 Difference]: With dead ends: 528 [2021-11-02 23:00:04,813 INFO L226 Difference]: Without dead ends: 266 [2021-11-02 23:00:04,823 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-02 23:00:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-11-02 23:00:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions. [2021-11-02 23:00:04,931 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 75 [2021-11-02 23:00:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:04,933 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 392 transitions. [2021-11-02 23:00:04,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions. [2021-11-02 23:00:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-02 23:00:04,941 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:04,942 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:04,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 23:00:04,943 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash -929055674, now seen corresponding path program 1 times [2021-11-02 23:00:04,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:04,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023554619] [2021-11-02 23:00:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:04,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:00:05,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:05,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023554619] [2021-11-02 23:00:05,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023554619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:05,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:00:05,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 23:00:05,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397569504] [2021-11-02 23:00:05,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:00:05,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:05,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:00:05,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:05,085 INFO L87 Difference]: Start difference. First operand 266 states and 392 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:05,642 INFO L93 Difference]: Finished difference Result 792 states and 1171 transitions. [2021-11-02 23:00:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:00:05,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-02 23:00:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:05,647 INFO L225 Difference]: With dead ends: 792 [2021-11-02 23:00:05,647 INFO L226 Difference]: Without dead ends: 528 [2021-11-02 23:00:05,649 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-11-02 23:00:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2021-11-02 23:00:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2021-11-02 23:00:05,697 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 80 [2021-11-02 23:00:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:05,697 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2021-11-02 23:00:05,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2021-11-02 23:00:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-02 23:00:05,701 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:05,701 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:05,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 23:00:05,702 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:05,703 INFO L85 PathProgramCache]: Analyzing trace with hash -507084737, now seen corresponding path program 1 times [2021-11-02 23:00:05,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:05,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766554589] [2021-11-02 23:00:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:05,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:00:05,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:05,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766554589] [2021-11-02 23:00:05,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766554589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:05,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:00:05,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 23:00:05,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80811559] [2021-11-02 23:00:05,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:00:05,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:05,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:00:05,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:05,814 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:06,389 INFO L93 Difference]: Finished difference Result 1447 states and 2032 transitions. [2021-11-02 23:00:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:00:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-02 23:00:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:06,413 INFO L225 Difference]: With dead ends: 1447 [2021-11-02 23:00:06,417 INFO L226 Difference]: Without dead ends: 921 [2021-11-02 23:00:06,419 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-11-02 23:00:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2021-11-02 23:00:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2902173913043478) internal successors, (1187), 920 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1187 transitions. [2021-11-02 23:00:06,503 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1187 transitions. Word has length 90 [2021-11-02 23:00:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:06,504 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1187 transitions. [2021-11-02 23:00:06,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1187 transitions. [2021-11-02 23:00:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-02 23:00:06,509 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:06,509 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:06,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 23:00:06,510 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash 720548943, now seen corresponding path program 1 times [2021-11-02 23:00:06,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:06,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943656887] [2021-11-02 23:00:06,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:06,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-02 23:00:06,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:06,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943656887] [2021-11-02 23:00:06,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943656887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:06,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:00:06,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 23:00:06,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776307284] [2021-11-02 23:00:06,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:00:06,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:00:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:06,603 INFO L87 Difference]: Start difference. First operand 921 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:07,171 INFO L93 Difference]: Finished difference Result 2102 states and 2725 transitions. [2021-11-02 23:00:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:00:07,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-02 23:00:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:07,180 INFO L225 Difference]: With dead ends: 2102 [2021-11-02 23:00:07,181 INFO L226 Difference]: Without dead ends: 1183 [2021-11-02 23:00:07,185 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2021-11-02 23:00:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2021-11-02 23:00:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.252115059221658) internal successors, (1480), 1182 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1480 transitions. [2021-11-02 23:00:07,243 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1480 transitions. Word has length 91 [2021-11-02 23:00:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:07,245 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1480 transitions. [2021-11-02 23:00:07,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1480 transitions. [2021-11-02 23:00:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-02 23:00:07,261 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:07,262 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:07,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 23:00:07,263 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1932967817, now seen corresponding path program 1 times [2021-11-02 23:00:07,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:07,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530897986] [2021-11-02 23:00:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:07,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:00:07,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:07,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530897986] [2021-11-02 23:00:07,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530897986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:07,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:00:07,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:00:07,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851922406] [2021-11-02 23:00:07,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:00:07,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:00:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:00:07,424 INFO L87 Difference]: Start difference. First operand 1183 states and 1480 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:08,146 INFO L93 Difference]: Finished difference Result 2888 states and 3590 transitions. [2021-11-02 23:00:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 23:00:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-02 23:00:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:08,157 INFO L225 Difference]: With dead ends: 2888 [2021-11-02 23:00:08,158 INFO L226 Difference]: Without dead ends: 1707 [2021-11-02 23:00:08,160 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:00:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2021-11-02 23:00:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2021-11-02 23:00:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.231111111111111) internal successors, (1939), 1575 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1939 transitions. [2021-11-02 23:00:08,211 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1939 transitions. Word has length 94 [2021-11-02 23:00:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:08,211 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1939 transitions. [2021-11-02 23:00:08,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1939 transitions. [2021-11-02 23:00:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-02 23:00:08,215 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:08,215 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:08,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 23:00:08,216 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1317371242, now seen corresponding path program 1 times [2021-11-02 23:00:08,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:08,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849517725] [2021-11-02 23:00:08,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:08,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:00:08,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:08,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849517725] [2021-11-02 23:00:08,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849517725] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:00:08,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521041299] [2021-11-02 23:00:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:08,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:00:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:00:08,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:00:08,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 23:00:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:08,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 23:00:08,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:00:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:00:09,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521041299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:09,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:00:09,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-11-02 23:00:09,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399175638] [2021-11-02 23:00:09,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:00:09,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:00:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:00:09,068 INFO L87 Difference]: Start difference. First operand 1576 states and 1939 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:09,607 INFO L93 Difference]: Finished difference Result 3150 states and 3876 transitions. [2021-11-02 23:00:09,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:00:09,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-02 23:00:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:09,622 INFO L225 Difference]: With dead ends: 3150 [2021-11-02 23:00:09,622 INFO L226 Difference]: Without dead ends: 1576 [2021-11-02 23:00:09,625 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:00:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2021-11-02 23:00:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2021-11-02 23:00:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.166031987814166) internal successors, (1531), 1313 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1531 transitions. [2021-11-02 23:00:09,736 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1531 transitions. Word has length 112 [2021-11-02 23:00:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:09,736 INFO L470 AbstractCegarLoop]: Abstraction has 1314 states and 1531 transitions. [2021-11-02 23:00:09,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1531 transitions. [2021-11-02 23:00:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-02 23:00:09,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:09,741 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:09,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-02 23:00:09,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:00:09,969 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1244022660, now seen corresponding path program 1 times [2021-11-02 23:00:09,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:09,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987210468] [2021-11-02 23:00:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:09,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 83 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-02 23:00:10,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:10,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987210468] [2021-11-02 23:00:10,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987210468] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:00:10,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686077190] [2021-11-02 23:00:10,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:10,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:00:10,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:00:10,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:00:10,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 23:00:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:10,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 23:00:10,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:00:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-02 23:00:10,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686077190] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:10,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:00:10,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-11-02 23:00:10,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077534803] [2021-11-02 23:00:10,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:00:10,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:10,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:00:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:00:10,748 INFO L87 Difference]: Start difference. First operand 1314 states and 1531 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:11,361 INFO L93 Difference]: Finished difference Result 3019 states and 3513 transitions. [2021-11-02 23:00:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:00:11,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2021-11-02 23:00:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:11,376 INFO L225 Difference]: With dead ends: 3019 [2021-11-02 23:00:11,376 INFO L226 Difference]: Without dead ends: 1707 [2021-11-02 23:00:11,381 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:00:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2021-11-02 23:00:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2021-11-02 23:00:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.137749120750293) internal successors, (1941), 1706 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1941 transitions. [2021-11-02 23:00:11,442 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1941 transitions. Word has length 149 [2021-11-02 23:00:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:11,444 INFO L470 AbstractCegarLoop]: Abstraction has 1707 states and 1941 transitions. [2021-11-02 23:00:11,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1941 transitions. [2021-11-02 23:00:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-02 23:00:11,453 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:11,454 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:11,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 23:00:11,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:00:11,669 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash -188261659, now seen corresponding path program 1 times [2021-11-02 23:00:11,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:11,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543849999] [2021-11-02 23:00:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:11,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 94 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-02 23:00:11,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:11,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543849999] [2021-11-02 23:00:11,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543849999] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:00:11,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055130616] [2021-11-02 23:00:11,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:11,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:00:11,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:00:11,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:00:11,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 23:00:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:12,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 23:00:12,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:00:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-02 23:00:12,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055130616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:12,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:00:12,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-11-02 23:00:12,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933828148] [2021-11-02 23:00:12,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:00:12,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:12,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:00:12,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:00:12,677 INFO L87 Difference]: Start difference. First operand 1707 states and 1941 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:13,459 INFO L93 Difference]: Finished difference Result 3412 states and 3886 transitions. [2021-11-02 23:00:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 23:00:13,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2021-11-02 23:00:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:13,471 INFO L225 Difference]: With dead ends: 3412 [2021-11-02 23:00:13,472 INFO L226 Difference]: Without dead ends: 1707 [2021-11-02 23:00:13,479 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:00:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2021-11-02 23:00:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2021-11-02 23:00:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1225396825396825) internal successors, (1768), 1575 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1768 transitions. [2021-11-02 23:00:13,526 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1768 transitions. Word has length 191 [2021-11-02 23:00:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:13,527 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1768 transitions. [2021-11-02 23:00:13,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1768 transitions. [2021-11-02 23:00:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-11-02 23:00:13,542 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:13,542 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:13,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-02 23:00:13,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-02 23:00:13,769 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:13,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash 3128708, now seen corresponding path program 1 times [2021-11-02 23:00:13,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:13,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938591677] [2021-11-02 23:00:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:13,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 131 proven. 6 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-02 23:00:13,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:13,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938591677] [2021-11-02 23:00:13,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938591677] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 23:00:13,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997944441] [2021-11-02 23:00:13,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:13,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:00:13,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:00:13,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:00:13,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-02 23:00:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:14,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 23:00:14,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:00:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-11-02 23:00:15,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997944441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:15,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 23:00:15,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-11-02 23:00:15,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45008394] [2021-11-02 23:00:15,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:00:15,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:15,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:00:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:00:15,037 INFO L87 Difference]: Start difference. First operand 1576 states and 1768 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:15,562 INFO L93 Difference]: Finished difference Result 3543 states and 3969 transitions. [2021-11-02 23:00:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:00:15,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2021-11-02 23:00:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:15,576 INFO L225 Difference]: With dead ends: 3543 [2021-11-02 23:00:15,576 INFO L226 Difference]: Without dead ends: 1969 [2021-11-02 23:00:15,579 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:00:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2021-11-02 23:00:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2021-11-02 23:00:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1236811254396248) internal successors, (1917), 1706 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1917 transitions. [2021-11-02 23:00:15,633 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1917 transitions. Word has length 204 [2021-11-02 23:00:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:15,634 INFO L470 AbstractCegarLoop]: Abstraction has 1707 states and 1917 transitions. [2021-11-02 23:00:15,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1917 transitions. [2021-11-02 23:00:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-11-02 23:00:15,641 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:15,642 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:15,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-02 23:00:15,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:00:15,861 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:15,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash -322379996, now seen corresponding path program 1 times [2021-11-02 23:00:15,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:15,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287500665] [2021-11-02 23:00:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:15,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:00:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-11-02 23:00:15,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:00:15,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287500665] [2021-11-02 23:00:15,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287500665] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:00:15,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:00:15,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 23:00:15,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016790023] [2021-11-02 23:00:15,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:00:15,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:00:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:00:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:15,968 INFO L87 Difference]: Start difference. First operand 1707 states and 1917 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:00:16,525 INFO L93 Difference]: Finished difference Result 3805 states and 4291 transitions. [2021-11-02 23:00:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:00:16,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2021-11-02 23:00:16,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:00:16,539 INFO L225 Difference]: With dead ends: 3805 [2021-11-02 23:00:16,539 INFO L226 Difference]: Without dead ends: 2100 [2021-11-02 23:00:16,542 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:00:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-11-02 23:00:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2021-11-02 23:00:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1176750833730347) internal successors, (2346), 2099 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2346 transitions. [2021-11-02 23:00:16,604 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2346 transitions. Word has length 247 [2021-11-02 23:00:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:00:16,605 INFO L470 AbstractCegarLoop]: Abstraction has 2100 states and 2346 transitions. [2021-11-02 23:00:16,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:00:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2346 transitions. [2021-11-02 23:00:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-11-02 23:00:16,614 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:00:16,615 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:16,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 23:00:16,616 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 23:00:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:00:16,616 INFO L85 PathProgramCache]: Analyzing trace with hash -127549203, now seen corresponding path program 1 times [2021-11-02 23:00:16,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:00:16,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088435576] [2021-11-02 23:00:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:00:16,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:00:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 23:00:16,701 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 23:00:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 23:00:16,896 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 23:00:16,896 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 23:00:16,897 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:00:16,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 23:00:16,904 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:00:16,908 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 23:00:17,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:00:17 BoogieIcfgContainer [2021-11-02 23:00:17,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 23:00:17,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 23:00:17,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 23:00:17,191 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 23:00:17,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:00:03" (3/4) ... [2021-11-02 23:00:17,194 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-02 23:00:17,504 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 23:00:17,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 23:00:17,507 INFO L168 Benchmark]: Toolchain (without parser) took 17180.69 ms. Allocated memory was 102.8 MB in the beginning and 247.5 MB in the end (delta: 144.7 MB). Free memory was 69.1 MB in the beginning and 155.5 MB in the end (delta: -86.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 16.1 GB. [2021-11-02 23:00:17,507 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 102.8 MB. Free memory is still 57.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 23:00:17,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.65 ms. Allocated memory is still 102.8 MB. Free memory was 68.8 MB in the beginning and 61.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-02 23:00:17,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.86 ms. Allocated memory is still 102.8 MB. Free memory was 61.4 MB in the beginning and 55.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-02 23:00:17,512 INFO L168 Benchmark]: Boogie Preprocessor took 173.80 ms. Allocated memory is still 102.8 MB. Free memory was 55.5 MB in the beginning and 51.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-02 23:00:17,513 INFO L168 Benchmark]: RCFGBuilder took 1566.43 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 51.3 MB in the beginning and 45.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. [2021-11-02 23:00:17,513 INFO L168 Benchmark]: TraceAbstraction took 14177.06 ms. Allocated memory was 123.7 MB in the beginning and 247.5 MB in the end (delta: 123.7 MB). Free memory was 45.9 MB in the beginning and 197.2 MB in the end (delta: -151.3 MB). Peak memory consumption was 84.4 MB. Max. memory is 16.1 GB. [2021-11-02 23:00:17,514 INFO L168 Benchmark]: Witness Printer took 314.60 ms. Allocated memory is still 247.5 MB. Free memory was 197.2 MB in the beginning and 155.5 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-11-02 23:00:17,517 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 102.8 MB. Free memory is still 57.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 813.65 ms. Allocated memory is still 102.8 MB. Free memory was 68.8 MB in the beginning and 61.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 120.86 ms. Allocated memory is still 102.8 MB. Free memory was 61.4 MB in the beginning and 55.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 173.80 ms. Allocated memory is still 102.8 MB. Free memory was 55.5 MB in the beginning and 51.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1566.43 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 51.3 MB in the beginning and 45.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14177.06 ms. Allocated memory was 123.7 MB in the beginning and 247.5 MB in the end (delta: 123.7 MB). Free memory was 45.9 MB in the beginning and 197.2 MB in the end (delta: -151.3 MB). Peak memory consumption was 84.4 MB. Max. memory is 16.1 GB. * Witness Printer took 314.60 ms. Allocated memory is still 247.5 MB. Free memory was 197.2 MB in the beginning and 155.5 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 411]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND TRUE ((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)) [L388] a21 = 1 [L389] a16 = 6 [L390] a7 = 0 [L391] return -1; VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L411] reach_error() VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 854 SDtfs, 1462 SDslu, 58 SDs, 0 SdLazy, 3755 SolverSat, 690 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 679 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=10, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 786 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2258 NumberOfCodeBlocks, 2258 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1975 ConstructedInterpolants, 0 QuantifiedInterpolants, 4389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1334 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 1417/1479 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-02 23:00:17,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17719a0c-8285-41d6-8bb9-b296c2d6308d/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE