./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label00.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44a6f5da8678f977310f6709279b3ae75b602088 ........................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label00.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44a6f5da8678f977310f6709279b3ae75b602088 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-16 02:56:08,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:56:08,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:56:08,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:56:08,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:56:08,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:56:08,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:56:08,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:56:08,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:56:08,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:56:08,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:56:08,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:56:08,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:56:08,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:56:08,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:56:08,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:56:08,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:56:08,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:56:08,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:56:08,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:56:08,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:56:08,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:56:08,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:56:08,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:56:08,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:56:08,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:56:08,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:56:08,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:56:08,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:56:08,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:56:08,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:56:08,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:56:08,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:56:08,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:56:08,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:56:08,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:56:08,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:56:08,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:56:08,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:56:08,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:56:08,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:56:08,886 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-16 02:56:08,954 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:56:08,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:56:08,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:56:08,961 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:56:08,961 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:56:08,961 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:56:08,962 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 02:56:08,962 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:56:08,970 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:56:08,970 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 02:56:08,972 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 02:56:08,972 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:56:08,973 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 02:56:08,973 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 02:56:08,973 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 02:56:08,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:56:08,974 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:56:08,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:56:08,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:56:08,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:56:08,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 02:56:08,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:56:08,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 02:56:08,977 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:56:08,977 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:56:08,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 02:56:08,977 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:56:08,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 02:56:08,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:56:08,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:56:08,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:56:08,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:56:08,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:56:08,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 02:56:08,983 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 02:56:08,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 02:56:08,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 02:56:08,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:56:08,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:56:08,984 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/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_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs 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 -> Taipan 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 -> 44a6f5da8678f977310f6709279b3ae75b602088 [2021-10-16 02:56:09,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:56:09,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:56:09,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:56:09,353 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:56:09,355 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:56:09,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/eca-rers2012/Problem11_label00.c [2021-10-16 02:56:09,456 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data/9fb6e5b77/81714f3d8a9041e89e71b063f1bdb1cc/FLAGc2eb0bf9e [2021-10-16 02:56:10,216 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:56:10,217 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/sv-benchmarks/c/eca-rers2012/Problem11_label00.c [2021-10-16 02:56:10,248 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data/9fb6e5b77/81714f3d8a9041e89e71b063f1bdb1cc/FLAGc2eb0bf9e [2021-10-16 02:56:10,369 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data/9fb6e5b77/81714f3d8a9041e89e71b063f1bdb1cc [2021-10-16 02:56:10,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:56:10,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:56:10,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:56:10,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:56:10,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:56:10,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:56:10" (1/1) ... [2021-10-16 02:56:10,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1935df08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:10, skipping insertion in model container [2021-10-16 02:56:10,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:56:10" (1/1) ... [2021-10-16 02:56:10,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:56:10,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:56:10,680 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_9b7749fe-36dd-4b98-b392-85a2086d7f4f/sv-benchmarks/c/eca-rers2012/Problem11_label00.c[1022,1035] [2021-10-16 02:56:11,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:56:11,104 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:56:11,118 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_9b7749fe-36dd-4b98-b392-85a2086d7f4f/sv-benchmarks/c/eca-rers2012/Problem11_label00.c[1022,1035] [2021-10-16 02:56:11,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:56:11,457 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:56:11,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11 WrapperNode [2021-10-16 02:56:11,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:56:11,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:56:11,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:56:11,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:56:11,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:56:11,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:56:11,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:56:11,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:56:11,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:56:11,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:56:11,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:56:11,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:56:11,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (1/1) ... [2021-10-16 02:56:11,873 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:56:11,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:56:11,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:56:11,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:56:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 02:56:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:56:11,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:56:11,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:56:37,958 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:56:37,958 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-16 02:56:37,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:56:37 BoogieIcfgContainer [2021-10-16 02:56:37,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:56:37,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:56:37,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:56:37,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:56:37,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:56:10" (1/3) ... [2021-10-16 02:56:37,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628b790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:56:37, skipping insertion in model container [2021-10-16 02:56:37,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:56:11" (2/3) ... [2021-10-16 02:56:37,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628b790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:56:37, skipping insertion in model container [2021-10-16 02:56:37,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:56:37" (3/3) ... [2021-10-16 02:56:37,971 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label00.c [2021-10-16 02:56:37,977 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:56:37,977 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 02:56:38,049 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:56:38,059 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, mConcurrency=FINITE_AUTOMATA, 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-10-16 02:56:38,059 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 02:56:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-10-16 02:56:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-16 02:56:38,086 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:56:38,087 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-16 02:56:38,088 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:56:38,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:56:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1188915214, now seen corresponding path program 1 times [2021-10-16 02:56:38,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:56:38,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096778027] [2021-10-16 02:56:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:56:38,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:56:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:56:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:56:38,393 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:56:38,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096778027] [2021-10-16 02:56:38,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096778027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:56:38,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:56:38,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:56:38,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931542620] [2021-10-16 02:56:38,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:56:38,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:56:38,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:56:38,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:56:38,426 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:56:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:56:38,552 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2021-10-16 02:56:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:56:38,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-16 02:56:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:56:38,566 INFO L225 Difference]: With dead ends: 23 [2021-10-16 02:56:38,567 INFO L226 Difference]: Without dead ends: 11 [2021-10-16 02:56:38,571 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:56:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-10-16 02:56:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2021-10-16 02:56:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-10-16 02:56:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-10-16 02:56:38,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2021-10-16 02:56:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:56:38,611 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-10-16 02:56:38,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:56:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-10-16 02:56:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 02:56:38,613 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:56:38,613 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2021-10-16 02:56:38,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 02:56:38,615 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:56:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:56:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1352541126, now seen corresponding path program 1 times [2021-10-16 02:56:38,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:56:38,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356064719] [2021-10-16 02:56:38,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:56:38,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:56:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:56:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:56:39,304 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:56:39,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356064719] [2021-10-16 02:56:39,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356064719] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:56:39,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781961850] [2021-10-16 02:56:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:56:39,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:56:39,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:56:39,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:56:39,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-16 02:56:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:56:39,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-16 02:56:39,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:56:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:56:44,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:57:51,334 WARN L207 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 4102 DAG size of output: 4100 [2021-10-16 03:02:20,701 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 03:02:20,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [507710000] [2021-10-16 03:02:20,721 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-10-16 03:02:20,721 INFO L166 IcfgInterpreter]: Building call graph [2021-10-16 03:02:20,725 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-16 03:02:20,731 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-16 03:02:20,731 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-16 03:02:20,764 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:20,766 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 03:02:20,767 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:20,768 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-16 03:02:20,769 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 03:02:20,769 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:20,770 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-16 03:02:20,772 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 158 [2021-10-16 03:02:20,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 03:02:20,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 03:02:20,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 03:02:20,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-16 03:02:20,817 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:20,817 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 03:02:20,819 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:20,820 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 03:02:20,820 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-16 03:02:20,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 03:02:20,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:20,841 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 03:02:20,843 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 158 [2021-10-16 03:02:20,843 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-16 03:02:20,844 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:155, output treesize:158 [2021-10-16 03:02:20,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-16 03:02:21,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-10-16 03:02:21,060 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_10| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-16 03:02:21,064 INFO L168 Benchmark]: Toolchain (without parser) took 370689.86 ms. Allocated memory was 94.4 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 56.2 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 16.1 GB. [2021-10-16 03:02:21,064 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 94.4 MB. Free memory was 65.3 MB in the beginning and 65.3 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 03:02:21,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1081.23 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 56.2 MB in the beginning and 83.2 MB in the end (delta: -27.0 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:21,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 198.28 ms. Allocated memory is still 113.2 MB. Free memory was 83.2 MB in the beginning and 65.9 MB in the end (delta: 17.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:21,066 INFO L168 Benchmark]: Boogie Preprocessor took 203.92 ms. Allocated memory is still 113.2 MB. Free memory was 65.9 MB in the beginning and 56.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:21,067 INFO L168 Benchmark]: RCFGBuilder took 26098.88 ms. Allocated memory was 113.2 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 56.3 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 352.1 MB. Max. memory is 16.1 GB. [2021-10-16 03:02:21,067 INFO L168 Benchmark]: TraceAbstraction took 343099.17 ms. Allocated memory was 1.6 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 177.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. [2021-10-16 03:02:21,071 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.29 ms. Allocated memory is still 94.4 MB. Free memory was 65.3 MB in the beginning and 65.3 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1081.23 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 56.2 MB in the beginning and 83.2 MB in the end (delta: -27.0 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 198.28 ms. Allocated memory is still 113.2 MB. Free memory was 83.2 MB in the beginning and 65.9 MB in the end (delta: 17.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 203.92 ms. Allocated memory is still 113.2 MB. Free memory was 65.9 MB in the beginning and 56.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 26098.88 ms. Allocated memory was 113.2 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 56.3 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 352.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 343099.17 ms. Allocated memory was 1.6 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 177.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_10| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_10|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-16 03:02:21,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-5709675 [2021-10-16 03:02:23,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 03:02:23,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 03:02:23,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 03:02:23,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 03:02:23,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 03:02:23,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 03:02:23,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 03:02:23,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 03:02:23,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 03:02:23,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 03:02:23,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 03:02:23,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 03:02:23,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 03:02:23,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 03:02:23,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 03:02:23,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 03:02:23,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 03:02:23,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 03:02:23,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 03:02:23,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 03:02:23,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 03:02:23,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 03:02:23,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 03:02:23,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 03:02:23,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 03:02:23,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 03:02:23,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 03:02:23,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 03:02:23,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 03:02:23,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 03:02:23,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 03:02:23,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 03:02:23,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 03:02:23,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 03:02:23,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 03:02:23,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 03:02:23,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 03:02:23,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 03:02:23,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 03:02:23,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 03:02:23,889 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-16 03:02:23,939 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 03:02:23,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 03:02:23,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 03:02:23,941 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 03:02:23,941 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 03:02:23,941 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 03:02:23,942 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 03:02:23,942 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 03:02:23,942 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 03:02:23,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 03:02:23,945 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 03:02:23,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 03:02:23,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 03:02:23,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 03:02:23,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 03:02:23,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 03:02:23,946 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 03:02:23,947 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-16 03:02:23,947 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-16 03:02:23,947 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 03:02:23,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 03:02:23,948 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 03:02:23,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 03:02:23,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 03:02:23,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-16 03:02:23,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 03:02:23,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 03:02:23,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 03:02:23,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 03:02:23,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 03:02:23,950 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-16 03:02:23,950 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-16 03:02:23,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 03:02:23,950 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 03:02:23,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 03:02:23,951 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/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_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs 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 -> Taipan 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 -> 44a6f5da8678f977310f6709279b3ae75b602088 [2021-10-16 03:02:24,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 03:02:24,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 03:02:24,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 03:02:24,388 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 03:02:24,389 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 03:02:24,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/eca-rers2012/Problem11_label00.c [2021-10-16 03:02:24,469 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data/cba16d1d0/1012cb8357cc4a6e8c785a66b3e1ca6b/FLAGb3bb5bea7 [2021-10-16 03:02:25,199 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 03:02:25,200 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/sv-benchmarks/c/eca-rers2012/Problem11_label00.c [2021-10-16 03:02:25,219 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data/cba16d1d0/1012cb8357cc4a6e8c785a66b3e1ca6b/FLAGb3bb5bea7 [2021-10-16 03:02:25,369 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/data/cba16d1d0/1012cb8357cc4a6e8c785a66b3e1ca6b [2021-10-16 03:02:25,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 03:02:25,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 03:02:25,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 03:02:25,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 03:02:25,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 03:02:25,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:02:25" (1/1) ... [2021-10-16 03:02:25,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b88fc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:25, skipping insertion in model container [2021-10-16 03:02:25,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:02:25" (1/1) ... [2021-10-16 03:02:25,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 03:02:25,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 03:02:25,675 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_9b7749fe-36dd-4b98-b392-85a2086d7f4f/sv-benchmarks/c/eca-rers2012/Problem11_label00.c[1022,1035] [2021-10-16 03:02:26,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 03:02:26,166 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 03:02:26,181 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_9b7749fe-36dd-4b98-b392-85a2086d7f4f/sv-benchmarks/c/eca-rers2012/Problem11_label00.c[1022,1035] [2021-10-16 03:02:26,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 03:02:26,388 INFO L208 MainTranslator]: Completed translation [2021-10-16 03:02:26,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26 WrapperNode [2021-10-16 03:02:26,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 03:02:26,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 03:02:26,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 03:02:26,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 03:02:26,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 03:02:26,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 03:02:26,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 03:02:26,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 03:02:26,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 03:02:26,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 03:02:26,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 03:02:26,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 03:02:26,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (1/1) ... [2021-10-16 03:02:26,710 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 03:02:26,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 03:02:26,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 03:02:26,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 03:02:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-16 03:02:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 03:02:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 03:02:26,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 03:02:35,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 03:02:35,749 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-16 03:02:35,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:02:35 BoogieIcfgContainer [2021-10-16 03:02:35,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 03:02:35,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 03:02:35,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 03:02:35,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 03:02:35,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 03:02:25" (1/3) ... [2021-10-16 03:02:35,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cfe337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:02:35, skipping insertion in model container [2021-10-16 03:02:35,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:02:26" (2/3) ... [2021-10-16 03:02:35,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cfe337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:02:35, skipping insertion in model container [2021-10-16 03:02:35,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:02:35" (3/3) ... [2021-10-16 03:02:35,760 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label00.c [2021-10-16 03:02:35,765 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 03:02:35,766 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 03:02:35,814 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 03:02:35,828 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, mConcurrency=FINITE_AUTOMATA, 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-10-16 03:02:35,830 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 03:02:35,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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-10-16 03:02:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 03:02:35,862 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:02:35,863 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 03:02:35,864 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:02:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:02:35,869 INFO L82 PathProgramCache]: Analyzing trace with hash 889694410, now seen corresponding path program 1 times [2021-10-16 03:02:35,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:02:35,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574022361] [2021-10-16 03:02:35,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:02:35,881 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:02:35,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:02:35,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:02:35,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-16 03:02:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:02:35,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:02:35,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:02:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:02:36,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:02:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:02:36,095 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:02:36,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574022361] [2021-10-16 03:02:36,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574022361] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:02:36,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:02:36,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 03:02:36,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618108949] [2021-10-16 03:02:36,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:02:36,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:02:36,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:02:36,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:02:36,122 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-10-16 03:03:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:02,817 INFO L93 Difference]: Finished difference Result 954 states and 1721 transitions. [2021-10-16 03:03:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:02,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 6 [2021-10-16 03:03:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:02,844 INFO L225 Difference]: With dead ends: 954 [2021-10-16 03:03:02,844 INFO L226 Difference]: Without dead ends: 603 [2021-10-16 03:03:02,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-10-16 03:03:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2021-10-16 03:03:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.420265780730897) internal successors, (855), 602 states have internal predecessors, (855), 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-10-16 03:03:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 855 transitions. [2021-10-16 03:03:02,923 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 855 transitions. Word has length 6 [2021-10-16 03:03:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:02,923 INFO L470 AbstractCegarLoop]: Abstraction has 603 states and 855 transitions. [2021-10-16 03:03:02,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-10-16 03:03:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 855 transitions. [2021-10-16 03:03:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-10-16 03:03:02,927 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:02,927 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-10-16 03:03:02,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-10-16 03:03:03,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:03:03,138 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:03:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1526749426, now seen corresponding path program 1 times [2021-10-16 03:03:03,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:03:03,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855704045] [2021-10-16 03:03:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:03,144 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:03:03,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:03:03,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:03:03,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-16 03:03:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:03,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:03:03,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:03,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:04,072 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:03:04,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855704045] [2021-10-16 03:03:04,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855704045] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:04,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:04,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 03:03:04,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048510091] [2021-10-16 03:03:04,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:04,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:03:04,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:04,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:04,077 INFO L87 Difference]: Start difference. First operand 603 states and 855 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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-10-16 03:03:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:13,927 INFO L93 Difference]: Finished difference Result 1946 states and 2736 transitions. [2021-10-16 03:03:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:13,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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 82 [2021-10-16 03:03:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:13,943 INFO L225 Difference]: With dead ends: 1946 [2021-10-16 03:03:13,944 INFO L226 Difference]: Without dead ends: 1345 [2021-10-16 03:03:13,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2021-10-16 03:03:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1158. [2021-10-16 03:03:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.3068280034572168) internal successors, (1512), 1157 states have internal predecessors, (1512), 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-10-16 03:03:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1512 transitions. [2021-10-16 03:03:13,999 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1512 transitions. Word has length 82 [2021-10-16 03:03:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:14,000 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 1512 transitions. [2021-10-16 03:03:14,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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-10-16 03:03:14,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1512 transitions. [2021-10-16 03:03:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-16 03:03:14,005 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:14,006 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 03:03:14,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-10-16 03:03:14,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:03:14,219 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:03:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1415015051, now seen corresponding path program 1 times [2021-10-16 03:03:14,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:03:14,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125889243] [2021-10-16 03:03:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:14,223 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:03:14,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:03:14,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:03:14,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-16 03:03:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:14,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:03:14,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:14,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:16,440 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:03:16,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125889243] [2021-10-16 03:03:16,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125889243] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:16,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:16,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 03:03:16,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160369609] [2021-10-16 03:03:16,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:16,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:03:16,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:16,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:16,444 INFO L87 Difference]: Start difference. First operand 1158 states and 1512 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 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-10-16 03:03:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:29,774 INFO L93 Difference]: Finished difference Result 4173 states and 5520 transitions. [2021-10-16 03:03:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:29,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 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 96 [2021-10-16 03:03:29,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:29,799 INFO L225 Difference]: With dead ends: 4173 [2021-10-16 03:03:29,799 INFO L226 Difference]: Without dead ends: 3017 [2021-10-16 03:03:29,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2021-10-16 03:03:29,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2815. [2021-10-16 03:03:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2814 states have (on average 1.244491826581379) internal successors, (3502), 2814 states have internal predecessors, (3502), 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-10-16 03:03:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 3502 transitions. [2021-10-16 03:03:29,874 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 3502 transitions. Word has length 96 [2021-10-16 03:03:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:29,875 INFO L470 AbstractCegarLoop]: Abstraction has 2815 states and 3502 transitions. [2021-10-16 03:03:29,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 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-10-16 03:03:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 3502 transitions. [2021-10-16 03:03:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-10-16 03:03:29,880 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:29,881 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-16 03:03:29,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-16 03:03:30,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:03:30,095 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:03:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:30,096 INFO L82 PathProgramCache]: Analyzing trace with hash 843636543, now seen corresponding path program 1 times [2021-10-16 03:03:30,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:03:30,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083915984] [2021-10-16 03:03:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:30,099 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:03:30,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:03:30,118 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:03:30,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-16 03:03:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:30,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:03:30,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:30,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:30,936 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:03:30,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083915984] [2021-10-16 03:03:30,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083915984] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:03:30,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:03:30,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 03:03:30,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101116543] [2021-10-16 03:03:30,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:03:30,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:03:30,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:03:30,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:30,940 INFO L87 Difference]: Start difference. First operand 2815 states and 3502 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-10-16 03:03:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:03:42,378 INFO L93 Difference]: Finished difference Result 6570 states and 8302 transitions. [2021-10-16 03:03:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:03:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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 133 [2021-10-16 03:03:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:03:42,409 INFO L225 Difference]: With dead ends: 6570 [2021-10-16 03:03:42,410 INFO L226 Difference]: Without dead ends: 3941 [2021-10-16 03:03:42,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:03:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2021-10-16 03:03:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3921. [2021-10-16 03:03:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3920 states have (on average 1.2191326530612245) internal successors, (4779), 3920 states have internal predecessors, (4779), 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-10-16 03:03:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 4779 transitions. [2021-10-16 03:03:42,552 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 4779 transitions. Word has length 133 [2021-10-16 03:03:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:03:42,552 INFO L470 AbstractCegarLoop]: Abstraction has 3921 states and 4779 transitions. [2021-10-16 03:03:42,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-10-16 03:03:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 4779 transitions. [2021-10-16 03:03:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-10-16 03:03:42,568 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:03:42,570 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 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] [2021-10-16 03:03:42,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-16 03:03:42,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:03:42,771 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:03:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:03:42,771 INFO L82 PathProgramCache]: Analyzing trace with hash -466582489, now seen corresponding path program 1 times [2021-10-16 03:03:42,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:03:42,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532077495] [2021-10-16 03:03:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:03:42,774 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:03:42,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:03:42,777 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:03:42,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-16 03:03:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:03:43,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-16 03:03:43,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:03:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 7 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:45,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:03:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:03:50,782 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:03:50,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532077495] [2021-10-16 03:03:50,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532077495] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 03:03:50,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 03:03:50,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-16 03:03:50,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835892966] [2021-10-16 03:03:50,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 03:03:50,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:03:50,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 03:03:50,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:03:50,785 INFO L87 Difference]: Start difference. First operand 3921 states and 4779 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-10-16 03:04:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:04:09,168 INFO L93 Difference]: Finished difference Result 7834 states and 9746 transitions. [2021-10-16 03:04:09,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:04:09,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 208 [2021-10-16 03:04:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:04:09,206 INFO L225 Difference]: With dead ends: 7834 [2021-10-16 03:04:09,207 INFO L226 Difference]: Without dead ends: 5025 [2021-10-16 03:04:09,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:04:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2021-10-16 03:04:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 5025. [2021-10-16 03:04:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5025 states, 5024 states have (on average 1.2259156050955413) internal successors, (6159), 5024 states have internal predecessors, (6159), 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-10-16 03:04:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 6159 transitions. [2021-10-16 03:04:09,367 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 6159 transitions. Word has length 208 [2021-10-16 03:04:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:04:09,368 INFO L470 AbstractCegarLoop]: Abstraction has 5025 states and 6159 transitions. [2021-10-16 03:04:09,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-10-16 03:04:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 6159 transitions. [2021-10-16 03:04:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-10-16 03:04:09,373 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:04:09,374 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1] [2021-10-16 03:04:09,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-16 03:04:09,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:04:09,592 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:04:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:04:09,592 INFO L82 PathProgramCache]: Analyzing trace with hash 153241954, now seen corresponding path program 1 times [2021-10-16 03:04:09,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:04:09,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582485763] [2021-10-16 03:04:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:04:09,594 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:04:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:04:09,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:04:09,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-16 03:04:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:04:10,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-16 03:04:10,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:04:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:04:11,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:04:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:04:15,872 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:04:15,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582485763] [2021-10-16 03:04:15,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582485763] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 03:04:15,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 03:04:15,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-10-16 03:04:15,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537704692] [2021-10-16 03:04:15,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:04:15,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:04:15,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:04:15,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-16 03:04:15,878 INFO L87 Difference]: Start difference. First operand 5025 states and 6159 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-10-16 03:05:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:05:10,809 INFO L93 Difference]: Finished difference Result 13556 states and 16715 transitions. [2021-10-16 03:05:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:05:10,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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 220 [2021-10-16 03:05:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:05:10,849 INFO L225 Difference]: With dead ends: 13556 [2021-10-16 03:05:10,849 INFO L226 Difference]: Without dead ends: 8717 [2021-10-16 03:05:10,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 226.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-16 03:05:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8717 states. [2021-10-16 03:05:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8717 to 6864. [2021-10-16 03:05:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6864 states, 6863 states have (on average 1.2176890572635874) internal successors, (8357), 6863 states have internal predecessors, (8357), 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-10-16 03:05:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6864 states to 6864 states and 8357 transitions. [2021-10-16 03:05:11,038 INFO L78 Accepts]: Start accepts. Automaton has 6864 states and 8357 transitions. Word has length 220 [2021-10-16 03:05:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:05:11,039 INFO L470 AbstractCegarLoop]: Abstraction has 6864 states and 8357 transitions. [2021-10-16 03:05:11,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-10-16 03:05:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 6864 states and 8357 transitions. [2021-10-16 03:05:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2021-10-16 03:05:11,045 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:05:11,045 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 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, 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] [2021-10-16 03:05:11,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-16 03:05:11,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:05:11,261 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:05:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:05:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash 596798715, now seen corresponding path program 1 times [2021-10-16 03:05:11,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:05:11,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749397875] [2021-10-16 03:05:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:05:11,263 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:05:11,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:05:11,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:05:11,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-16 03:05:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:05:12,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 03:05:12,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:05:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-10-16 03:05:12,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:05:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-10-16 03:05:12,912 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:05:12,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749397875] [2021-10-16 03:05:12,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749397875] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 03:05:12,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 03:05:12,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 03:05:12,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104036777] [2021-10-16 03:05:12,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 03:05:12,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:05:12,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 03:05:12,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:05:12,916 INFO L87 Difference]: Start difference. First operand 6864 states and 8357 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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-10-16 03:05:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:05:25,868 INFO L93 Difference]: Finished difference Result 17609 states and 21634 transitions. [2021-10-16 03:05:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 03:05:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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 245 [2021-10-16 03:05:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:05:25,925 INFO L225 Difference]: With dead ends: 17609 [2021-10-16 03:05:25,925 INFO L226 Difference]: Without dead ends: 11300 [2021-10-16 03:05:25,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 03:05:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11300 states. [2021-10-16 03:05:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11300 to 7965. [2021-10-16 03:05:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7964 states have (on average 1.1857106981416374) internal successors, (9443), 7964 states have internal predecessors, (9443), 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-10-16 03:05:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 9443 transitions. [2021-10-16 03:05:26,177 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 9443 transitions. Word has length 245 [2021-10-16 03:05:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:05:26,177 INFO L470 AbstractCegarLoop]: Abstraction has 7965 states and 9443 transitions. [2021-10-16 03:05:26,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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-10-16 03:05:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 9443 transitions. [2021-10-16 03:05:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-10-16 03:05:26,186 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:05:26,186 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-16 03:05:26,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-16 03:05:26,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:05:26,400 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:05:26,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:05:26,401 INFO L82 PathProgramCache]: Analyzing trace with hash -518669213, now seen corresponding path program 1 times [2021-10-16 03:05:26,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:05:26,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527706914] [2021-10-16 03:05:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:05:26,404 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:05:26,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:05:26,409 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:05:26,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-16 03:05:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:05:27,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 03:05:27,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:05:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 186 proven. 96 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-16 03:05:28,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:05:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-16 03:05:29,770 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:05:29,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527706914] [2021-10-16 03:05:29,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527706914] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 03:05:29,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 03:05:29,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-16 03:05:29,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359915218] [2021-10-16 03:05:29,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 03:05:29,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:05:29,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 03:05:29,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:05:29,790 INFO L87 Difference]: Start difference. First operand 7965 states and 9443 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-10-16 03:05:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:05:49,054 INFO L93 Difference]: Finished difference Result 17951 states and 21316 transitions. [2021-10-16 03:05:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:05:49,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 305 [2021-10-16 03:05:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:05:49,081 INFO L225 Difference]: With dead ends: 17951 [2021-10-16 03:05:49,082 INFO L226 Difference]: Without dead ends: 10725 [2021-10-16 03:05:49,090 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:05:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10725 states. [2021-10-16 03:05:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10725 to 10357. [2021-10-16 03:05:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10357 states, 10356 states have (on average 1.1707222865971418) internal successors, (12124), 10356 states have internal predecessors, (12124), 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-10-16 03:05:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10357 states to 10357 states and 12124 transitions. [2021-10-16 03:05:49,359 INFO L78 Accepts]: Start accepts. Automaton has 10357 states and 12124 transitions. Word has length 305 [2021-10-16 03:05:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:05:49,360 INFO L470 AbstractCegarLoop]: Abstraction has 10357 states and 12124 transitions. [2021-10-16 03:05:49,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-10-16 03:05:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 10357 states and 12124 transitions. [2021-10-16 03:05:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2021-10-16 03:05:49,372 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:05:49,373 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-16 03:05:49,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-16 03:05:49,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:05:49,594 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:05:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:05:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1568639804, now seen corresponding path program 1 times [2021-10-16 03:05:49,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:05:49,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960473641] [2021-10-16 03:05:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:05:49,597 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:05:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:05:49,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:05:49,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-16 03:05:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:05:50,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-16 03:05:50,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:05:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:05:55,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:07:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 111 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 03:07:15,617 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:07:15,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960473641] [2021-10-16 03:07:15,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960473641] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 03:07:15,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [196653314] [2021-10-16 03:07:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:07:15,618 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 03:07:15,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 03:07:15,620 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 03:07:15,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-10-16 03:07:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:07:18,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-16 03:07:18,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:07:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 11 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-10-16 03:07:20,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:07:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-10-16 03:07:25,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [196653314] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 03:07:25,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-10-16 03:07:25,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5, 3] total 12 [2021-10-16 03:07:25,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801231011] [2021-10-16 03:07:25,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 03:07:25,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:07:25,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 03:07:25,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-10-16 03:07:25,764 INFO L87 Difference]: Start difference. First operand 10357 states and 12124 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-10-16 03:07:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:07:37,799 INFO L93 Difference]: Finished difference Result 19977 states and 23478 transitions. [2021-10-16 03:07:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:07:37,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 315 [2021-10-16 03:07:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:07:37,822 INFO L225 Difference]: With dead ends: 19977 [2021-10-16 03:07:37,823 INFO L226 Difference]: Without dead ends: 11651 [2021-10-16 03:07:37,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1256 GetRequests, 1246 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2953.5ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-10-16 03:07:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11651 states. [2021-10-16 03:07:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11651 to 9805. [2021-10-16 03:07:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9805 states, 9804 states have (on average 1.167482660138719) internal successors, (11446), 9804 states have internal predecessors, (11446), 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-10-16 03:07:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9805 states to 9805 states and 11446 transitions. [2021-10-16 03:07:38,045 INFO L78 Accepts]: Start accepts. Automaton has 9805 states and 11446 transitions. Word has length 315 [2021-10-16 03:07:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:07:38,046 INFO L470 AbstractCegarLoop]: Abstraction has 9805 states and 11446 transitions. [2021-10-16 03:07:38,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-10-16 03:07:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 9805 states and 11446 transitions. [2021-10-16 03:07:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-10-16 03:07:38,104 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:07:38,104 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-16 03:07:38,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-10-16 03:07:38,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-16 03:07:38,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:07:38,516 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:07:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:07:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1550158746, now seen corresponding path program 1 times [2021-10-16 03:07:38,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:07:38,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690697750] [2021-10-16 03:07:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:07:38,520 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:07:38,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:07:38,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:07:38,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-16 03:07:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:07:40,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 03:07:40,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:07:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 186 proven. 97 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-16 03:07:41,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:07:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-16 03:07:42,956 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:07:42,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690697750] [2021-10-16 03:07:42,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690697750] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 03:07:42,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 03:07:42,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-16 03:07:42,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960227461] [2021-10-16 03:07:42,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 03:07:42,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:07:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 03:07:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:07:42,959 INFO L87 Difference]: Start difference. First operand 9805 states and 11446 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-10-16 03:08:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:08:05,362 INFO L93 Difference]: Finished difference Result 19055 states and 22307 transitions. [2021-10-16 03:08:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:08:05,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 321 [2021-10-16 03:08:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:08:05,384 INFO L225 Difference]: With dead ends: 19055 [2021-10-16 03:08:05,384 INFO L226 Difference]: Without dead ends: 10173 [2021-10-16 03:08:05,393 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.7ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:08:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10173 states. [2021-10-16 03:08:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10173 to 10173. [2021-10-16 03:08:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10173 states, 10172 states have (on average 1.1513959889893826) internal successors, (11712), 10172 states have internal predecessors, (11712), 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-10-16 03:08:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10173 states to 10173 states and 11712 transitions. [2021-10-16 03:08:05,623 INFO L78 Accepts]: Start accepts. Automaton has 10173 states and 11712 transitions. Word has length 321 [2021-10-16 03:08:05,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:08:05,624 INFO L470 AbstractCegarLoop]: Abstraction has 10173 states and 11712 transitions. [2021-10-16 03:08:05,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-10-16 03:08:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 10173 states and 11712 transitions. [2021-10-16 03:08:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2021-10-16 03:08:05,696 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:08:05,697 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-16 03:08:05,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-16 03:08:05,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:08:05,912 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:08:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:08:05,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1047026659, now seen corresponding path program 1 times [2021-10-16 03:08:05,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:08:05,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682386882] [2021-10-16 03:08:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:08:05,915 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:08:05,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:08:05,916 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:08:05,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-16 03:08:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 03:08:08,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 03:08:08,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 03:08:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 351 proven. 78 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-10-16 03:08:09,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 03:08:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-10-16 03:08:11,601 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 03:08:11,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682386882] [2021-10-16 03:08:11,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682386882] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 03:08:11,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 03:08:11,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-16 03:08:11,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321777146] [2021-10-16 03:08:11,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 03:08:11,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 03:08:11,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 03:08:11,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:08:11,604 INFO L87 Difference]: Start difference. First operand 10173 states and 11712 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-10-16 03:08:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 03:08:54,023 INFO L93 Difference]: Finished difference Result 20898 states and 24038 transitions. [2021-10-16 03:08:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 03:08:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 400 [2021-10-16 03:08:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 03:08:54,040 INFO L225 Difference]: With dead ends: 20898 [2021-10-16 03:08:54,041 INFO L226 Difference]: Without dead ends: 11648 [2021-10-16 03:08:54,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 03:08:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11648 states. [2021-10-16 03:08:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11648 to 11277. [2021-10-16 03:08:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11277 states, 11276 states have (on average 1.1413621851720468) internal successors, (12870), 11276 states have internal predecessors, (12870), 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-10-16 03:08:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11277 states to 11277 states and 12870 transitions. [2021-10-16 03:08:54,335 INFO L78 Accepts]: Start accepts. Automaton has 11277 states and 12870 transitions. Word has length 400 [2021-10-16 03:08:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 03:08:54,336 INFO L470 AbstractCegarLoop]: Abstraction has 11277 states and 12870 transitions. [2021-10-16 03:08:54,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-10-16 03:08:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 11277 states and 12870 transitions. [2021-10-16 03:08:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2021-10-16 03:08:54,351 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 03:08:54,352 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 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, 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] [2021-10-16 03:08:54,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-16 03:08:54,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:08:54,577 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 03:08:54,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 03:08:54,577 INFO L82 PathProgramCache]: Analyzing trace with hash -750930192, now seen corresponding path program 1 times [2021-10-16 03:08:54,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 03:08:54,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352827420] [2021-10-16 03:08:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 03:08:54,581 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 03:08:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 03:08:54,582 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 03:08:54,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-16 03:08:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 03:08:56,924 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-16 03:08:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 03:08:57,607 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-10-16 03:08:57,607 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-16 03:08:57,608 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-16 03:08:57,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-16 03:08:57,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 03:08:57,820 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 03:08:58,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 03:08:58 BoogieIcfgContainer [2021-10-16 03:08:58,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 03:08:58,131 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 03:08:58,131 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 03:08:58,131 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 03:08:58,132 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:02:35" (3/4) ... [2021-10-16 03:08:58,134 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-16 03:08:58,575 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/witness.graphml [2021-10-16 03:08:58,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 03:08:58,577 INFO L168 Benchmark]: Toolchain (without parser) took 393198.85 ms. Allocated memory was 56.6 MB in the beginning and 207.6 MB in the end (delta: 151.0 MB). Free memory was 31.3 MB in the beginning and 47.5 MB in the end (delta: -16.3 MB). Peak memory consumption was 147.7 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:58,578 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 56.6 MB. Free memory is still 37.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 03:08:58,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1008.56 ms. Allocated memory was 56.6 MB in the beginning and 79.7 MB in the end (delta: 23.1 MB). Free memory was 31.1 MB in the beginning and 51.5 MB in the end (delta: -20.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:58,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.28 ms. Allocated memory is still 79.7 MB. Free memory was 51.5 MB in the beginning and 42.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:58,580 INFO L168 Benchmark]: Boogie Preprocessor took 136.95 ms. Allocated memory is still 79.7 MB. Free memory was 42.7 MB in the beginning and 36.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:58,580 INFO L168 Benchmark]: RCFGBuilder took 9051.59 ms. Allocated memory was 79.7 MB in the beginning and 117.4 MB in the end (delta: 37.7 MB). Free memory was 35.7 MB in the beginning and 72.5 MB in the end (delta: -36.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:58,581 INFO L168 Benchmark]: TraceAbstraction took 382376.35 ms. Allocated memory was 117.4 MB in the beginning and 207.6 MB in the end (delta: 90.2 MB). Free memory was 71.7 MB in the beginning and 54.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 129.0 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:58,581 INFO L168 Benchmark]: Witness Printer took 444.38 ms. Allocated memory is still 207.6 MB. Free memory was 54.1 MB in the beginning and 47.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 16.1 GB. [2021-10-16 03:08:58,584 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.29 ms. Allocated memory is still 56.6 MB. Free memory is still 37.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1008.56 ms. Allocated memory was 56.6 MB in the beginning and 79.7 MB in the end (delta: 23.1 MB). Free memory was 31.1 MB in the beginning and 51.5 MB in the end (delta: -20.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 171.28 ms. Allocated memory is still 79.7 MB. Free memory was 51.5 MB in the beginning and 42.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 136.95 ms. Allocated memory is still 79.7 MB. Free memory was 42.7 MB in the beginning and 36.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9051.59 ms. Allocated memory was 79.7 MB in the beginning and 117.4 MB in the end (delta: 37.7 MB). Free memory was 35.7 MB in the beginning and 72.5 MB in the end (delta: -36.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 382376.35 ms. Allocated memory was 117.4 MB in the beginning and 207.6 MB in the end (delta: 90.2 MB). Free memory was 71.7 MB in the beginning and 54.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 129.0 MB. Max. memory is 16.1 GB. * Witness Printer took 444.38 ms. Allocated memory is still 207.6 MB. Free memory was 54.1 MB in the beginning and 47.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 18.4 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 34]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputA = 1; [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputF = 6; [L22] int inputC = 3; [L25] int a29 = 130; [L26] int a4 = 1; [L27] int a23 = 312; [L28] int a8 = 15; [L29] int a25 = 10; [L30] int a3 = 1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1041] int output = -1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L790] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L802] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L809] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L826] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L832] COND FALSE !(( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a8==15) && ((((a3==1) && ((((a25==10) || (a25==11)) && (input == 6)) && a29 <= 140 )) && a23 <= -43 ) && !(a4==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((a8==15) && (((a25==13) || ((a25==11) || (a25==12))) && (input == 4))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L846] COND FALSE !((((a3==1) && ((a8==15) && ((((a25==13) && (input == 4)) && (a4==1)) && a29 <= 140 ))) && 306 < a23 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L851] COND FALSE !((( 306 < a23 && ((a25==13) && ((((input == 3) && a29 <= 140 ) && (a3==1)) && (a4==1)))) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L856] COND FALSE !((!(a4==1) && (( 277 < a29 && ((((input == 4) && a23 <= -43 ) && (a8==15)) && (a3==1))) && (a25==13)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L862] COND FALSE !(((a3==1) && (((((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ) || (( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==12))) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13))))) && (input == 1)) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !(( 277 < a29 && ((a3==1) && ((a8==15) && ((a4==1) && ( 306 < a23 && ((input == 6) && (((a25==9) || (a25==10)) || (a25==11))))))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 4) && ((a25==12) || ((a25==10) || (a25==11))))) && (a8==15)) && !(a4==1)) && (a3==1)) && a29 <= 140 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L886] COND FALSE !(((((( a23 <= -43 && ((input == 5) && ((a25==12) || ((a25==10) || (a25==11))))) && (a3==1)) && !(a4==1)) && 277 < a29 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L891] COND FALSE !(((((a8==15) && ((a4==1) && (((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 2)))) && (a3==1)) && 306 < a23 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L896] COND FALSE !((( a23 <= -43 && ((( ((140 < a29) && (245 >= a29)) && ((input == 1) && (((a25==9) || (a25==10)) || (a25==11)))) && !(a4==1)) && (a8==15))) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L903] COND TRUE ((((a3==1) && ((((input == 2) && ((a25==12) || ((a25==10) || (a25==11)))) && (a4==1)) && (a8==15))) && a29 <= 140 ) && 306 < a23 ) [L905] a25 = 13 [L907] return 23; VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L790] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L802] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L809] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L826] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L832] COND TRUE ( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15))) [L833] a29 = (((a29 / 5) + 165004) + 41645) [L834] return 23; VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND TRUE ((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15)) [L369] a29 = (((a29 / 5) + -137957) * 2) [L370] a23 = ((((a23 - 0) / 5) / 5) + -127612) [L371] a4 = 1 [L372] a25 = 10 [L374] return -1; VAL [a23=4294839696, a25=10, a29=4294774052, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L33] COND TRUE ((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15)) VAL [a23=4294839696, a25=10, a29=4294774052, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] reach_error() VAL [a23=4294839696, a25=10, a29=4294774052, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 382003.5ms, OverallIterations: 12, TraceHistogramMax: 5, EmptinessCheckTime: 211.1ms, AutomataDifference: 244122.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1736 SDtfs, 3303 SDslu, 308 SDs, 0 SdLazy, 8526 SolverSat, 2041 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 223132.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5268 GetRequests, 5231 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3389.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11277occurred in iteration=11, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1899.3ms AutomataMinimizationTime, 11 MinimizatonAttempts, 8182 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 268.1ms SsaConstructionTime, 2634.2ms SatisfiabilityAnalysisTime, 117828.6ms InterpolantComputationTime, 3064 NumberOfCodeBlocks, 3064 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 5268 ConstructedInterpolants, 0 QuantifiedInterpolants, 27499 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3398 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 24 InterpolantComputations, 16 PerfectInterpolantSequences, 2883/3976 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-10-16 03:08:58,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7749fe-36dd-4b98-b392-85a2086d7f4f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...