./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label24.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_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/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_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/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_0d070ca7-7d88-4056-acaa-de9a388a311f/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 1991f97c0e13e11e03c57b4ec7e6a3ced4522e46 ....................................................................................................................................................................................................................................................................................................................................................... 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_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/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_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/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_0d070ca7-7d88-4056-acaa-de9a388a311f/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 1991f97c0e13e11e03c57b4ec7e6a3ced4522e46 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:34:54,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:34:54,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:34:54,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:34:54,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:34:54,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:34:54,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:34:54,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:34:54,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:34:54,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:34:54,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:34:54,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:34:54,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:34:54,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:34:54,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:34:54,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:34:54,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:34:54,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:34:54,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:34:54,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:34:54,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:34:54,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:34:54,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:34:54,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:34:54,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:34:54,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:34:54,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:34:54,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:34:54,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:34:54,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:34:54,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:34:54,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:34:54,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:34:54,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:34:54,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:34:54,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:34:54,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:34:54,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:34:54,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:34:54,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:34:54,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:34:54,647 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-16 02:34:54,674 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:34:54,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:34:54,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:34:54,676 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:34:54,676 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:34:54,676 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:34:54,676 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 02:34:54,677 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:34:54,677 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:34:54,677 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 02:34:54,677 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 02:34:54,678 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:34:54,678 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 02:34:54,678 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 02:34:54,678 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 02:34:54,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:34:54,680 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:34:54,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:34:54,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:34:54,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:34:54,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 02:34:54,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:34:54,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 02:34:54,681 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:34:54,682 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:34:54,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 02:34:54,682 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:34:54,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 02:34:54,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:34:54,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:34:54,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:34:54,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:34:54,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:34:54,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 02:34:54,684 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 02:34:54,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 02:34:54,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 02:34:54,685 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:34:54,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:34:54,685 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_0d070ca7-7d88-4056-acaa-de9a388a311f/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_0d070ca7-7d88-4056-acaa-de9a388a311f/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 -> 1991f97c0e13e11e03c57b4ec7e6a3ced4522e46 [2021-10-16 02:34:55,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:34:55,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:34:55,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:34:55,046 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:34:55,047 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:34:55,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c [2021-10-16 02:34:55,127 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data/c6f883107/99ae9cd2554848558d4f7b29a141461d/FLAG18e239ab3 [2021-10-16 02:34:55,869 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:34:55,870 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/sv-benchmarks/c/eca-rers2012/Problem10_label24.c [2021-10-16 02:34:55,888 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data/c6f883107/99ae9cd2554848558d4f7b29a141461d/FLAG18e239ab3 [2021-10-16 02:34:55,902 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data/c6f883107/99ae9cd2554848558d4f7b29a141461d [2021-10-16 02:34:55,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:34:55,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:34:55,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:34:55,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:34:55,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:34:55,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:34:55" (1/1) ... [2021-10-16 02:34:55,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126ed87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:55, skipping insertion in model container [2021-10-16 02:34:55,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:34:55" (1/1) ... [2021-10-16 02:34:55,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:34:55,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:34:56,214 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_0d070ca7-7d88-4056-acaa-de9a388a311f/sv-benchmarks/c/eca-rers2012/Problem10_label24.c[1861,1874] [2021-10-16 02:34:56,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:34:56,412 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:34:56,430 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_0d070ca7-7d88-4056-acaa-de9a388a311f/sv-benchmarks/c/eca-rers2012/Problem10_label24.c[1861,1874] [2021-10-16 02:34:56,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:34:56,573 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:34:56,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56 WrapperNode [2021-10-16 02:34:56,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:34:56,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:34:56,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:34:56,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:34:56,596 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:34:56" (1/1) ... [2021-10-16 02:34:56,623 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:34:56" (1/1) ... [2021-10-16 02:34:56,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:34:56,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:34:56,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:34:56,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:34:56,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56" (1/1) ... [2021-10-16 02:34:56,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56" (1/1) ... [2021-10-16 02:34:56,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56" (1/1) ... [2021-10-16 02:34:56,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56" (1/1) ... [2021-10-16 02:34:56,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56" (1/1) ... [2021-10-16 02:34:56,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56" (1/1) ... [2021-10-16 02:34:56,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56" (1/1) ... [2021-10-16 02:34:56,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:34:56,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:34:56,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:34:56,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:34:56,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56" (1/1) ... [2021-10-16 02:34:56,853 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:34:56,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:34:56,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:34:56,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:34:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 02:34:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:34:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:34:56,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:35:06,618 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:35:06,619 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-16 02:35:06,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:35:06 BoogieIcfgContainer [2021-10-16 02:35:06,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:35:06,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:35:06,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:35:06,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:35:06,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:34:55" (1/3) ... [2021-10-16 02:35:06,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074a7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:35:06, skipping insertion in model container [2021-10-16 02:35:06,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:56" (2/3) ... [2021-10-16 02:35:06,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074a7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:35:06, skipping insertion in model container [2021-10-16 02:35:06,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:35:06" (3/3) ... [2021-10-16 02:35:06,631 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label24.c [2021-10-16 02:35:06,637 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:35:06,637 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 02:35:06,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:35:06,699 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:35:06,699 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 02:35:06,715 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:35:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-16 02:35:06,720 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:35:06,721 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-16 02:35:06,722 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:35:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:35:06,728 INFO L82 PathProgramCache]: Analyzing trace with hash 885161499, now seen corresponding path program 1 times [2021-10-16 02:35:06,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:35:06,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827807710] [2021-10-16 02:35:06,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:35:06,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:35:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:35:06,960 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:35:06,961 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:35:06,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827807710] [2021-10-16 02:35:06,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827807710] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:35:06,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:35:06,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:35:06,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830484184] [2021-10-16 02:35:06,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:35:06,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:35:06,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:35:06,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:35:06,994 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:35:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:35:07,066 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2021-10-16 02:35:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:35:07,068 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:35:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:35:07,076 INFO L225 Difference]: With dead ends: 23 [2021-10-16 02:35:07,076 INFO L226 Difference]: Without dead ends: 11 [2021-10-16 02:35:07,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:35:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-10-16 02:35:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2021-10-16 02:35:07,107 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:35:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-10-16 02:35:07,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2021-10-16 02:35:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:35:07,109 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-10-16 02:35:07,110 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:35:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-10-16 02:35:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-16 02:35:07,110 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:35:07,111 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2021-10-16 02:35:07,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 02:35:07,111 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:35:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:35:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1004996995, now seen corresponding path program 1 times [2021-10-16 02:35:07,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:35:07,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38347598] [2021-10-16 02:35:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:35:07,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:35:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:35:07,660 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:35:07,660 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:35:07,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38347598] [2021-10-16 02:35:07,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38347598] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:35:07,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124567441] [2021-10-16 02:35:07,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:35:07,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:35:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:35:07,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:35:07,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-16 02:35:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:35:07,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-16 02:35:07,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:35:23,783 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:35:23,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:35:40,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-16 02:35:40,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [479884764] [2021-10-16 02:35:40,686 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-10-16 02:35:40,686 INFO L166 IcfgInterpreter]: Building call graph [2021-10-16 02:35:40,692 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-16 02:35:40,699 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-16 02:35:40,700 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-16 02:35:40,746 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:35:40,748 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:35:40,749 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:35:40,751 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-16 02:35:40,752 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-16 02:35:40,752 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:35:40,753 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-16 02:35:40,755 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-10-16 02:35:40,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:35:40,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:35:40,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-16 02:35:40,812 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 02:35:40,813 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:35:40,814 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 02:35:40,816 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:35:40,819 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-16 02:35:40,820 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-16 02:35:40,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:35:40,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:35:40,874 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-16 02:35:40,880 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-10-16 02:35:40,881 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-16 02:35:40,881 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:149, output treesize:152 [2021-10-16 02:35:40,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:35:41,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-10-16 02:35:41,098 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 02:35:41,102 INFO L168 Benchmark]: Toolchain (without parser) took 45189.13 ms. Allocated memory was 96.5 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 56.6 MB in the beginning and 818.0 MB in the end (delta: -761.3 MB). Peak memory consumption was 293.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:35:41,103 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 96.5 MB. Free memory is still 75.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:35:41,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.85 ms. Allocated memory is still 96.5 MB. Free memory was 56.5 MB in the beginning and 53.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-16 02:35:41,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.52 ms. Allocated memory is still 96.5 MB. Free memory was 53.6 MB in the beginning and 45.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-16 02:35:41,105 INFO L168 Benchmark]: Boogie Preprocessor took 139.09 ms. Allocated memory is still 96.5 MB. Free memory was 45.6 MB in the beginning and 40.5 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:35:41,106 INFO L168 Benchmark]: RCFGBuilder took 9781.42 ms. Allocated memory was 96.5 MB in the beginning and 308.3 MB in the end (delta: 211.8 MB). Free memory was 40.5 MB in the beginning and 214.7 MB in the end (delta: -174.2 MB). Peak memory consumption was 166.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:35:41,106 INFO L168 Benchmark]: TraceAbstraction took 34477.63 ms. Allocated memory was 308.3 MB in the beginning and 1.2 GB in the end (delta: 845.2 MB). Free memory was 213.7 MB in the beginning and 818.0 MB in the end (delta: -604.2 MB). Peak memory consumption was 240.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:35:41,110 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.89 ms. Allocated memory is still 96.5 MB. Free memory is still 75.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 669.85 ms. Allocated memory is still 96.5 MB. Free memory was 56.5 MB in the beginning and 53.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 112.52 ms. Allocated memory is still 96.5 MB. Free memory was 53.6 MB in the beginning and 45.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 139.09 ms. Allocated memory is still 96.5 MB. Free memory was 45.6 MB in the beginning and 40.5 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9781.42 ms. Allocated memory was 96.5 MB in the beginning and 308.3 MB in the end (delta: 211.8 MB). Free memory was 40.5 MB in the beginning and 214.7 MB in the end (delta: -174.2 MB). Peak memory consumption was 166.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 34477.63 ms. Allocated memory was 308.3 MB in the beginning and 1.2 GB in the end (delta: 845.2 MB). Free memory was 213.7 MB in the beginning and 818.0 MB in the end (delta: -604.2 MB). Peak memory consumption was 240.9 MB. 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 02:35:41,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-5709675 [2021-10-16 02:35:43,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:35:43,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:35:43,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:35:43,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:35:43,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:35:43,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:35:43,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:35:44,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:35:44,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:35:44,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:35:44,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:35:44,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:35:44,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:35:44,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:35:44,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:35:44,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:35:44,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:35:44,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:35:44,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:35:44,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:35:44,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:35:44,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:35:44,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:35:44,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:35:44,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:35:44,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:35:44,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:35:44,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:35:44,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:35:44,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:35:44,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:35:44,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:35:44,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:35:44,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:35:44,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:35:44,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:35:44,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:35:44,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:35:44,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:35:44,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:35:44,090 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-16 02:35:44,143 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:35:44,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:35:44,145 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:35:44,146 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:35:44,146 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:35:44,146 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:35:44,146 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:35:44,146 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:35:44,147 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:35:44,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:35:44,150 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:35:44,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:35:44,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:35:44,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 02:35:44,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:35:44,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 02:35:44,151 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:35:44,151 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-16 02:35:44,151 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-16 02:35:44,152 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:35:44,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 02:35:44,152 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:35:44,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 02:35:44,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:35:44,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-16 02:35:44,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:35:44,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:35:44,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:35:44,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:35:44,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 02:35:44,154 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-16 02:35:44,154 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-16 02:35:44,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 02:35:44,155 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:35:44,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:35:44,156 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_0d070ca7-7d88-4056-acaa-de9a388a311f/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_0d070ca7-7d88-4056-acaa-de9a388a311f/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 -> 1991f97c0e13e11e03c57b4ec7e6a3ced4522e46 [2021-10-16 02:35:44,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:35:44,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:35:44,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:35:44,665 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:35:44,666 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:35:44,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c [2021-10-16 02:35:44,744 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data/06ad044c1/3c8113c278d241e2a621fd83d9724a13/FLAG0b5b38852 [2021-10-16 02:35:45,507 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:35:45,508 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/sv-benchmarks/c/eca-rers2012/Problem10_label24.c [2021-10-16 02:35:45,534 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data/06ad044c1/3c8113c278d241e2a621fd83d9724a13/FLAG0b5b38852 [2021-10-16 02:35:45,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/data/06ad044c1/3c8113c278d241e2a621fd83d9724a13 [2021-10-16 02:35:45,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:35:45,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:35:45,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:35:45,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:35:45,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:35:45,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:35:45" (1/1) ... [2021-10-16 02:35:45,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37aeabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:45, skipping insertion in model container [2021-10-16 02:35:45,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:35:45" (1/1) ... [2021-10-16 02:35:45,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:35:45,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:35:45,988 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_0d070ca7-7d88-4056-acaa-de9a388a311f/sv-benchmarks/c/eca-rers2012/Problem10_label24.c[1861,1874] [2021-10-16 02:35:46,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:35:46,283 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:35:46,316 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_0d070ca7-7d88-4056-acaa-de9a388a311f/sv-benchmarks/c/eca-rers2012/Problem10_label24.c[1861,1874] [2021-10-16 02:35:46,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:35:46,507 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:35:46,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46 WrapperNode [2021-10-16 02:35:46,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:35:46,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:35:46,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:35:46,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:35:46,518 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:35:46" (1/1) ... [2021-10-16 02:35:46,553 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:35:46" (1/1) ... [2021-10-16 02:35:46,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:35:46,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:35:46,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:35:46,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:35:46,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46" (1/1) ... [2021-10-16 02:35:46,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46" (1/1) ... [2021-10-16 02:35:46,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46" (1/1) ... [2021-10-16 02:35:46,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46" (1/1) ... [2021-10-16 02:35:46,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46" (1/1) ... [2021-10-16 02:35:46,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46" (1/1) ... [2021-10-16 02:35:46,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46" (1/1) ... [2021-10-16 02:35:46,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:35:46,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:35:46,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:35:46,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:35:46,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46" (1/1) ... [2021-10-16 02:35:46,775 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:35:46,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:35:46,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:35:46,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:35:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-16 02:35:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:35:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:35:46,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:35:50,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:35:50,548 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-16 02:35:50,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:35:50 BoogieIcfgContainer [2021-10-16 02:35:50,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:35:50,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:35:50,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:35:50,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:35:50,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:35:45" (1/3) ... [2021-10-16 02:35:50,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8ca941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:35:50, skipping insertion in model container [2021-10-16 02:35:50,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:35:46" (2/3) ... [2021-10-16 02:35:50,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8ca941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:35:50, skipping insertion in model container [2021-10-16 02:35:50,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:35:50" (3/3) ... [2021-10-16 02:35:50,567 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label24.c [2021-10-16 02:35:50,572 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:35:50,572 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 02:35:50,645 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:35:50,652 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:35:50,653 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 02:35:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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:35:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-16 02:35:50,685 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:35:50,686 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:35:50,686 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:35:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:35:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1414013846, now seen corresponding path program 1 times [2021-10-16 02:35:50,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:35:50,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142847695] [2021-10-16 02:35:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:35:50,711 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:35:50,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:35:50,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:35:50,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-16 02:35:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:35:50,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:35:50,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:35:50,953 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:35:50,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:35:51,032 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:35:51,033 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:35:51,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142847695] [2021-10-16 02:35:51,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142847695] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:35:51,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:35:51,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:35:51,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789928392] [2021-10-16 02:35:51,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:35:51,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:35:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:35:51,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:35:51,069 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:35:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:35:56,531 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2021-10-16 02:35:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:35:56,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 14 [2021-10-16 02:35:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:35:56,550 INFO L225 Difference]: With dead ends: 694 [2021-10-16 02:35:56,550 INFO L226 Difference]: Without dead ends: 421 [2021-10-16 02:35:56,555 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:35:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-10-16 02:35:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-10-16 02:35:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3476190476190477) internal successors, (566), 420 states have internal predecessors, (566), 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:35:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 566 transitions. [2021-10-16 02:35:56,627 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 566 transitions. Word has length 14 [2021-10-16 02:35:56,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:35:56,628 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 566 transitions. [2021-10-16 02:35:56,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:35:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 566 transitions. [2021-10-16 02:35:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-16 02:35:56,633 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:35:56,633 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:35:56,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:35:56,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:35:56,838 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:35:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:35:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2122890084, now seen corresponding path program 1 times [2021-10-16 02:35:56,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:35:56,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590028150] [2021-10-16 02:35:56,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:35:56,842 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:35:56,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:35:56,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:35:56,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-16 02:35:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:35:56,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:35:56,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:35:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:35:57,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:36:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:36:00,534 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:36:00,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590028150] [2021-10-16 02:36:00,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590028150] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 02:36:00,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:36:00,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-16 02:36:00,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114304542] [2021-10-16 02:36:00,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:36:00,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:36:00,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:36:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:36:00,539 INFO L87 Difference]: Start difference. First operand 421 states and 566 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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:36:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:36:42,444 INFO L93 Difference]: Finished difference Result 1535 states and 2041 transitions. [2021-10-16 02:36:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:36:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2021-10-16 02:36:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:36:42,457 INFO L225 Difference]: With dead ends: 1535 [2021-10-16 02:36:42,457 INFO L226 Difference]: Without dead ends: 1116 [2021-10-16 02:36:42,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 165.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:36:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2021-10-16 02:36:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2021-10-16 02:36:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3186475409836065) internal successors, (1287), 976 states have internal predecessors, (1287), 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:36:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1287 transitions. [2021-10-16 02:36:42,530 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1287 transitions. Word has length 89 [2021-10-16 02:36:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:36:42,531 INFO L470 AbstractCegarLoop]: Abstraction has 977 states and 1287 transitions. [2021-10-16 02:36:42,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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:36:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1287 transitions. [2021-10-16 02:36:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-16 02:36:42,542 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:36:42,542 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:36:42,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-16 02:36:42,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:36:42,756 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:36:42,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:36:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1021495836, now seen corresponding path program 1 times [2021-10-16 02:36:42,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:36:42,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463996111] [2021-10-16 02:36:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:36:42,760 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:36:42,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:36:42,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:36:42,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-16 02:36:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:36:43,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:36:43,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:36:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:36:43,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:36:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:36:44,252 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:36:44,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463996111] [2021-10-16 02:36:44,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463996111] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:36:44,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:36:44,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-16 02:36:44,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384823016] [2021-10-16 02:36:44,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:36:44,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:36:44,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:36:44,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:36:44,256 INFO L87 Difference]: Start difference. First operand 977 states and 1287 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:36:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:36:48,566 INFO L93 Difference]: Finished difference Result 2647 states and 3497 transitions. [2021-10-16 02:36:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:36:48,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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 158 [2021-10-16 02:36:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:36:48,580 INFO L225 Difference]: With dead ends: 2647 [2021-10-16 02:36:48,581 INFO L226 Difference]: Without dead ends: 1672 [2021-10-16 02:36:48,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:36:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2021-10-16 02:36:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2021-10-16 02:36:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.2309994015559544) internal successors, (2057), 1671 states have internal predecessors, (2057), 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:36:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2057 transitions. [2021-10-16 02:36:48,641 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2057 transitions. Word has length 158 [2021-10-16 02:36:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:36:48,642 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 2057 transitions. [2021-10-16 02:36:48,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:36:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2057 transitions. [2021-10-16 02:36:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-10-16 02:36:48,650 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:36:48,651 INFO L512 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:36:48,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-16 02:36:48,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:36:48,872 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:36:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:36:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash 874137630, now seen corresponding path program 1 times [2021-10-16 02:36:48,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:36:48,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450389848] [2021-10-16 02:36:48,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:36:48,880 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:36:48,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:36:48,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:36:48,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-16 02:36:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:36:49,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:36:49,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:36:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:36:50,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:36:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:36:53,015 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:36:53,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450389848] [2021-10-16 02:36:53,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450389848] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:36:53,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:36:53,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:36:53,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378418767] [2021-10-16 02:36:53,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:36:53,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:36:53,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:36:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:36:53,019 INFO L87 Difference]: Start difference. First operand 1672 states and 2057 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 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:37:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:37:01,825 INFO L93 Difference]: Finished difference Result 3898 states and 4789 transitions. [2021-10-16 02:37:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:37:01,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 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 175 [2021-10-16 02:37:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:37:01,840 INFO L225 Difference]: With dead ends: 3898 [2021-10-16 02:37:01,841 INFO L226 Difference]: Without dead ends: 2228 [2021-10-16 02:37:01,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:37:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2021-10-16 02:37:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2228. [2021-10-16 02:37:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2227 states have (on average 1.2029636281993714) internal successors, (2679), 2227 states have internal predecessors, (2679), 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:37:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2679 transitions. [2021-10-16 02:37:01,919 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2679 transitions. Word has length 175 [2021-10-16 02:37:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:37:01,920 INFO L470 AbstractCegarLoop]: Abstraction has 2228 states and 2679 transitions. [2021-10-16 02:37:01,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 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:37:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2679 transitions. [2021-10-16 02:37:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-16 02:37:01,924 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:37:01,925 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:37:01,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-16 02:37:02,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:37:02,143 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:37:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:37:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1151166636, now seen corresponding path program 1 times [2021-10-16 02:37:02,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:37:02,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191859356] [2021-10-16 02:37:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:37:02,145 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:37:02,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:37:02,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:37:02,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-16 02:37:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:37:02,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-16 02:37:02,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:37:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 23 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:37:04,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:37:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 41 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:37:10,407 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:37:10,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191859356] [2021-10-16 02:37:10,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191859356] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:37:10,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [69290702] [2021-10-16 02:37:10,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:37:10,408 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 02:37:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 02:37:10,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 02:37:10,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-10-16 02:37:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:37:11,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-16 02:37:11,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:37:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 85 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:37:14,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:37:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 85 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:37:17,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [69290702] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:37:17,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654898844] [2021-10-16 02:37:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:37:17,110 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:37:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:37:17,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:37:17,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-16 02:37:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:37:18,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-16 02:37:18,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:37:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 13 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:37:20,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:37:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 13 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:37:21,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654898844] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:37:21,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-16 02:37:21,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7, 7, 5, 5] total 19 [2021-10-16 02:37:21,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659514264] [2021-10-16 02:37:21,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-16 02:37:21,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:37:21,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-16 02:37:21,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2021-10-16 02:37:21,722 INFO L87 Difference]: Start difference. First operand 2228 states and 2679 transitions. Second operand has 19 states, 19 states have (on average 35.10526315789474) internal successors, (667), 19 states have internal predecessors, (667), 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:38:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:38:36,566 INFO L93 Difference]: Finished difference Result 5618 states and 6731 transitions. [2021-10-16 02:38:36,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-16 02:38:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 35.10526315789474) internal successors, (667), 19 states have internal predecessors, (667), 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 179 [2021-10-16 02:38:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:38:36,586 INFO L225 Difference]: With dead ends: 5618 [2021-10-16 02:38:36,587 INFO L226 Difference]: Without dead ends: 2520 [2021-10-16 02:38:36,591 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 1063 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 3757.8ms TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2021-10-16 02:38:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2021-10-16 02:38:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2089. [2021-10-16 02:38:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.1455938697318007) internal successors, (2392), 2088 states have internal predecessors, (2392), 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:38:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2392 transitions. [2021-10-16 02:38:36,671 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2392 transitions. Word has length 179 [2021-10-16 02:38:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:38:36,672 INFO L470 AbstractCegarLoop]: Abstraction has 2089 states and 2392 transitions. [2021-10-16 02:38:36,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 35.10526315789474) internal successors, (667), 19 states have internal predecessors, (667), 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:38:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2392 transitions. [2021-10-16 02:38:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-16 02:38:36,676 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:38:36,677 INFO L512 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:38:36,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-16 02:38:36,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-16 02:38:37,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2021-10-16 02:38:37,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt [2021-10-16 02:38:37,291 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:38:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:38:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2067386358, now seen corresponding path program 1 times [2021-10-16 02:38:37,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:38:37,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995467442] [2021-10-16 02:38:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:38:37,293 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:38:37,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:38:37,296 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:38:37,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-16 02:38:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:38:38,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:38:38,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:38:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:38:38,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:38:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:38:39,631 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:38:39,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995467442] [2021-10-16 02:38:39,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995467442] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:38:39,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:38:39,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-16 02:38:39,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924986532] [2021-10-16 02:38:39,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:38:39,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:38:39,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:38:39,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:38:39,635 INFO L87 Difference]: Start difference. First operand 2089 states and 2392 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 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:38:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:38:42,880 INFO L93 Difference]: Finished difference Result 5149 states and 5917 transitions. [2021-10-16 02:38:42,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:38:42,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 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 183 [2021-10-16 02:38:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:38:42,899 INFO L225 Difference]: With dead ends: 5149 [2021-10-16 02:38:42,900 INFO L226 Difference]: Without dead ends: 3201 [2021-10-16 02:38:42,903 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:38:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2021-10-16 02:38:42,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 2089. [2021-10-16 02:38:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.1173371647509578) internal successors, (2333), 2088 states have internal predecessors, (2333), 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:38:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2333 transitions. [2021-10-16 02:38:42,992 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2333 transitions. Word has length 183 [2021-10-16 02:38:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:38:42,993 INFO L470 AbstractCegarLoop]: Abstraction has 2089 states and 2333 transitions. [2021-10-16 02:38:42,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 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:38:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2333 transitions. [2021-10-16 02:38:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-10-16 02:38:43,001 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:38:43,002 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:38:43,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-16 02:38:43,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:38:43,218 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:38:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:38:43,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1393973778, now seen corresponding path program 1 times [2021-10-16 02:38:43,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:38:43,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055054774] [2021-10-16 02:38:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:38:43,221 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:38:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:38:43,222 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:38:43,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-16 02:38:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:38:44,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-16 02:38:44,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:38:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 35 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:38:45,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:38:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-10-16 02:38:46,505 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:38:46,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055054774] [2021-10-16 02:38:46,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055054774] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-16 02:38:46,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:38:46,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-10-16 02:38:46,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708338566] [2021-10-16 02:38:46,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:38:46,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:38:46,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:38:46,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:38:46,508 INFO L87 Difference]: Start difference. First operand 2089 states and 2333 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:38:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:38:57,180 INFO L93 Difference]: Finished difference Result 5288 states and 5926 transitions. [2021-10-16 02:38:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:38:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 02:38:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:38:57,196 INFO L225 Difference]: With dead ends: 5288 [2021-10-16 02:38:57,197 INFO L226 Difference]: Without dead ends: 3201 [2021-10-16 02:38:57,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:38:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2021-10-16 02:38:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 2923. [2021-10-16 02:38:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2922 states have (on average 1.1153319644079398) internal successors, (3259), 2922 states have internal predecessors, (3259), 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:38:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3259 transitions. [2021-10-16 02:38:57,297 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3259 transitions. Word has length 305 [2021-10-16 02:38:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:38:57,298 INFO L470 AbstractCegarLoop]: Abstraction has 2923 states and 3259 transitions. [2021-10-16 02:38:57,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:38:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3259 transitions. [2021-10-16 02:38:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2021-10-16 02:38:57,307 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:38:57,308 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:38:57,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-16 02:38:57,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:38:57,527 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:38:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:38:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1112203945, now seen corresponding path program 1 times [2021-10-16 02:38:57,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:38:57,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730536906] [2021-10-16 02:38:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:38:57,530 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:38:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:38:57,531 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:38:57,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-16 02:38:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:38:58,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-16 02:38:58,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:38:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 178 proven. 110 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:38:59,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:39:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 178 proven. 110 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:39:34,058 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-16 02:39:34,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730536906] [2021-10-16 02:39:34,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730536906] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:39:34,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1243180031] [2021-10-16 02:39:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:39:34,059 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-16 02:39:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 [2021-10-16 02:39:34,061 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-16 02:39:34,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2021-10-16 02:39:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:39:36,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-16 02:39:36,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:39:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 22 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:39:40,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:39:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 89 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:39:56,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1243180031] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:39:56,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195476026] [2021-10-16 02:39:56,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:39:56,257 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:39:56,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:39:56,260 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:39:56,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-16 02:39:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:39:58,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-16 02:39:58,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:40:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 178 proven. 110 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:40:01,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:40:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 245 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-16 02:40:41,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195476026] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-16 02:40:41,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-16 02:40:41,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 6, 6, 4, 4] total 15 [2021-10-16 02:40:41,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925411366] [2021-10-16 02:40:41,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-16 02:40:41,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-16 02:40:41,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-16 02:40:41,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-10-16 02:40:41,745 INFO L87 Difference]: Start difference. First operand 2923 states and 3259 transitions. Second operand has 16 states, 16 states have (on average 79.1875) internal successors, (1267), 15 states have internal predecessors, (1267), 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:44:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:44:18,004 INFO L93 Difference]: Finished difference Result 8738 states and 9710 transitions. [2021-10-16 02:44:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-16 02:44:18,008 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 79.1875) internal successors, (1267), 15 states have internal predecessors, (1267), 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 320 [2021-10-16 02:44:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:44:18,036 INFO L225 Difference]: With dead ends: 8738 [2021-10-16 02:44:18,036 INFO L226 Difference]: Without dead ends: 4823 [2021-10-16 02:44:18,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1936 GetRequests, 1900 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 18124.3ms TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2021-10-16 02:44:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2021-10-16 02:44:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 3340. [2021-10-16 02:44:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3340 states, 3339 states have (on average 1.0754716981132075) internal successors, (3591), 3339 states have internal predecessors, (3591), 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:44:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 3591 transitions. [2021-10-16 02:44:18,168 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 3591 transitions. Word has length 320 [2021-10-16 02:44:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:44:18,169 INFO L470 AbstractCegarLoop]: Abstraction has 3340 states and 3591 transitions. [2021-10-16 02:44:18,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.1875) internal successors, (1267), 15 states have internal predecessors, (1267), 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:44:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 3591 transitions. [2021-10-16 02:44:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2021-10-16 02:44:18,181 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:44:18,182 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 02:44:18,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2021-10-16 02:44:18,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-16 02:44:18,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-16 02:44:18,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:44:18,792 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:44:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:44:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2053809792, now seen corresponding path program 1 times [2021-10-16 02:44:18,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-16 02:44:18,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102701691] [2021-10-16 02:44:18,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:44:18,796 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-16 02:44:18,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat [2021-10-16 02:44:18,799 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-16 02:44:18,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-16 02:44:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 02:44:21,544 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-16 02:44:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 02:44:22,213 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-10-16 02:44:22,213 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-16 02:44:22,215 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-16 02:44:22,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-16 02:44:22,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/mathsat -unsat_core_generation=3 [2021-10-16 02:44:22,430 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 02:44:22,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:44:22 BoogieIcfgContainer [2021-10-16 02:44:22,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 02:44:22,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 02:44:22,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 02:44:22,702 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 02:44:22,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:35:50" (3/4) ... [2021-10-16 02:44:22,705 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-16 02:44:23,104 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/witness.graphml [2021-10-16 02:44:23,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 02:44:23,122 INFO L168 Benchmark]: Toolchain (without parser) took 517391.92 ms. Allocated memory was 60.8 MB in the beginning and 174.1 MB in the end (delta: 113.2 MB). Free memory was 36.9 MB in the beginning and 39.9 MB in the end (delta: -3.0 MB). Peak memory consumption was 125.8 MB. Max. memory is 16.1 GB. [2021-10-16 02:44:23,122 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 60.8 MB. Free memory is still 40.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:44:23,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.09 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 36.7 MB in the beginning and 43.0 MB in the end (delta: -6.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2021-10-16 02:44:23,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.26 ms. Allocated memory is still 77.6 MB. Free memory was 42.7 MB in the beginning and 37.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:44:23,124 INFO L168 Benchmark]: Boogie Preprocessor took 119.92 ms. Allocated memory is still 77.6 MB. Free memory was 37.5 MB in the beginning and 55.4 MB in the end (delta: -17.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. [2021-10-16 02:44:23,125 INFO L168 Benchmark]: RCFGBuilder took 3801.86 ms. Allocated memory is still 77.6 MB. Free memory was 55.0 MB in the beginning and 28.0 MB in the end (delta: 26.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 16.1 GB. [2021-10-16 02:44:23,125 INFO L168 Benchmark]: TraceAbstraction took 512145.25 ms. Allocated memory was 77.6 MB in the beginning and 174.1 MB in the end (delta: 96.5 MB). Free memory was 27.6 MB in the beginning and 40.8 MB in the end (delta: -13.2 MB). Peak memory consumption was 99.6 MB. Max. memory is 16.1 GB. [2021-10-16 02:44:23,126 INFO L168 Benchmark]: Witness Printer took 403.68 ms. Allocated memory is still 174.1 MB. Free memory was 40.8 MB in the beginning and 39.9 MB in the end (delta: 846.2 kB). Peak memory consumption was 17.7 MB. Max. memory is 16.1 GB. [2021-10-16 02:44:23,129 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.31 ms. Allocated memory is still 60.8 MB. Free memory is still 40.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 790.09 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 36.7 MB in the beginning and 43.0 MB in the end (delta: -6.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 120.26 ms. Allocated memory is still 77.6 MB. Free memory was 42.7 MB in the beginning and 37.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 119.92 ms. Allocated memory is still 77.6 MB. Free memory was 37.5 MB in the beginning and 55.4 MB in the end (delta: -17.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3801.86 ms. Allocated memory is still 77.6 MB. Free memory was 55.0 MB in the beginning and 28.0 MB in the end (delta: 26.9 MB). Peak memory consumption was 32.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 512145.25 ms. Allocated memory was 77.6 MB in the beginning and 174.1 MB in the end (delta: 96.5 MB). Free memory was 27.6 MB in the beginning and 40.8 MB in the end (delta: -13.2 MB). Peak memory consumption was 99.6 MB. Max. memory is 16.1 GB. * Witness Printer took 403.68 ms. Allocated memory is still 174.1 MB. Free memory was 40.8 MB in the beginning and 39.9 MB in the end (delta: 846.2 kB). Peak memory consumption was 17.7 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: 56]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L503] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L519] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L533] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L544] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L550] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L551] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L552] a10 = 1 [L554] return 25; VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L471] a1 = (((a1 / 5) + 105416) + 61704) [L472] a10 = 4 [L474] return 24; VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND TRUE ((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)) [L282] a1 = (((((a1 % 25)+ -8) * 5) % 25)+ 13) [L283] a10 = 1 [L284] a19 = 7 [L286] return -1; VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND TRUE (((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] reach_error() VAL [a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 511784.1ms, OverallIterations: 9, TraceHistogramMax: 4, EmptinessCheckTime: 67.9ms, AutomataDifference: 365712.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 202 SDtfs, 6263 SDslu, 292 SDs, 0 SdLazy, 12798 SolverSat, 2570 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 324178.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4864 GetRequests, 4783 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 22144.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3340occurred in iteration=8, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 651.3ms AutomataMinimizationTime, 8 MinimizatonAttempts, 3443 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 234.3ms SsaConstructionTime, 1989.3ms SatisfiabilityAnalysisTime, 127857.1ms InterpolantComputationTime, 2763 NumberOfCodeBlocks, 2763 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4818 ConstructedInterpolants, 0 QuantifiedInterpolants, 36648 SizeOfPredicates, 31 NumberOfNonLiveVariables, 3121 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 2092/3524 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 02:44:23,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d070ca7-7d88-4056-acaa-de9a388a311f/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...