./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58e857a51148141aa14a27a9d40d99edfe00074b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.0-a4ecdab [2020-11-28 03:10:32,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:10:32,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:10:32,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:10:32,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:10:32,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:10:32,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:10:32,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:10:32,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:10:32,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:10:32,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:10:32,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:10:32,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:10:32,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:10:32,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:10:32,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:10:32,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:10:32,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:10:32,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:10:32,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:10:32,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:10:32,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:10:32,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:10:32,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:10:32,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:10:32,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:10:32,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:10:32,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:10:32,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:10:32,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:10:32,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:10:32,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:10:32,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:10:32,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:10:32,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:10:32,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:10:32,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:10:32,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:10:32,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:10:32,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:10:32,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:10:32,740 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:10:32,769 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:10:32,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:10:32,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:10:32,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:10:32,772 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:10:32,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:10:32,772 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:10:32,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:10:32,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:10:32,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:10:32,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:10:32,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:10:32,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:10:32,774 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:10:32,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:10:32,775 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:10:32,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:10:32,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:10:32,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:10:32,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:10:32,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:10:32,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:10:32,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:10:32,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:10:32,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:10:32,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:10:32,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:10:32,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:10:32,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:10:32,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/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-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58e857a51148141aa14a27a9d40d99edfe00074b [2020-11-28 03:10:33,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:10:33,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:10:33,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:10:33,106 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:10:33,107 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:10:33,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2020-11-28 03:10:33,186 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/data/e33bb3a13/37930d7b23e148fbb71b503e998af445/FLAG999aa1d07 [2020-11-28 03:10:33,864 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:10:33,865 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2020-11-28 03:10:33,881 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/data/e33bb3a13/37930d7b23e148fbb71b503e998af445/FLAG999aa1d07 [2020-11-28 03:10:34,089 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/data/e33bb3a13/37930d7b23e148fbb71b503e998af445 [2020-11-28 03:10:34,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:10:34,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:10:34,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:10:34,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:10:34,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:10:34,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:34,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e513e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34, skipping insertion in model container [2020-11-28 03:10:34,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:34,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:10:34,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:10:34,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:10:34,657 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:10:34,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:10:34,848 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:10:34,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34 WrapperNode [2020-11-28 03:10:34,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:10:34,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:10:34,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:10:34,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:10:34,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:34,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:34,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:10:34,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:10:34,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:10:34,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:10:34,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:34,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:35,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:35,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:35,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:35,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:35,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... [2020-11-28 03:10:35,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:10:35,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:10:35,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:10:35,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:10:35,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:10:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:10:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:10:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:10:35,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:10:36,792 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:10:36,793 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-28 03:10:36,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:10:36 BoogieIcfgContainer [2020-11-28 03:10:36,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:10:36,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:10:36,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:10:36,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:10:36,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:10:34" (1/3) ... [2020-11-28 03:10:36,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e3facf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:10:36, skipping insertion in model container [2020-11-28 03:10:36,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:10:34" (2/3) ... [2020-11-28 03:10:36,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e3facf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:10:36, skipping insertion in model container [2020-11-28 03:10:36,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:10:36" (3/3) ... [2020-11-28 03:10:36,812 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label59.c [2020-11-28 03:10:36,829 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:10:36,834 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 03:10:36,849 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-28 03:10:36,894 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:10:36,895 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:10:36,895 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:10:36,895 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:10:36,895 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:10:36,895 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:10:36,895 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:10:36,896 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:10:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2020-11-28 03:10:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-28 03:10:36,943 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:36,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:36,944 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash -742425229, now seen corresponding path program 1 times [2020-11-28 03:10:36,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:36,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147171445] [2020-11-28 03:10:36,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:37,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147171445] [2020-11-28 03:10:37,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:37,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:10:37,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545900467] [2020-11-28 03:10:37,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:37,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:37,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:37,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:37,482 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 3 states. [2020-11-28 03:10:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:38,904 INFO L93 Difference]: Finished difference Result 618 states and 1060 transitions. [2020-11-28 03:10:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:38,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-11-28 03:10:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:38,923 INFO L225 Difference]: With dead ends: 618 [2020-11-28 03:10:38,923 INFO L226 Difference]: Without dead ends: 316 [2020-11-28 03:10:38,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-11-28 03:10:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 309. [2020-11-28 03:10:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-11-28 03:10:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions. [2020-11-28 03:10:39,034 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 83 [2020-11-28 03:10:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:39,036 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions. [2020-11-28 03:10:39,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions. [2020-11-28 03:10:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-28 03:10:39,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:39,050 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:39,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:10:39,051 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:39,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:39,052 INFO L82 PathProgramCache]: Analyzing trace with hash 52509168, now seen corresponding path program 1 times [2020-11-28 03:10:39,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:39,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584200189] [2020-11-28 03:10:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:39,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584200189] [2020-11-28 03:10:39,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:39,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:10:39,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43172345] [2020-11-28 03:10:39,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:39,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:39,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:39,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:39,175 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand 3 states. [2020-11-28 03:10:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:40,099 INFO L93 Difference]: Finished difference Result 900 states and 1316 transitions. [2020-11-28 03:10:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:40,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-11-28 03:10:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:40,106 INFO L225 Difference]: With dead ends: 900 [2020-11-28 03:10:40,107 INFO L226 Difference]: Without dead ends: 593 [2020-11-28 03:10:40,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-11-28 03:10:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-11-28 03:10:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-11-28 03:10:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 763 transitions. [2020-11-28 03:10:40,153 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 763 transitions. Word has length 91 [2020-11-28 03:10:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:40,154 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 763 transitions. [2020-11-28 03:10:40,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 763 transitions. [2020-11-28 03:10:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-28 03:10:40,157 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:40,158 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:40,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:10:40,158 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:40,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1338968176, now seen corresponding path program 1 times [2020-11-28 03:10:40,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:40,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96123661] [2020-11-28 03:10:40,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:40,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96123661] [2020-11-28 03:10:40,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:40,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:40,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164101788] [2020-11-28 03:10:40,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:40,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:40,409 INFO L87 Difference]: Start difference. First operand 591 states and 763 transitions. Second operand 3 states. [2020-11-28 03:10:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:41,228 INFO L93 Difference]: Finished difference Result 1465 states and 1942 transitions. [2020-11-28 03:10:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:41,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-11-28 03:10:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:41,240 INFO L225 Difference]: With dead ends: 1465 [2020-11-28 03:10:41,240 INFO L226 Difference]: Without dead ends: 876 [2020-11-28 03:10:41,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2020-11-28 03:10:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 874. [2020-11-28 03:10:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2020-11-28 03:10:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1071 transitions. [2020-11-28 03:10:41,298 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1071 transitions. Word has length 92 [2020-11-28 03:10:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:41,299 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1071 transitions. [2020-11-28 03:10:41,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1071 transitions. [2020-11-28 03:10:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-28 03:10:41,303 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:41,303 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:41,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:10:41,304 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:41,305 INFO L82 PathProgramCache]: Analyzing trace with hash -360436043, now seen corresponding path program 1 times [2020-11-28 03:10:41,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:41,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27831327] [2020-11-28 03:10:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:41,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27831327] [2020-11-28 03:10:41,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:41,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:10:41,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480654811] [2020-11-28 03:10:41,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:41,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:41,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:41,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:41,389 INFO L87 Difference]: Start difference. First operand 874 states and 1071 transitions. Second operand 3 states. [2020-11-28 03:10:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:42,303 INFO L93 Difference]: Finished difference Result 2448 states and 3014 transitions. [2020-11-28 03:10:42,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:42,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-11-28 03:10:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:42,318 INFO L225 Difference]: With dead ends: 2448 [2020-11-28 03:10:42,319 INFO L226 Difference]: Without dead ends: 1576 [2020-11-28 03:10:42,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2020-11-28 03:10:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2020-11-28 03:10:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-11-28 03:10:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1879 transitions. [2020-11-28 03:10:42,383 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1879 transitions. Word has length 93 [2020-11-28 03:10:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:42,385 INFO L481 AbstractCegarLoop]: Abstraction has 1576 states and 1879 transitions. [2020-11-28 03:10:42,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1879 transitions. [2020-11-28 03:10:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-28 03:10:42,393 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:42,393 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:42,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:10:42,394 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1912821181, now seen corresponding path program 1 times [2020-11-28 03:10:42,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:42,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954754004] [2020-11-28 03:10:42,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:42,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954754004] [2020-11-28 03:10:42,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768772077] [2020-11-28 03:10:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:10:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:42,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:10:42,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:10:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 03:10:42,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-28 03:10:42,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-11-28 03:10:42,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939435913] [2020-11-28 03:10:42,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:42,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:42,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:42,915 INFO L87 Difference]: Start difference. First operand 1576 states and 1879 transitions. Second operand 3 states. [2020-11-28 03:10:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:44,084 INFO L93 Difference]: Finished difference Result 4426 states and 5314 transitions. [2020-11-28 03:10:44,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:44,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-11-28 03:10:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:44,105 INFO L225 Difference]: With dead ends: 4426 [2020-11-28 03:10:44,105 INFO L226 Difference]: Without dead ends: 2852 [2020-11-28 03:10:44,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-11-28 03:10:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2846. [2020-11-28 03:10:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2020-11-28 03:10:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 3391 transitions. [2020-11-28 03:10:44,212 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 3391 transitions. Word has length 96 [2020-11-28 03:10:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:44,214 INFO L481 AbstractCegarLoop]: Abstraction has 2846 states and 3391 transitions. [2020-11-28 03:10:44,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3391 transitions. [2020-11-28 03:10:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-28 03:10:44,219 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:44,220 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:44,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:10:44,439 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:44,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1871634094, now seen corresponding path program 1 times [2020-11-28 03:10:44,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:44,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456282061] [2020-11-28 03:10:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:44,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456282061] [2020-11-28 03:10:44,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:44,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:44,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929428859] [2020-11-28 03:10:44,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:44,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:44,698 INFO L87 Difference]: Start difference. First operand 2846 states and 3391 transitions. Second operand 3 states. [2020-11-28 03:10:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:45,696 INFO L93 Difference]: Finished difference Result 6672 states and 8135 transitions. [2020-11-28 03:10:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:45,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-11-28 03:10:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:45,723 INFO L225 Difference]: With dead ends: 6672 [2020-11-28 03:10:45,723 INFO L226 Difference]: Without dead ends: 3828 [2020-11-28 03:10:45,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2020-11-28 03:10:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3827. [2020-11-28 03:10:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3827 states. [2020-11-28 03:10:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 4612 transitions. [2020-11-28 03:10:45,867 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 4612 transitions. Word has length 113 [2020-11-28 03:10:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:45,868 INFO L481 AbstractCegarLoop]: Abstraction has 3827 states and 4612 transitions. [2020-11-28 03:10:45,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 4612 transitions. [2020-11-28 03:10:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-28 03:10:45,874 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:45,875 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:45,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:10:45,875 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash -542523611, now seen corresponding path program 1 times [2020-11-28 03:10:45,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:45,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169101207] [2020-11-28 03:10:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-28 03:10:45,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169101207] [2020-11-28 03:10:45,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218969154] [2020-11-28 03:10:45,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:10:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:46,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:10:46,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:10:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-28 03:10:46,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-28 03:10:46,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-11-28 03:10:46,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926879751] [2020-11-28 03:10:46,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:46,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:46,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:46,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:46,159 INFO L87 Difference]: Start difference. First operand 3827 states and 4612 transitions. Second operand 3 states. [2020-11-28 03:10:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:47,073 INFO L93 Difference]: Finished difference Result 7509 states and 9039 transitions. [2020-11-28 03:10:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:47,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-11-28 03:10:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:47,096 INFO L225 Difference]: With dead ends: 7509 [2020-11-28 03:10:47,096 INFO L226 Difference]: Without dead ends: 3684 [2020-11-28 03:10:47,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2020-11-28 03:10:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2701. [2020-11-28 03:10:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2020-11-28 03:10:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3052 transitions. [2020-11-28 03:10:47,183 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3052 transitions. Word has length 116 [2020-11-28 03:10:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:47,184 INFO L481 AbstractCegarLoop]: Abstraction has 2701 states and 3052 transitions. [2020-11-28 03:10:47,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3052 transitions. [2020-11-28 03:10:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-28 03:10:47,189 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:47,189 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:47,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:10:47,413 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1099796851, now seen corresponding path program 1 times [2020-11-28 03:10:47,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:47,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671179159] [2020-11-28 03:10:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:47,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671179159] [2020-11-28 03:10:47,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:47,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:10:47,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957932657] [2020-11-28 03:10:47,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:47,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:47,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:47,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:47,505 INFO L87 Difference]: Start difference. First operand 2701 states and 3052 transitions. Second operand 3 states. [2020-11-28 03:10:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:48,410 INFO L93 Difference]: Finished difference Result 6818 states and 7717 transitions. [2020-11-28 03:10:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:48,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-11-28 03:10:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:48,440 INFO L225 Difference]: With dead ends: 6818 [2020-11-28 03:10:48,440 INFO L226 Difference]: Without dead ends: 4119 [2020-11-28 03:10:48,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4119 states. [2020-11-28 03:10:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4119 to 4117. [2020-11-28 03:10:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4117 states. [2020-11-28 03:10:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 4628 transitions. [2020-11-28 03:10:48,556 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 4628 transitions. Word has length 116 [2020-11-28 03:10:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:48,557 INFO L481 AbstractCegarLoop]: Abstraction has 4117 states and 4628 transitions. [2020-11-28 03:10:48,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 4628 transitions. [2020-11-28 03:10:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-28 03:10:48,564 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:48,564 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:48,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:10:48,565 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash -246171339, now seen corresponding path program 1 times [2020-11-28 03:10:48,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:48,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990999187] [2020-11-28 03:10:48,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-11-28 03:10:48,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990999187] [2020-11-28 03:10:48,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909781594] [2020-11-28 03:10:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:10:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:48,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:10:48,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:10:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-28 03:10:48,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-28 03:10:48,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2020-11-28 03:10:48,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112480502] [2020-11-28 03:10:48,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:48,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:48,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:48,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:48,893 INFO L87 Difference]: Start difference. First operand 4117 states and 4628 transitions. Second operand 3 states. [2020-11-28 03:10:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:49,370 INFO L93 Difference]: Finished difference Result 7941 states and 8920 transitions. [2020-11-28 03:10:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:49,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-11-28 03:10:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:49,394 INFO L225 Difference]: With dead ends: 7941 [2020-11-28 03:10:49,394 INFO L226 Difference]: Without dead ends: 3826 [2020-11-28 03:10:49,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2020-11-28 03:10:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3826. [2020-11-28 03:10:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2020-11-28 03:10:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4254 transitions. [2020-11-28 03:10:49,495 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4254 transitions. Word has length 131 [2020-11-28 03:10:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:49,495 INFO L481 AbstractCegarLoop]: Abstraction has 3826 states and 4254 transitions. [2020-11-28 03:10:49,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4254 transitions. [2020-11-28 03:10:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-28 03:10:49,502 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:49,502 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:49,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:10:49,729 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash -696505083, now seen corresponding path program 1 times [2020-11-28 03:10:49,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:49,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787757849] [2020-11-28 03:10:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:49,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787757849] [2020-11-28 03:10:49,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:49,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:49,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231767770] [2020-11-28 03:10:49,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:49,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:49,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:49,870 INFO L87 Difference]: Start difference. First operand 3826 states and 4254 transitions. Second operand 3 states. [2020-11-28 03:10:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:50,611 INFO L93 Difference]: Finished difference Result 7510 states and 8361 transitions. [2020-11-28 03:10:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:50,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2020-11-28 03:10:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:50,632 INFO L225 Difference]: With dead ends: 7510 [2020-11-28 03:10:50,633 INFO L226 Difference]: Without dead ends: 3826 [2020-11-28 03:10:50,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2020-11-28 03:10:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3826. [2020-11-28 03:10:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2020-11-28 03:10:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4242 transitions. [2020-11-28 03:10:50,728 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4242 transitions. Word has length 136 [2020-11-28 03:10:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:50,729 INFO L481 AbstractCegarLoop]: Abstraction has 3826 states and 4242 transitions. [2020-11-28 03:10:50,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4242 transitions. [2020-11-28 03:10:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-28 03:10:50,735 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:50,736 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-28 03:10:50,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:10:50,736 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash -902283608, now seen corresponding path program 1 times [2020-11-28 03:10:50,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:50,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515382766] [2020-11-28 03:10:50,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-28 03:10:50,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515382766] [2020-11-28 03:10:50,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:50,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:50,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493548022] [2020-11-28 03:10:50,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:50,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:50,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:50,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:50,829 INFO L87 Difference]: Start difference. First operand 3826 states and 4242 transitions. Second operand 3 states. [2020-11-28 03:10:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:51,545 INFO L93 Difference]: Finished difference Result 6942 states and 7732 transitions. [2020-11-28 03:10:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:51,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-11-28 03:10:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:51,581 INFO L225 Difference]: With dead ends: 6942 [2020-11-28 03:10:51,581 INFO L226 Difference]: Without dead ends: 3258 [2020-11-28 03:10:51,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2020-11-28 03:10:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2838. [2020-11-28 03:10:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2020-11-28 03:10:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3117 transitions. [2020-11-28 03:10:51,651 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3117 transitions. Word has length 140 [2020-11-28 03:10:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:51,652 INFO L481 AbstractCegarLoop]: Abstraction has 2838 states and 3117 transitions. [2020-11-28 03:10:51,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3117 transitions. [2020-11-28 03:10:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-28 03:10:51,658 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:51,658 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:51,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:10:51,659 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1831578510, now seen corresponding path program 1 times [2020-11-28 03:10:51,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:51,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806907998] [2020-11-28 03:10:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-28 03:10:51,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806907998] [2020-11-28 03:10:51,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:51,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:51,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886259684] [2020-11-28 03:10:51,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:51,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:51,729 INFO L87 Difference]: Start difference. First operand 2838 states and 3117 transitions. Second operand 3 states. [2020-11-28 03:10:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:52,463 INFO L93 Difference]: Finished difference Result 5673 states and 6203 transitions. [2020-11-28 03:10:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:52,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2020-11-28 03:10:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:52,471 INFO L225 Difference]: With dead ends: 5673 [2020-11-28 03:10:52,471 INFO L226 Difference]: Without dead ends: 2834 [2020-11-28 03:10:52,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-11-28 03:10:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2408. [2020-11-28 03:10:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2020-11-28 03:10:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2580 transitions. [2020-11-28 03:10:52,526 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2580 transitions. Word has length 144 [2020-11-28 03:10:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:52,527 INFO L481 AbstractCegarLoop]: Abstraction has 2408 states and 2580 transitions. [2020-11-28 03:10:52,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2580 transitions. [2020-11-28 03:10:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-28 03:10:52,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:52,533 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-11-28 03:10:52,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:10:52,533 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1449710102, now seen corresponding path program 1 times [2020-11-28 03:10:52,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:52,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900845962] [2020-11-28 03:10:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-28 03:10:52,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900845962] [2020-11-28 03:10:52,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:52,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:10:52,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854931413] [2020-11-28 03:10:52,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:52,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:52,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:52,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:52,606 INFO L87 Difference]: Start difference. First operand 2408 states and 2580 transitions. Second operand 3 states. [2020-11-28 03:10:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:53,318 INFO L93 Difference]: Finished difference Result 4812 states and 5165 transitions. [2020-11-28 03:10:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:53,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2020-11-28 03:10:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:53,326 INFO L225 Difference]: With dead ends: 4812 [2020-11-28 03:10:53,326 INFO L226 Difference]: Without dead ends: 2263 [2020-11-28 03:10:53,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:10:53,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2020-11-28 03:10:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2263. [2020-11-28 03:10:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2020-11-28 03:10:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2410 transitions. [2020-11-28 03:10:53,374 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2410 transitions. Word has length 151 [2020-11-28 03:10:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:53,374 INFO L481 AbstractCegarLoop]: Abstraction has 2263 states and 2410 transitions. [2020-11-28 03:10:53,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2410 transitions. [2020-11-28 03:10:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-11-28 03:10:53,381 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:53,381 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:53,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:10:53,381 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:53,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:53,382 INFO L82 PathProgramCache]: Analyzing trace with hash -927365454, now seen corresponding path program 1 times [2020-11-28 03:10:53,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:53,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797281048] [2020-11-28 03:10:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-11-28 03:10:53,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797281048] [2020-11-28 03:10:53,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821377724] [2020-11-28 03:10:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:10:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:53,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-28 03:10:53,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:10:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-28 03:10:53,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-28 03:10:53,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-11-28 03:10:53,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328802435] [2020-11-28 03:10:53,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:10:53,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:53,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:10:53,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:53,696 INFO L87 Difference]: Start difference. First operand 2263 states and 2410 transitions. Second operand 3 states. [2020-11-28 03:10:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:54,243 INFO L93 Difference]: Finished difference Result 2825 states and 2999 transitions. [2020-11-28 03:10:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:10:54,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-11-28 03:10:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:54,247 INFO L225 Difference]: With dead ends: 2825 [2020-11-28 03:10:54,247 INFO L226 Difference]: Without dead ends: 1414 [2020-11-28 03:10:54,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:54,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-11-28 03:10:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2020-11-28 03:10:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2020-11-28 03:10:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1486 transitions. [2020-11-28 03:10:54,275 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1486 transitions. Word has length 175 [2020-11-28 03:10:54,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:54,276 INFO L481 AbstractCegarLoop]: Abstraction has 1414 states and 1486 transitions. [2020-11-28 03:10:54,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:10:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1486 transitions. [2020-11-28 03:10:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-11-28 03:10:54,281 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:54,281 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-28 03:10:54,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:10:54,494 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:54,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:54,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1671837462, now seen corresponding path program 1 times [2020-11-28 03:10:54,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:54,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236654263] [2020-11-28 03:10:54,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-28 03:10:54,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236654263] [2020-11-28 03:10:54,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:10:54,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:10:54,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295888593] [2020-11-28 03:10:54,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:10:54,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:10:54,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:10:54,777 INFO L87 Difference]: Start difference. First operand 1414 states and 1486 transitions. Second operand 5 states. [2020-11-28 03:10:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:56,058 INFO L93 Difference]: Finished difference Result 2854 states and 3005 transitions. [2020-11-28 03:10:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:10:56,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2020-11-28 03:10:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:56,061 INFO L225 Difference]: With dead ends: 2854 [2020-11-28 03:10:56,061 INFO L226 Difference]: Without dead ends: 1293 [2020-11-28 03:10:56,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:10:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2020-11-28 03:10:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1132. [2020-11-28 03:10:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2020-11-28 03:10:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1163 transitions. [2020-11-28 03:10:56,086 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1163 transitions. Word has length 189 [2020-11-28 03:10:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:56,087 INFO L481 AbstractCegarLoop]: Abstraction has 1132 states and 1163 transitions. [2020-11-28 03:10:56,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:10:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1163 transitions. [2020-11-28 03:10:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-11-28 03:10:56,091 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:56,092 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-28 03:10:56,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:10:56,092 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash 573201033, now seen corresponding path program 1 times [2020-11-28 03:10:56,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:56,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168596354] [2020-11-28 03:10:56,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 165 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:56,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168596354] [2020-11-28 03:10:56,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132017084] [2020-11-28 03:10:56,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:10:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:10:56,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-28 03:10:56,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:10:56,713 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-28 03:10:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 234 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:10:56,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:10:56,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-11-28 03:10:56,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010479567] [2020-11-28 03:10:56,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 03:10:56,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:10:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 03:10:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:10:56,886 INFO L87 Difference]: Start difference. First operand 1132 states and 1163 transitions. Second operand 9 states. [2020-11-28 03:10:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:10:59,173 INFO L93 Difference]: Finished difference Result 2591 states and 2664 transitions. [2020-11-28 03:10:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-28 03:10:59,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 217 [2020-11-28 03:10:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:10:59,178 INFO L225 Difference]: With dead ends: 2591 [2020-11-28 03:10:59,178 INFO L226 Difference]: Without dead ends: 1595 [2020-11-28 03:10:59,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-11-28 03:10:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2020-11-28 03:10:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 850. [2020-11-28 03:10:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2020-11-28 03:10:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 871 transitions. [2020-11-28 03:10:59,206 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 871 transitions. Word has length 217 [2020-11-28 03:10:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:10:59,206 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 871 transitions. [2020-11-28 03:10:59,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 03:10:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 871 transitions. [2020-11-28 03:10:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-11-28 03:10:59,211 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:10:59,211 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:10:59,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-28 03:10:59,437 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:10:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:10:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2101433562, now seen corresponding path program 1 times [2020-11-28 03:10:59,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:10:59,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354992316] [2020-11-28 03:10:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:10:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:59,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:10:59,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:10:59,794 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:10:59,794 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:10:59,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:11:00,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:11:00 BoogieIcfgContainer [2020-11-28 03:11:00,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:11:00,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:11:00,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:11:00,117 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:11:00,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:10:36" (3/4) ... [2020-11-28 03:11:00,120 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:11:00,472 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0f648c5e-3f8b-4cdf-b29b-1da1acea38a8/bin/uautomizer/witness.graphml [2020-11-28 03:11:00,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:11:00,475 INFO L168 Benchmark]: Toolchain (without parser) took 26379.62 ms. Allocated memory was 127.9 MB in the beginning and 408.9 MB in the end (delta: 281.0 MB). Free memory was 95.9 MB in the beginning and 324.4 MB in the end (delta: -228.5 MB). Peak memory consumption was 53.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:00,475 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 81.8 MB. Free memory is still 40.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:11:00,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.32 ms. Allocated memory is still 127.9 MB. Free memory was 95.6 MB in the beginning and 88.0 MB in the end (delta: 7.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:00,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.44 ms. Allocated memory is still 127.9 MB. Free memory was 88.0 MB in the beginning and 82.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:00,477 INFO L168 Benchmark]: Boogie Preprocessor took 105.66 ms. Allocated memory is still 127.9 MB. Free memory was 82.8 MB in the beginning and 78.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:00,478 INFO L168 Benchmark]: RCFGBuilder took 1714.10 ms. Allocated memory was 127.9 MB in the beginning and 159.4 MB in the end (delta: 31.5 MB). Free memory was 78.6 MB in the beginning and 102.3 MB in the end (delta: -23.8 MB). Peak memory consumption was 45.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:00,478 INFO L168 Benchmark]: TraceAbstraction took 23313.26 ms. Allocated memory was 159.4 MB in the beginning and 408.9 MB in the end (delta: 249.6 MB). Free memory was 101.3 MB in the beginning and 359.0 MB in the end (delta: -257.7 MB). Peak memory consumption was 180.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:00,479 INFO L168 Benchmark]: Witness Printer took 356.06 ms. Allocated memory is still 408.9 MB. Free memory was 359.0 MB in the beginning and 324.4 MB in the end (delta: 34.6 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:00,481 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.27 ms. Allocated memory is still 81.8 MB. Free memory is still 40.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 753.32 ms. Allocated memory is still 127.9 MB. Free memory was 95.6 MB in the beginning and 88.0 MB in the end (delta: 7.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 123.44 ms. Allocated memory is still 127.9 MB. Free memory was 88.0 MB in the beginning and 82.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 105.66 ms. Allocated memory is still 127.9 MB. Free memory was 82.8 MB in the beginning and 78.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1714.10 ms. Allocated memory was 127.9 MB in the beginning and 159.4 MB in the end (delta: 31.5 MB). Free memory was 78.6 MB in the beginning and 102.3 MB in the end (delta: -23.8 MB). Peak memory consumption was 45.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23313.26 ms. Allocated memory was 159.4 MB in the beginning and 408.9 MB in the end (delta: 249.6 MB). Free memory was 101.3 MB in the beginning and 359.0 MB in the end (delta: -257.7 MB). Peak memory consumption was 180.6 MB. Max. memory is 16.1 GB. * Witness Printer took 356.06 ms. Allocated memory is still 408.9 MB. Free memory was 359.0 MB in the beginning and 324.4 MB in the end (delta: 34.6 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L165] a25 = 1 [L166] a19 = 1 [L167] a28 = 7 [L168] return -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem02_label59.c", 4, "reach_error") VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 228 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.9s, OverallIterations: 17, TraceHistogramMax: 6, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2001 SDtfs, 2861 SDslu, 321 SDs, 0 SdLazy, 7850 SolverSat, 942 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 787 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4117occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 2755 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2797 ConstructedInterpolants, 0 QuantifiedInterpolants, 1505284 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1596 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 1585/1691 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! Received shutdown request...