./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label45.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_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/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 b5c9cf7cc5a540c706050c1efb212d27a13eaab4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30 01:22:45,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:22:45,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:22:45,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:22:45,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:22:45,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:22:45,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:22:45,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:22:45,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:22:45,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:22:45,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:22:45,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:22:45,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:22:45,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:22:45,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:22:45,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:22:45,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:22:45,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:22:45,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:22:45,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:22:45,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:22:45,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:22:45,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:22:45,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:22:45,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:22:45,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:22:45,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:22:45,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:22:45,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:22:45,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:22:45,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:22:45,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:22:45,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:22:45,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:22:45,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:22:45,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:22:45,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:22:45,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:22:45,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:22:45,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:22:45,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:22:45,610 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:22:45,654 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:22:45,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:22:45,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:22:45,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:22:45,657 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:22:45,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:22:45,658 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:22:45,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:22:45,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:22:45,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:22:45,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:22:45,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:22:45,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:22:45,661 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:22:45,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:22:45,662 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:22:45,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:22:45,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:22:45,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:22:45,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:22:45,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:22:45,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:22:45,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:22:45,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:22:45,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:22:45,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:22:45,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:22:45,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:22:45,665 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:22:45,666 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_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/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_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/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 -> b5c9cf7cc5a540c706050c1efb212d27a13eaab4 [2020-11-30 01:22:45,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:22:46,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:22:46,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:22:46,008 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:22:46,010 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:22:46,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c [2020-11-30 01:22:46,094 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/data/b3a454139/89b86fe9520345deb02c7074e2504b42/FLAG8fc5a9ce0 [2020-11-30 01:22:46,888 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:22:46,895 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/sv-benchmarks/c/eca-rers2012/Problem02_label45.c [2020-11-30 01:22:46,917 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/data/b3a454139/89b86fe9520345deb02c7074e2504b42/FLAG8fc5a9ce0 [2020-11-30 01:22:47,099 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/data/b3a454139/89b86fe9520345deb02c7074e2504b42 [2020-11-30 01:22:47,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:22:47,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:22:47,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:22:47,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:22:47,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:22:47,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:47,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767609ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47, skipping insertion in model container [2020-11-30 01:22:47,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:47,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:22:47,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:22:47,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:22:47,727 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:22:47,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:22:47,921 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:22:47,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47 WrapperNode [2020-11-30 01:22:47,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:22:47,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:22:47,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:22:47,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:22:47,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:47,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:48,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:22:48,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:22:48,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:22:48,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:22:48,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:48,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:48,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:48,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:48,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:48,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:48,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... [2020-11-30 01:22:48,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:22:48,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:22:48,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:22:48,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:22:48,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/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-30 01:22:48,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:22:48,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:22:48,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:22:48,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:22:49,852 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:22:49,853 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 01:22:49,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:22:49 BoogieIcfgContainer [2020-11-30 01:22:49,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:22:49,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:22:49,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:22:49,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:22:49,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:22:47" (1/3) ... [2020-11-30 01:22:49,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2669dbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:22:49, skipping insertion in model container [2020-11-30 01:22:49,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:22:47" (2/3) ... [2020-11-30 01:22:49,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2669dbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:22:49, skipping insertion in model container [2020-11-30 01:22:49,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:22:49" (3/3) ... [2020-11-30 01:22:49,869 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label45.c [2020-11-30 01:22:49,881 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:22:49,887 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:22:49,901 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:22:49,949 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:22:49,950 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:22:49,950 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:22:49,950 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:22:49,951 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:22:49,951 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:22:49,951 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:22:49,951 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:22:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2020-11-30 01:22:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-30 01:22:49,987 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:22:49,988 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] [2020-11-30 01:22:49,989 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:22:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash -578138675, now seen corresponding path program 1 times [2020-11-30 01:22:50,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:50,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091650794] [2020-11-30 01:22:50,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:50,495 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-30 01:22:50,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091650794] [2020-11-30 01:22:50,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:22:50,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:22:50,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156513039] [2020-11-30 01:22:50,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:22:50,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:22:50,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:22:50,522 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 3 states. [2020-11-30 01:22:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:51,759 INFO L93 Difference]: Finished difference Result 631 states and 1071 transitions. [2020-11-30 01:22:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:22:51,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-11-30 01:22:51,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:22:51,788 INFO L225 Difference]: With dead ends: 631 [2020-11-30 01:22:51,789 INFO L226 Difference]: Without dead ends: 318 [2020-11-30 01:22:51,794 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-30 01:22:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-11-30 01:22:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2020-11-30 01:22:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2020-11-30 01:22:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2020-11-30 01:22:51,892 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 82 [2020-11-30 01:22:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:22:51,894 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2020-11-30 01:22:51,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:22:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2020-11-30 01:22:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-30 01:22:51,900 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:22:51,901 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:22:51,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:22:51,901 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:22:51,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:51,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1090448262, now seen corresponding path program 1 times [2020-11-30 01:22:51,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:51,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588707171] [2020-11-30 01:22:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:52,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588707171] [2020-11-30 01:22:52,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:22:52,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:22:52,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112890300] [2020-11-30 01:22:52,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:22:52,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:22:52,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:22:52,010 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand 3 states. [2020-11-30 01:22:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:52,844 INFO L93 Difference]: Finished difference Result 919 states and 1357 transitions. [2020-11-30 01:22:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:22:52,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-11-30 01:22:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:22:52,849 INFO L225 Difference]: With dead ends: 919 [2020-11-30 01:22:52,849 INFO L226 Difference]: Without dead ends: 603 [2020-11-30 01:22:52,852 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-30 01:22:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-11-30 01:22:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2020-11-30 01:22:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2020-11-30 01:22:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 775 transitions. [2020-11-30 01:22:52,877 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 775 transitions. Word has length 86 [2020-11-30 01:22:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:22:52,882 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 775 transitions. [2020-11-30 01:22:52,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:22:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 775 transitions. [2020-11-30 01:22:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-30 01:22:52,887 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:22:52,887 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:22:52,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:22:52,887 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:22:52,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash 803175495, now seen corresponding path program 1 times [2020-11-30 01:22:52,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:52,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743776498] [2020-11-30 01:22:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:22:53,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743776498] [2020-11-30 01:22:53,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492045198] [2020-11-30 01:22:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/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-30 01:22:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:53,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:22:53,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 01:22:53,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:22:53,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-11-30 01:22:53,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200270164] [2020-11-30 01:22:53,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:22:53,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:53,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:22:53,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:22:53,452 INFO L87 Difference]: Start difference. First operand 601 states and 775 transitions. Second operand 3 states. [2020-11-30 01:22:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:54,213 INFO L93 Difference]: Finished difference Result 1486 states and 1970 transitions. [2020-11-30 01:22:54,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:22:54,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-11-30 01:22:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:22:54,221 INFO L225 Difference]: With dead ends: 1486 [2020-11-30 01:22:54,221 INFO L226 Difference]: Without dead ends: 887 [2020-11-30 01:22:54,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:22:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-11-30 01:22:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2020-11-30 01:22:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-11-30 01:22:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1142 transitions. [2020-11-30 01:22:54,277 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1142 transitions. Word has length 91 [2020-11-30 01:22:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:22:54,302 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 1142 transitions. [2020-11-30 01:22:54,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:22:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1142 transitions. [2020-11-30 01:22:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-30 01:22:54,304 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:22:54,305 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:22:54,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-30 01:22:54,506 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:22:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1982689760, now seen corresponding path program 2 times [2020-11-30 01:22:54,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:54,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061935007] [2020-11-30 01:22:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 01:22:54,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061935007] [2020-11-30 01:22:54,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871147869] [2020-11-30 01:22:54,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/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-30 01:22:54,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:22:54,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:22:54,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:22:54,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 01:22:54,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:22:54,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-11-30 01:22:54,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569944346] [2020-11-30 01:22:54,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:22:54,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:22:54,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:22:54,803 INFO L87 Difference]: Start difference. First operand 885 states and 1142 transitions. Second operand 3 states. [2020-11-30 01:22:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:55,528 INFO L93 Difference]: Finished difference Result 2050 states and 2650 transitions. [2020-11-30 01:22:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:22:55,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-11-30 01:22:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:22:55,541 INFO L225 Difference]: With dead ends: 2050 [2020-11-30 01:22:55,541 INFO L226 Difference]: Without dead ends: 1167 [2020-11-30 01:22:55,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-30 01:22:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-11-30 01:22:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1165. [2020-11-30 01:22:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2020-11-30 01:22:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1427 transitions. [2020-11-30 01:22:55,580 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1427 transitions. Word has length 96 [2020-11-30 01:22:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:22:55,580 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1427 transitions. [2020-11-30 01:22:55,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:22:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1427 transitions. [2020-11-30 01:22:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-30 01:22:55,584 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:22:55,585 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-11-30 01:22:55,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:22:55,794 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:22:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash 585950300, now seen corresponding path program 1 times [2020-11-30 01:22:55,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:55,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183102678] [2020-11-30 01:22:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 01:22:55,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183102678] [2020-11-30 01:22:55,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:22:55,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:22:55,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303594] [2020-11-30 01:22:55,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:22:55,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:55,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:22:55,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:22:55,866 INFO L87 Difference]: Start difference. First operand 1165 states and 1427 transitions. Second operand 3 states. [2020-11-30 01:22:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:56,668 INFO L93 Difference]: Finished difference Result 3308 states and 4068 transitions. [2020-11-30 01:22:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:22:56,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-11-30 01:22:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:22:56,683 INFO L225 Difference]: With dead ends: 3308 [2020-11-30 01:22:56,683 INFO L226 Difference]: Without dead ends: 2145 [2020-11-30 01:22:56,686 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-30 01:22:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2020-11-30 01:22:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2020-11-30 01:22:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2020-11-30 01:22:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2542 transitions. [2020-11-30 01:22:56,759 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2542 transitions. Word has length 97 [2020-11-30 01:22:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:22:56,760 INFO L481 AbstractCegarLoop]: Abstraction has 2145 states and 2542 transitions. [2020-11-30 01:22:56,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:22:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2542 transitions. [2020-11-30 01:22:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-30 01:22:56,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:22:56,764 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:22:56,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:22:56,766 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:22:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:56,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2101789976, now seen corresponding path program 1 times [2020-11-30 01:22:56,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:56,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249932564] [2020-11-30 01:22:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-30 01:22:56,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249932564] [2020-11-30 01:22:56,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827246970] [2020-11-30 01:22:56,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/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-30 01:22:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:56,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:22:56,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-30 01:22:57,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:22:57,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2020-11-30 01:22:57,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564493595] [2020-11-30 01:22:57,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:22:57,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:22:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:22:57,048 INFO L87 Difference]: Start difference. First operand 2145 states and 2542 transitions. Second operand 3 states. [2020-11-30 01:22:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:57,475 INFO L93 Difference]: Finished difference Result 4137 states and 4918 transitions. [2020-11-30 01:22:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:22:57,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-11-30 01:22:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:22:57,486 INFO L225 Difference]: With dead ends: 4137 [2020-11-30 01:22:57,487 INFO L226 Difference]: Without dead ends: 1994 [2020-11-30 01:22:57,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 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-30 01:22:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2020-11-30 01:22:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2020-11-30 01:22:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2020-11-30 01:22:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2323 transitions. [2020-11-30 01:22:57,556 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2323 transitions. Word has length 102 [2020-11-30 01:22:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:22:57,557 INFO L481 AbstractCegarLoop]: Abstraction has 1994 states and 2323 transitions. [2020-11-30 01:22:57,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:22:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2323 transitions. [2020-11-30 01:22:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-30 01:22:57,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:22:57,561 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:22:57,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:22:57,773 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:22:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2111503968, now seen corresponding path program 1 times [2020-11-30 01:22:57,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:57,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497136078] [2020-11-30 01:22:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-30 01:22:57,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497136078] [2020-11-30 01:22:57,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329843940] [2020-11-30 01:22:57,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/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-30 01:22:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:57,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:22:57,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:22:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 01:22:58,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:22:58,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-11-30 01:22:58,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991851599] [2020-11-30 01:22:58,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:22:58,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:58,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:22:58,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:22:58,038 INFO L87 Difference]: Start difference. First operand 1994 states and 2323 transitions. Second operand 3 states. [2020-11-30 01:22:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:58,775 INFO L93 Difference]: Finished difference Result 5117 states and 6001 transitions. [2020-11-30 01:22:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:22:58,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-11-30 01:22:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:22:58,795 INFO L225 Difference]: With dead ends: 5117 [2020-11-30 01:22:58,795 INFO L226 Difference]: Without dead ends: 3265 [2020-11-30 01:22:58,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-30 01:22:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2020-11-30 01:22:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3260. [2020-11-30 01:22:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3260 states. [2020-11-30 01:22:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 3785 transitions. [2020-11-30 01:22:58,874 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 3785 transitions. Word has length 103 [2020-11-30 01:22:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:22:58,876 INFO L481 AbstractCegarLoop]: Abstraction has 3260 states and 3785 transitions. [2020-11-30 01:22:58,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:22:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 3785 transitions. [2020-11-30 01:22:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-11-30 01:22:58,881 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:22:58,881 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-11-30 01:22:59,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:22:59,102 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:22:59,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:22:59,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1381591631, now seen corresponding path program 1 times [2020-11-30 01:22:59,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:22:59,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773740702] [2020-11-30 01:22:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:22:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:22:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 01:22:59,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773740702] [2020-11-30 01:22:59,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:22:59,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:22:59,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840870896] [2020-11-30 01:22:59,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:22:59,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:22:59,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:22:59,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:22:59,196 INFO L87 Difference]: Start difference. First operand 3260 states and 3785 transitions. Second operand 3 states. [2020-11-30 01:22:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:22:59,951 INFO L93 Difference]: Finished difference Result 6653 states and 7748 transitions. [2020-11-30 01:22:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:22:59,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2020-11-30 01:22:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:22:59,972 INFO L225 Difference]: With dead ends: 6653 [2020-11-30 01:22:59,973 INFO L226 Difference]: Without dead ends: 3535 [2020-11-30 01:22:59,977 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-30 01:22:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2020-11-30 01:23:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3535. [2020-11-30 01:23:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2020-11-30 01:23:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 4055 transitions. [2020-11-30 01:23:00,076 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 4055 transitions. Word has length 120 [2020-11-30 01:23:00,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:23:00,077 INFO L481 AbstractCegarLoop]: Abstraction has 3535 states and 4055 transitions. [2020-11-30 01:23:00,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:23:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 4055 transitions. [2020-11-30 01:23:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-11-30 01:23:00,084 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:23:00,084 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-11-30 01:23:00,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:23:00,085 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:23:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash 669826467, now seen corresponding path program 2 times [2020-11-30 01:23:00,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:00,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679185492] [2020-11-30 01:23:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 01:23:00,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679185492] [2020-11-30 01:23:00,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:23:00,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:23:00,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25107322] [2020-11-30 01:23:00,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:23:00,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:23:00,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:23:00,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:23:00,177 INFO L87 Difference]: Start difference. First operand 3535 states and 4055 transitions. Second operand 3 states. [2020-11-30 01:23:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:23:00,700 INFO L93 Difference]: Finished difference Result 6646 states and 7627 transitions. [2020-11-30 01:23:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:23:00,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2020-11-30 01:23:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:23:00,718 INFO L225 Difference]: With dead ends: 6646 [2020-11-30 01:23:00,719 INFO L226 Difference]: Without dead ends: 3110 [2020-11-30 01:23:00,723 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-30 01:23:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2020-11-30 01:23:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3106. [2020-11-30 01:23:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3106 states. [2020-11-30 01:23:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 3441 transitions. [2020-11-30 01:23:00,801 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 3441 transitions. Word has length 120 [2020-11-30 01:23:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:23:00,802 INFO L481 AbstractCegarLoop]: Abstraction has 3106 states and 3441 transitions. [2020-11-30 01:23:00,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:23:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 3441 transitions. [2020-11-30 01:23:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-30 01:23:00,808 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:23:00,808 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-30 01:23:00,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:23:00,809 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:23:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1850519665, now seen corresponding path program 1 times [2020-11-30 01:23:00,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:00,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406644839] [2020-11-30 01:23:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-30 01:23:00,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406644839] [2020-11-30 01:23:00,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:23:00,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:23:00,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174924156] [2020-11-30 01:23:00,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:23:00,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:23:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:23:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:23:00,895 INFO L87 Difference]: Start difference. First operand 3106 states and 3441 transitions. Second operand 3 states. [2020-11-30 01:23:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:23:01,524 INFO L93 Difference]: Finished difference Result 6348 states and 7048 transitions. [2020-11-30 01:23:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:23:01,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2020-11-30 01:23:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:23:01,537 INFO L225 Difference]: With dead ends: 6348 [2020-11-30 01:23:01,538 INFO L226 Difference]: Without dead ends: 2679 [2020-11-30 01:23:01,542 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-30 01:23:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2020-11-30 01:23:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2679. [2020-11-30 01:23:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2679 states. [2020-11-30 01:23:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2679 states and 2931 transitions. [2020-11-30 01:23:01,607 INFO L78 Accepts]: Start accepts. Automaton has 2679 states and 2931 transitions. Word has length 129 [2020-11-30 01:23:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:23:01,608 INFO L481 AbstractCegarLoop]: Abstraction has 2679 states and 2931 transitions. [2020-11-30 01:23:01,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:23:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2679 states and 2931 transitions. [2020-11-30 01:23:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-30 01:23:01,613 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:23:01,614 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:23:01,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:23:01,614 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:23:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:01,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1320048912, now seen corresponding path program 1 times [2020-11-30 01:23:01,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:01,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693960315] [2020-11-30 01:23:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-11-30 01:23:01,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693960315] [2020-11-30 01:23:01,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411494304] [2020-11-30 01:23:01,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/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-30 01:23:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:01,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:23:01,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:23:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-30 01:23:01,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:23:01,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-11-30 01:23:01,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672785322] [2020-11-30 01:23:01,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:23:01,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:23:01,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:23:01,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:23:01,840 INFO L87 Difference]: Start difference. First operand 2679 states and 2931 transitions. Second operand 3 states. [2020-11-30 01:23:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:23:02,373 INFO L93 Difference]: Finished difference Result 3241 states and 3541 transitions. [2020-11-30 01:23:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:23:02,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-11-30 01:23:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:23:02,381 INFO L225 Difference]: With dead ends: 3241 [2020-11-30 01:23:02,381 INFO L226 Difference]: Without dead ends: 1551 [2020-11-30 01:23:02,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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-30 01:23:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2020-11-30 01:23:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2020-11-30 01:23:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2020-11-30 01:23:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 1662 transitions. [2020-11-30 01:23:02,422 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 1662 transitions. Word has length 140 [2020-11-30 01:23:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:23:02,422 INFO L481 AbstractCegarLoop]: Abstraction has 1551 states and 1662 transitions. [2020-11-30 01:23:02,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:23:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1662 transitions. [2020-11-30 01:23:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-30 01:23:02,427 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:23:02,427 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-30 01:23:02,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-30 01:23:02,646 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:23:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2045213602, now seen corresponding path program 1 times [2020-11-30 01:23:02,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:02,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558573212] [2020-11-30 01:23:02,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 01:23:02,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558573212] [2020-11-30 01:23:02,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:23:02,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:23:02,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176837281] [2020-11-30 01:23:02,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:23:02,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:23:02,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:23:02,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:23:02,937 INFO L87 Difference]: Start difference. First operand 1551 states and 1662 transitions. Second operand 5 states. [2020-11-30 01:23:04,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:23:04,196 INFO L93 Difference]: Finished difference Result 3264 states and 3497 transitions. [2020-11-30 01:23:04,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:23:04,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2020-11-30 01:23:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:23:04,203 INFO L225 Difference]: With dead ends: 3264 [2020-11-30 01:23:04,203 INFO L226 Difference]: Without dead ends: 1143 [2020-11-30 01:23:04,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:23:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2020-11-30 01:23:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 988. [2020-11-30 01:23:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2020-11-30 01:23:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1028 transitions. [2020-11-30 01:23:04,230 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1028 transitions. Word has length 180 [2020-11-30 01:23:04,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:23:04,230 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 1028 transitions. [2020-11-30 01:23:04,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:23:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1028 transitions. [2020-11-30 01:23:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-11-30 01:23:04,234 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:23:04,234 INFO L422 BasicCegarLoop]: trace histogram [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, 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-30 01:23:04,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:23:04,235 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:23:04,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:04,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1793268057, now seen corresponding path program 1 times [2020-11-30 01:23:04,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:04,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223976445] [2020-11-30 01:23:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 118 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:23:04,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223976445] [2020-11-30 01:23:04,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099290059] [2020-11-30 01:23:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:23:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:04,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 01:23:04,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:23:04,694 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:23:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 162 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:23:04,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:23:04,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-11-30 01:23:04,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173489159] [2020-11-30 01:23:04,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:23:04,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:23:04,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:23:04,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:23:04,800 INFO L87 Difference]: Start difference. First operand 988 states and 1028 transitions. Second operand 9 states. [2020-11-30 01:23:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:23:06,231 INFO L93 Difference]: Finished difference Result 1857 states and 1935 transitions. [2020-11-30 01:23:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:23:06,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2020-11-30 01:23:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:23:06,235 INFO L225 Difference]: With dead ends: 1857 [2020-11-30 01:23:06,235 INFO L226 Difference]: Without dead ends: 720 [2020-11-30 01:23:06,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:23:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-11-30 01:23:06,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 706. [2020-11-30 01:23:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-11-30 01:23:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 731 transitions. [2020-11-30 01:23:06,252 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 731 transitions. Word has length 187 [2020-11-30 01:23:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:23:06,253 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 731 transitions. [2020-11-30 01:23:06,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:23:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 731 transitions. [2020-11-30 01:23:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-11-30 01:23:06,256 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:23:06,257 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-11-30 01:23:06,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:23:06,486 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:23:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:06,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1136279118, now seen corresponding path program 1 times [2020-11-30 01:23:06,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:06,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185766205] [2020-11-30 01:23:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:23:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:23:06,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185766205] [2020-11-30 01:23:06,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:23:06,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:23:06,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962238423] [2020-11-30 01:23:06,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:23:06,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:23:06,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:23:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:23:06,666 INFO L87 Difference]: Start difference. First operand 706 states and 731 transitions. Second operand 4 states. [2020-11-30 01:23:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:23:07,458 INFO L93 Difference]: Finished difference Result 1410 states and 1470 transitions. [2020-11-30 01:23:07,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:23:07,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2020-11-30 01:23:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:23:07,463 INFO L225 Difference]: With dead ends: 1410 [2020-11-30 01:23:07,463 INFO L226 Difference]: Without dead ends: 846 [2020-11-30 01:23:07,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:23:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2020-11-30 01:23:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2020-11-30 01:23:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2020-11-30 01:23:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 874 transitions. [2020-11-30 01:23:07,485 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 874 transitions. Word has length 222 [2020-11-30 01:23:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:23:07,486 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 874 transitions. [2020-11-30 01:23:07,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:23:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 874 transitions. [2020-11-30 01:23:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-11-30 01:23:07,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:23:07,491 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:23:07,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 01:23:07,492 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:23:07,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:23:07,492 INFO L82 PathProgramCache]: Analyzing trace with hash -273117095, now seen corresponding path program 1 times [2020-11-30 01:23:07,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:23:07,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655408872] [2020-11-30 01:23:07,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:23:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:07,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:23:07,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:23:07,696 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:23:07,696 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:23:07,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 01:23:07,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:23:07 BoogieIcfgContainer [2020-11-30 01:23:07,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:23:07,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:23:07,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:23:07,987 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:23:07,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:22:49" (3/4) ... [2020-11-30 01:23:07,989 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:23:08,250 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3ebe43cc-9c06-4333-9bc7-19af92de4b0c/bin/uautomizer/witness.graphml [2020-11-30 01:23:08,250 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:23:08,253 INFO L168 Benchmark]: Toolchain (without parser) took 21147.64 ms. Allocated memory was 104.9 MB in the beginning and 394.3 MB in the end (delta: 289.4 MB). Free memory was 75.8 MB in the beginning and 260.2 MB in the end (delta: -184.4 MB). Peak memory consumption was 104.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:08,254 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 104.9 MB. Free memory is still 62.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:23:08,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.32 ms. Allocated memory was 104.9 MB in the beginning and 146.8 MB in the end (delta: 41.9 MB). Free memory was 75.4 MB in the beginning and 107.6 MB in the end (delta: -32.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:08,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.84 ms. Allocated memory is still 146.8 MB. Free memory was 107.6 MB in the beginning and 102.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:08,259 INFO L168 Benchmark]: Boogie Preprocessor took 123.44 ms. Allocated memory is still 146.8 MB. Free memory was 102.0 MB in the beginning and 97.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:08,259 INFO L168 Benchmark]: RCFGBuilder took 1687.77 ms. Allocated memory is still 146.8 MB. Free memory was 97.8 MB in the beginning and 61.3 MB in the end (delta: 36.6 MB). Peak memory consumption was 50.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:08,259 INFO L168 Benchmark]: TraceAbstraction took 18126.40 ms. Allocated memory was 146.8 MB in the beginning and 394.3 MB in the end (delta: 247.5 MB). Free memory was 61.3 MB in the beginning and 294.7 MB in the end (delta: -233.5 MB). Peak memory consumption was 17.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:08,260 INFO L168 Benchmark]: Witness Printer took 264.28 ms. Allocated memory is still 394.3 MB. Free memory was 294.7 MB in the beginning and 260.2 MB in the end (delta: 34.5 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:23:08,262 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.41 ms. Allocated memory is still 104.9 MB. Free memory is still 62.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 818.32 ms. Allocated memory was 104.9 MB in the beginning and 146.8 MB in the end (delta: 41.9 MB). Free memory was 75.4 MB in the beginning and 107.6 MB in the end (delta: -32.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 117.84 ms. Allocated memory is still 146.8 MB. Free memory was 107.6 MB in the beginning and 102.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 123.44 ms. Allocated memory is still 146.8 MB. Free memory was 102.0 MB in the beginning and 97.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1687.77 ms. Allocated memory is still 146.8 MB. Free memory was 97.8 MB in the beginning and 61.3 MB in the end (delta: 36.6 MB). Peak memory consumption was 50.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18126.40 ms. Allocated memory was 146.8 MB in the beginning and 394.3 MB in the end (delta: 247.5 MB). Free memory was 61.3 MB in the beginning and 294.7 MB in the end (delta: -233.5 MB). Peak memory consumption was 17.1 MB. Max. memory is 16.1 GB. * Witness Printer took 264.28 ms. Allocated memory is still 394.3 MB. Free memory was 294.7 MB in the beginning and 260.2 MB in the end (delta: 34.5 MB). Peak memory consumption was 33.6 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 TRUE ((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)) [L159] a11 = 1 [L160] a19 = 1 [L161] a28 = 10 [L162] a25 = 1 [L163] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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_label45.c", 4, "reach_error") VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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: 17.7s, OverallIterations: 15, TraceHistogramMax: 5, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1372 SDtfs, 2739 SDslu, 251 SDs, 0 SdLazy, 6761 SolverSat, 783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 764 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3535occurred 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: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 184 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2703 NumberOfCodeBlocks, 2703 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2454 ConstructedInterpolants, 0 QuantifiedInterpolants, 1131379 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1711 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 20 InterpolantComputations, 13 PerfectInterpolantSequences, 1217/1300 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...