./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3 --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 37db28f3e8ed686c32be65a216c3f55715fa1acd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-15 19:23:17,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-15 19:23:17,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-15 19:23:17,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-15 19:23:17,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-15 19:23:17,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-15 19:23:17,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-15 19:23:17,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-15 19:23:17,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-15 19:23:17,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-15 19:23:17,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-15 19:23:17,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-15 19:23:17,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-15 19:23:17,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-15 19:23:17,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-15 19:23:17,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-15 19:23:17,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-15 19:23:17,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-15 19:23:17,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-15 19:23:17,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-15 19:23:17,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-15 19:23:17,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-15 19:23:17,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-15 19:23:17,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-15 19:23:17,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-15 19:23:17,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-15 19:23:17,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-15 19:23:17,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-15 19:23:17,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-15 19:23:17,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-15 19:23:17,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-15 19:23:17,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-15 19:23:17,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-15 19:23:17,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-15 19:23:17,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-15 19:23:17,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-15 19:23:17,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-15 19:23:17,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-15 19:23:17,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-15 19:23:17,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-15 19:23:17,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-15 19:23:17,927 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-15 19:23:17,974 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-15 19:23:17,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-15 19:23:17,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-15 19:23:17,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-15 19:23:17,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-15 19:23:17,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-15 19:23:17,986 INFO L138 SettingsManager]: * Use SBE=true [2021-10-15 19:23:17,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-15 19:23:17,986 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-15 19:23:17,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-15 19:23:17,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-15 19:23:17,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-15 19:23:17,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-15 19:23:17,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-15 19:23:17,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-15 19:23:17,990 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-15 19:23:17,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-15 19:23:17,991 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-15 19:23:17,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-15 19:23:17,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-15 19:23:17,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-15 19:23:17,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-15 19:23:17,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 19:23:17,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-15 19:23:17,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-15 19:23:17,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-15 19:23:17,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-15 19:23:17,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-15 19:23:17,994 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-15 19:23:17,997 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-15 19:23:17,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-15 19:23:17,997 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-15 19:23:17,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3 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 -> 37db28f3e8ed686c32be65a216c3f55715fa1acd [2021-10-15 19:23:18,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-15 19:23:18,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-15 19:23:18,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-15 19:23:18,385 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-15 19:23:18,386 INFO L275 PluginConnector]: CDTParser initialized [2021-10-15 19:23:18,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2021-10-15 19:23:18,483 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/data/cafb63b14/763a218190b84f7da7fc1a919391ec87/FLAGe424a99a3 [2021-10-15 19:23:19,202 INFO L306 CDTParser]: Found 1 translation units. [2021-10-15 19:23:19,203 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2021-10-15 19:23:19,247 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/data/cafb63b14/763a218190b84f7da7fc1a919391ec87/FLAGe424a99a3 [2021-10-15 19:23:19,421 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/data/cafb63b14/763a218190b84f7da7fc1a919391ec87 [2021-10-15 19:23:19,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-15 19:23:19,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-15 19:23:19,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-15 19:23:19,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-15 19:23:19,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-15 19:23:19,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 07:23:19" (1/1) ... [2021-10-15 19:23:19,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6e47d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:19, skipping insertion in model container [2021-10-15 19:23:19,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 07:23:19" (1/1) ... [2021-10-15 19:23:19,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-15 19:23:19,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-15 19:23:20,036 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2021-10-15 19:23:20,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 19:23:20,091 INFO L203 MainTranslator]: Completed pre-run [2021-10-15 19:23:20,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2021-10-15 19:23:20,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 19:23:20,264 INFO L208 MainTranslator]: Completed translation [2021-10-15 19:23:20,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20 WrapperNode [2021-10-15 19:23:20,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-15 19:23:20,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-15 19:23:20,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-15 19:23:20,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-15 19:23:20,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-15 19:23:20,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-15 19:23:20,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-15 19:23:20,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-15 19:23:20,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-15 19:23:20,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-15 19:23:20,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-15 19:23:20,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-15 19:23:20,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (1/1) ... [2021-10-15 19:23:20,504 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 19:23:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:23:20,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-15 19:23:20,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-15 19:23:20,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-15 19:23:20,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-15 19:23:20,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-15 19:23:20,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-15 19:23:21,991 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-15 19:23:21,992 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-15 19:23:21,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:23:21 BoogieIcfgContainer [2021-10-15 19:23:21,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-15 19:23:21,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-15 19:23:21,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-15 19:23:22,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-15 19:23:22,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 07:23:19" (1/3) ... [2021-10-15 19:23:22,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191561af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 07:23:22, skipping insertion in model container [2021-10-15 19:23:22,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:23:20" (2/3) ... [2021-10-15 19:23:22,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191561af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 07:23:22, skipping insertion in model container [2021-10-15 19:23:22,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:23:21" (3/3) ... [2021-10-15 19:23:22,009 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label57.c [2021-10-15 19:23:22,017 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-15 19:23:22,017 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-15 19:23:22,094 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-15 19:23:22,105 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-15 19:23:22,108 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-15 19:23:22,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 198 places, 327 transitions, 654 flow [2021-10-15 19:23:22,289 INFO L129 PetriNetUnfolder]: 130/327 cut-off events. [2021-10-15 19:23:22,289 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 19:23:22,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 327 events. 130/327 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 205 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 0. Up to 67 conditions per place. [2021-10-15 19:23:22,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 327 transitions, 654 flow [2021-10-15 19:23:22,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 322 transitions, 644 flow [2021-10-15 19:23:22,357 INFO L129 PetriNetUnfolder]: 73/159 cut-off events. [2021-10-15 19:23:22,357 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 19:23:22,358 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:22,359 INFO L254 CegarLoopForPetriNet]: 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] [2021-10-15 19:23:22,359 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:22,380 INFO L82 PathProgramCache]: Analyzing trace with hash 560185543, now seen corresponding path program 1 times [2021-10-15 19:23:22,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:22,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116211271] [2021-10-15 19:23:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:22,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:23:22,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:22,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116211271] [2021-10-15 19:23:22,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116211271] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:22,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:23:22,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 19:23:22,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877260628] [2021-10-15 19:23:22,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:22,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:22,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:22,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:23:22,914 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:22,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 322 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:22,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:22,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:22,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:24,010 INFO L129 PetriNetUnfolder]: 146/471 cut-off events. [2021-10-15 19:23:24,011 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 19:23:24,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 471 events. 146/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 640 event pairs, 0 based on Foata normal form. 61/326 useless extension candidates. Maximal degree in co-relation 1. Up to 258 conditions per place. [2021-10-15 19:23:24,019 INFO L132 encePairwiseOnDemand]: 138/327 looper letters, 307 selfloop transitions, 63 changer transitions 91/467 dead transitions. [2021-10-15 19:23:24,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 467 transitions, 1856 flow [2021-10-15 19:23:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2021-10-15 19:23:24,047 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6085626911314985 [2021-10-15 19:23:24,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 597 transitions. [2021-10-15 19:23:24,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 597 transitions. [2021-10-15 19:23:24,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:24,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 597 transitions. [2021-10-15 19:23:24,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:24,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:24,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:24,084 INFO L186 Difference]: Start difference. First operand has 195 places, 322 transitions, 644 flow. Second operand 3 states and 597 transitions. [2021-10-15 19:23:24,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 467 transitions, 1856 flow [2021-10-15 19:23:24,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 467 transitions, 1856 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-15 19:23:24,113 INFO L242 Difference]: Finished difference. Result has 199 places, 249 transitions, 856 flow [2021-10-15 19:23:24,115 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=199, PETRI_TRANSITIONS=249} [2021-10-15 19:23:24,117 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, 4 predicate places. [2021-10-15 19:23:24,117 INFO L470 AbstractCegarLoop]: Abstraction has has 199 places, 249 transitions, 856 flow [2021-10-15 19:23:24,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:24,118 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:24,119 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:24,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-15 19:23:24,120 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash -723946337, now seen corresponding path program 1 times [2021-10-15 19:23:24,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:24,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020874804] [2021-10-15 19:23:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:24,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:23:24,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:24,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020874804] [2021-10-15 19:23:24,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020874804] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:24,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:23:24,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 19:23:24,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645227329] [2021-10-15 19:23:24,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:24,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:23:24,247 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:24,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 249 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:24,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:24,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:24,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:25,102 INFO L129 PetriNetUnfolder]: 194/721 cut-off events. [2021-10-15 19:23:25,103 INFO L130 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2021-10-15 19:23:25,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 721 events. 194/721 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1596 event pairs, 0 based on Foata normal form. 36/757 useless extension candidates. Maximal degree in co-relation 655. Up to 433 conditions per place. [2021-10-15 19:23:25,114 INFO L132 encePairwiseOnDemand]: 259/327 looper letters, 345 selfloop transitions, 104 changer transitions 0/455 dead transitions. [2021-10-15 19:23:25,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 455 transitions, 2412 flow [2021-10-15 19:23:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2021-10-15 19:23:25,120 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4240570846075433 [2021-10-15 19:23:25,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2021-10-15 19:23:25,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2021-10-15 19:23:25,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:25,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2021-10-15 19:23:25,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:25,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:25,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:25,134 INFO L186 Difference]: Start difference. First operand has 199 places, 249 transitions, 856 flow. Second operand 3 states and 416 transitions. [2021-10-15 19:23:25,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 455 transitions, 2412 flow [2021-10-15 19:23:25,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 455 transitions, 2198 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:23:25,178 INFO L242 Difference]: Finished difference. Result has 141 places, 328 transitions, 1644 flow [2021-10-15 19:23:25,179 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1644, PETRI_PLACES=141, PETRI_TRANSITIONS=328} [2021-10-15 19:23:25,187 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -54 predicate places. [2021-10-15 19:23:25,188 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 328 transitions, 1644 flow [2021-10-15 19:23:25,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:25,188 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:25,189 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:25,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-15 19:23:25,190 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:25,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1663817621, now seen corresponding path program 1 times [2021-10-15 19:23:25,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:25,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318420909] [2021-10-15 19:23:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:25,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:23:25,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:25,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318420909] [2021-10-15 19:23:25,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318420909] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:25,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:23:25,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 19:23:25,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353206469] [2021-10-15 19:23:25,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:25,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:25,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:23:25,343 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:25,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 328 transitions, 1644 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:25,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:25,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:25,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:26,350 INFO L129 PetriNetUnfolder]: 316/1236 cut-off events. [2021-10-15 19:23:26,350 INFO L130 PetriNetUnfolder]: For 687/687 co-relation queries the response was YES. [2021-10-15 19:23:26,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 1236 events. 316/1236 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4154 event pairs, 0 based on Foata normal form. 24/1260 useless extension candidates. Maximal degree in co-relation 1228. Up to 775 conditions per place. [2021-10-15 19:23:26,363 INFO L132 encePairwiseOnDemand]: 259/327 looper letters, 418 selfloop transitions, 153 changer transitions 0/577 dead transitions. [2021-10-15 19:23:26,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 577 transitions, 3872 flow [2021-10-15 19:23:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2021-10-15 19:23:26,367 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4240570846075433 [2021-10-15 19:23:26,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2021-10-15 19:23:26,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2021-10-15 19:23:26,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:26,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2021-10-15 19:23:26,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:26,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:26,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:26,376 INFO L186 Difference]: Start difference. First operand has 141 places, 328 transitions, 1644 flow. Second operand 3 states and 416 transitions. [2021-10-15 19:23:26,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 577 transitions, 3872 flow [2021-10-15 19:23:26,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 577 transitions, 3564 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:23:26,415 INFO L242 Difference]: Finished difference. Result has 143 places, 450 transitions, 3042 flow [2021-10-15 19:23:26,416 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3042, PETRI_PLACES=143, PETRI_TRANSITIONS=450} [2021-10-15 19:23:26,416 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -52 predicate places. [2021-10-15 19:23:26,416 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 450 transitions, 3042 flow [2021-10-15 19:23:26,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:26,417 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:26,417 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:26,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-15 19:23:26,418 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:26,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:26,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1322420875, now seen corresponding path program 1 times [2021-10-15 19:23:26,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:26,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720928861] [2021-10-15 19:23:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:26,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:23:26,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:26,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720928861] [2021-10-15 19:23:26,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720928861] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:26,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:23:26,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 19:23:26,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695260749] [2021-10-15 19:23:26,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:26,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:23:26,526 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:26,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 450 transitions, 3042 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:26,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:26,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:26,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:27,549 INFO L129 PetriNetUnfolder]: 304/1224 cut-off events. [2021-10-15 19:23:27,549 INFO L130 PetriNetUnfolder]: For 1361/1361 co-relation queries the response was YES. [2021-10-15 19:23:27,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3453 conditions, 1224 events. 304/1224 cut-off events. For 1361/1361 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3990 event pairs, 0 based on Foata normal form. 12/1236 useless extension candidates. Maximal degree in co-relation 893. Up to 768 conditions per place. [2021-10-15 19:23:27,560 INFO L132 encePairwiseOnDemand]: 278/327 looper letters, 402 selfloop transitions, 157 changer transitions 0/565 dead transitions. [2021-10-15 19:23:27,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 565 transitions, 4306 flow [2021-10-15 19:23:27,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2021-10-15 19:23:27,563 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.38634046890927626 [2021-10-15 19:23:27,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2021-10-15 19:23:27,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2021-10-15 19:23:27,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:27,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2021-10-15 19:23:27,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:27,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:27,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:27,571 INFO L186 Difference]: Start difference. First operand has 143 places, 450 transitions, 3042 flow. Second operand 3 states and 379 transitions. [2021-10-15 19:23:27,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 565 transitions, 4306 flow [2021-10-15 19:23:27,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 565 transitions, 4012 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:23:27,605 INFO L242 Difference]: Finished difference. Result has 143 places, 438 transitions, 2954 flow [2021-10-15 19:23:27,606 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=2640, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2954, PETRI_PLACES=143, PETRI_TRANSITIONS=438} [2021-10-15 19:23:27,606 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -52 predicate places. [2021-10-15 19:23:27,607 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 438 transitions, 2954 flow [2021-10-15 19:23:27,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:27,607 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:27,608 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:27,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-15 19:23:27,608 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:27,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:27,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1157037562, now seen corresponding path program 1 times [2021-10-15 19:23:27,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:27,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366583603] [2021-10-15 19:23:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:27,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:23:27,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:27,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366583603] [2021-10-15 19:23:27,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366583603] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:27,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:23:27,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 19:23:27,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511474636] [2021-10-15 19:23:27,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:27,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:27,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:27,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:23:27,733 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:27,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 438 transitions, 2954 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:27,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:27,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:27,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:28,916 INFO L129 PetriNetUnfolder]: 340/1653 cut-off events. [2021-10-15 19:23:28,916 INFO L130 PetriNetUnfolder]: For 1596/1596 co-relation queries the response was YES. [2021-10-15 19:23:28,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4412 conditions, 1653 events. 340/1653 cut-off events. For 1596/1596 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6384 event pairs, 0 based on Foata normal form. 48/1701 useless extension candidates. Maximal degree in co-relation 2188. Up to 1102 conditions per place. [2021-10-15 19:23:28,929 INFO L132 encePairwiseOnDemand]: 270/327 looper letters, 456 selfloop transitions, 139 changer transitions 0/601 dead transitions. [2021-10-15 19:23:28,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 601 transitions, 4676 flow [2021-10-15 19:23:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2021-10-15 19:23:28,933 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.40468909276248727 [2021-10-15 19:23:28,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2021-10-15 19:23:28,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2021-10-15 19:23:28,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:28,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2021-10-15 19:23:28,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:28,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:28,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:28,940 INFO L186 Difference]: Start difference. First operand has 143 places, 438 transitions, 2954 flow. Second operand 3 states and 397 transitions. [2021-10-15 19:23:28,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 601 transitions, 4676 flow [2021-10-15 19:23:28,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 601 transitions, 4506 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:23:28,988 INFO L242 Difference]: Finished difference. Result has 146 places, 474 transitions, 3750 flow [2021-10-15 19:23:28,989 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=2797, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3750, PETRI_PLACES=146, PETRI_TRANSITIONS=474} [2021-10-15 19:23:28,989 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -49 predicate places. [2021-10-15 19:23:28,989 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 474 transitions, 3750 flow [2021-10-15 19:23:28,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:28,990 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:28,991 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:28,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-15 19:23:28,991 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:28,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1881650894, now seen corresponding path program 1 times [2021-10-15 19:23:28,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:28,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809907472] [2021-10-15 19:23:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:28,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:23:29,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:29,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809907472] [2021-10-15 19:23:29,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809907472] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:29,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:23:29,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:23:29,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856873927] [2021-10-15 19:23:29,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:23:29,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:23:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:23:29,136 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:29,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 474 transitions, 3750 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:29,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:29,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:29,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:30,677 INFO L129 PetriNetUnfolder]: 370/2076 cut-off events. [2021-10-15 19:23:30,678 INFO L130 PetriNetUnfolder]: For 2494/2494 co-relation queries the response was YES. [2021-10-15 19:23:30,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5709 conditions, 2076 events. 370/2076 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 9297 event pairs, 0 based on Foata normal form. 18/2094 useless extension candidates. Maximal degree in co-relation 1037. Up to 714 conditions per place. [2021-10-15 19:23:30,694 INFO L132 encePairwiseOnDemand]: 264/327 looper letters, 508 selfloop transitions, 244 changer transitions 0/758 dead transitions. [2021-10-15 19:23:30,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 758 transitions, 6086 flow [2021-10-15 19:23:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 19:23:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-15 19:23:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2021-10-15 19:23:30,699 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4350152905198777 [2021-10-15 19:23:30,699 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2021-10-15 19:23:30,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2021-10-15 19:23:30,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:30,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2021-10-15 19:23:30,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:30,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:30,710 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:30,711 INFO L186 Difference]: Start difference. First operand has 146 places, 474 transitions, 3750 flow. Second operand 4 states and 569 transitions. [2021-10-15 19:23:30,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 758 transitions, 6086 flow [2021-10-15 19:23:30,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 758 transitions, 5706 flow, removed 32 selfloop flow, removed 2 redundant places. [2021-10-15 19:23:30,752 INFO L242 Difference]: Finished difference. Result has 149 places, 504 transitions, 4522 flow [2021-10-15 19:23:30,753 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=3371, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4522, PETRI_PLACES=149, PETRI_TRANSITIONS=504} [2021-10-15 19:23:30,754 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -46 predicate places. [2021-10-15 19:23:30,754 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 504 transitions, 4522 flow [2021-10-15 19:23:30,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:30,754 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:30,755 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:30,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-15 19:23:30,755 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1608862799, now seen corresponding path program 1 times [2021-10-15 19:23:30,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:30,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049366065] [2021-10-15 19:23:30,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:30,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:23:30,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:30,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049366065] [2021-10-15 19:23:30,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049366065] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:30,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:23:30,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:23:30,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947787225] [2021-10-15 19:23:30,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:30,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:30,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:30,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:23:30,934 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:30,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 504 transitions, 4522 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:30,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:30,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:30,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:32,312 INFO L129 PetriNetUnfolder]: 308/2014 cut-off events. [2021-10-15 19:23:32,313 INFO L130 PetriNetUnfolder]: For 3464/3464 co-relation queries the response was YES. [2021-10-15 19:23:32,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5474 conditions, 2014 events. 308/2014 cut-off events. For 3464/3464 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 9240 event pairs, 0 based on Foata normal form. 62/2076 useless extension candidates. Maximal degree in co-relation 1770. Up to 1395 conditions per place. [2021-10-15 19:23:32,331 INFO L132 encePairwiseOnDemand]: 261/327 looper letters, 457 selfloop transitions, 106 changer transitions 0/569 dead transitions. [2021-10-15 19:23:32,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 569 transitions, 5181 flow [2021-10-15 19:23:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2021-10-15 19:23:32,335 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.417940876656473 [2021-10-15 19:23:32,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2021-10-15 19:23:32,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2021-10-15 19:23:32,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:32,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2021-10-15 19:23:32,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:32,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:32,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:32,342 INFO L186 Difference]: Start difference. First operand has 149 places, 504 transitions, 4522 flow. Second operand 3 states and 410 transitions. [2021-10-15 19:23:32,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 569 transitions, 5181 flow [2021-10-15 19:23:32,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 569 transitions, 5022 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:23:32,381 INFO L242 Difference]: Finished difference. Result has 150 places, 442 transitions, 3854 flow [2021-10-15 19:23:32,382 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=3642, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3854, PETRI_PLACES=150, PETRI_TRANSITIONS=442} [2021-10-15 19:23:32,382 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -45 predicate places. [2021-10-15 19:23:32,383 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 442 transitions, 3854 flow [2021-10-15 19:23:32,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:32,383 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:32,384 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:32,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-15 19:23:32,384 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:32,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:32,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2091244910, now seen corresponding path program 1 times [2021-10-15 19:23:32,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:32,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409217431] [2021-10-15 19:23:32,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:32,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-10-15 19:23:32,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:32,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409217431] [2021-10-15 19:23:32,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409217431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:32,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:23:32,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 19:23:32,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327134421] [2021-10-15 19:23:32,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:32,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:32,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:32,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:23:32,510 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:32,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 442 transitions, 3854 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:32,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:32,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:32,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:33,765 INFO L129 PetriNetUnfolder]: 350/2187 cut-off events. [2021-10-15 19:23:33,765 INFO L130 PetriNetUnfolder]: For 3170/3170 co-relation queries the response was YES. [2021-10-15 19:23:33,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6065 conditions, 2187 events. 350/2187 cut-off events. For 3170/3170 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 10357 event pairs, 0 based on Foata normal form. 1/2188 useless extension candidates. Maximal degree in co-relation 2204. Up to 1211 conditions per place. [2021-10-15 19:23:33,784 INFO L132 encePairwiseOnDemand]: 270/327 looper letters, 440 selfloop transitions, 165 changer transitions 0/611 dead transitions. [2021-10-15 19:23:33,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 611 transitions, 5781 flow [2021-10-15 19:23:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2021-10-15 19:23:33,788 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4057084607543323 [2021-10-15 19:23:33,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2021-10-15 19:23:33,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2021-10-15 19:23:33,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:33,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2021-10-15 19:23:33,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:33,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:33,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:33,796 INFO L186 Difference]: Start difference. First operand has 150 places, 442 transitions, 3854 flow. Second operand 3 states and 398 transitions. [2021-10-15 19:23:33,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 611 transitions, 5781 flow [2021-10-15 19:23:33,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 611 transitions, 5670 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:23:33,841 INFO L242 Difference]: Finished difference. Result has 153 places, 484 transitions, 4952 flow [2021-10-15 19:23:33,842 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=3748, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4952, PETRI_PLACES=153, PETRI_TRANSITIONS=484} [2021-10-15 19:23:33,843 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -42 predicate places. [2021-10-15 19:23:33,843 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 484 transitions, 4952 flow [2021-10-15 19:23:33,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:33,844 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:33,844 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:33,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-15 19:23:33,845 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash -734135293, now seen corresponding path program 1 times [2021-10-15 19:23:33,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:33,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359161309] [2021-10-15 19:23:33,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:33,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:23:33,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:33,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359161309] [2021-10-15 19:23:33,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359161309] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 19:23:33,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909521236] [2021-10-15 19:23:33,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:33,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 19:23:33,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:23:33,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 19:23:33,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-15 19:23:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:34,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-15 19:23:34,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 19:23:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-15 19:23:34,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909521236] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:34,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 19:23:34,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-15 19:23:34,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859562935] [2021-10-15 19:23:34,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:34,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:34,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:34,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-15 19:23:34,709 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:34,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 484 transitions, 4952 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:34,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:34,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:34,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:36,134 INFO L129 PetriNetUnfolder]: 325/2424 cut-off events. [2021-10-15 19:23:36,134 INFO L130 PetriNetUnfolder]: For 5918/5918 co-relation queries the response was YES. [2021-10-15 19:23:36,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6738 conditions, 2424 events. 325/2424 cut-off events. For 5918/5918 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 12606 event pairs, 0 based on Foata normal form. 110/2534 useless extension candidates. Maximal degree in co-relation 2912. Up to 1284 conditions per place. [2021-10-15 19:23:36,151 INFO L132 encePairwiseOnDemand]: 261/327 looper letters, 369 selfloop transitions, 94 changer transitions 117/586 dead transitions. [2021-10-15 19:23:36,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 586 transitions, 6104 flow [2021-10-15 19:23:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2021-10-15 19:23:36,187 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.417940876656473 [2021-10-15 19:23:36,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2021-10-15 19:23:36,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2021-10-15 19:23:36,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:36,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2021-10-15 19:23:36,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:36,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:36,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:36,194 INFO L186 Difference]: Start difference. First operand has 153 places, 484 transitions, 4952 flow. Second operand 3 states and 410 transitions. [2021-10-15 19:23:36,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 586 transitions, 6104 flow [2021-10-15 19:23:36,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 586 transitions, 5790 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:23:36,234 INFO L242 Difference]: Finished difference. Result has 155 places, 342 transitions, 3156 flow [2021-10-15 19:23:36,235 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=3756, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3156, PETRI_PLACES=155, PETRI_TRANSITIONS=342} [2021-10-15 19:23:36,235 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -40 predicate places. [2021-10-15 19:23:36,236 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 342 transitions, 3156 flow [2021-10-15 19:23:36,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:36,236 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:36,236 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:36,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-15 19:23:36,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-15 19:23:36,452 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:36,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1137952742, now seen corresponding path program 1 times [2021-10-15 19:23:36,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:36,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849685175] [2021-10-15 19:23:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:36,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:23:36,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:36,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849685175] [2021-10-15 19:23:36,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849685175] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 19:23:36,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878420744] [2021-10-15 19:23:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:36,578 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 19:23:36,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:23:36,588 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 19:23:36,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-15 19:23:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:36,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-15 19:23:36,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 19:23:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-10-15 19:23:37,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878420744] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:37,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 19:23:37,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-15 19:23:37,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76910779] [2021-10-15 19:23:37,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:37,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:37,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:37,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-15 19:23:37,318 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:37,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 342 transitions, 3156 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:37,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:37,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:37,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:38,698 INFO L129 PetriNetUnfolder]: 204/2696 cut-off events. [2021-10-15 19:23:38,698 INFO L130 PetriNetUnfolder]: For 4293/4293 co-relation queries the response was YES. [2021-10-15 19:23:38,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 2696 events. 204/2696 cut-off events. For 4293/4293 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 16104 event pairs, 0 based on Foata normal form. 85/2781 useless extension candidates. Maximal degree in co-relation 4032. Up to 1414 conditions per place. [2021-10-15 19:23:38,730 INFO L132 encePairwiseOnDemand]: 291/327 looper letters, 402 selfloop transitions, 57 changer transitions 0/465 dead transitions. [2021-10-15 19:23:38,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 465 transitions, 4267 flow [2021-10-15 19:23:38,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2021-10-15 19:23:38,740 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.36187563710499493 [2021-10-15 19:23:38,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2021-10-15 19:23:38,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2021-10-15 19:23:38,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:38,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2021-10-15 19:23:38,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:38,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:38,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:38,753 INFO L186 Difference]: Start difference. First operand has 155 places, 342 transitions, 3156 flow. Second operand 3 states and 355 transitions. [2021-10-15 19:23:38,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 465 transitions, 4267 flow [2021-10-15 19:23:38,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 465 transitions, 4085 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:23:38,786 INFO L242 Difference]: Finished difference. Result has 157 places, 338 transitions, 3303 flow [2021-10-15 19:23:38,788 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3303, PETRI_PLACES=157, PETRI_TRANSITIONS=338} [2021-10-15 19:23:38,789 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -38 predicate places. [2021-10-15 19:23:38,789 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 338 transitions, 3303 flow [2021-10-15 19:23:38,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:38,790 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:38,790 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:38,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-15 19:23:39,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-15 19:23:39,015 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:39,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:39,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1546525125, now seen corresponding path program 1 times [2021-10-15 19:23:39,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:39,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252211277] [2021-10-15 19:23:39,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:39,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:39,125 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 94 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-10-15 19:23:39,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:39,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252211277] [2021-10-15 19:23:39,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252211277] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 19:23:39,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141923937] [2021-10-15 19:23:39,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:39,126 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 19:23:39,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:23:39,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 19:23:39,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-15 19:23:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:39,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-15 19:23:39,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 19:23:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-10-15 19:23:40,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141923937] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:40,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 19:23:40,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-10-15 19:23:40,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056092291] [2021-10-15 19:23:40,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:23:40,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:23:40,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-15 19:23:40,120 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:40,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 338 transitions, 3303 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:40,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:40,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:40,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:41,983 INFO L129 PetriNetUnfolder]: 234/3381 cut-off events. [2021-10-15 19:23:41,983 INFO L130 PetriNetUnfolder]: For 4920/4920 co-relation queries the response was YES. [2021-10-15 19:23:41,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8205 conditions, 3381 events. 234/3381 cut-off events. For 4920/4920 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 22431 event pairs, 0 based on Foata normal form. 42/3423 useless extension candidates. Maximal degree in co-relation 4800. Up to 1776 conditions per place. [2021-10-15 19:23:41,996 INFO L132 encePairwiseOnDemand]: 283/327 looper letters, 483 selfloop transitions, 133 changer transitions 0/622 dead transitions. [2021-10-15 19:23:41,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 622 transitions, 5474 flow [2021-10-15 19:23:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 19:23:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-15 19:23:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2021-10-15 19:23:42,001 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.38685015290519875 [2021-10-15 19:23:42,002 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2021-10-15 19:23:42,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2021-10-15 19:23:42,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:42,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2021-10-15 19:23:42,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:42,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:42,011 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:42,011 INFO L186 Difference]: Start difference. First operand has 157 places, 338 transitions, 3303 flow. Second operand 4 states and 506 transitions. [2021-10-15 19:23:42,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 622 transitions, 5474 flow [2021-10-15 19:23:42,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 622 transitions, 5356 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:23:42,050 INFO L242 Difference]: Finished difference. Result has 161 places, 368 transitions, 4244 flow [2021-10-15 19:23:42,051 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=3189, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4244, PETRI_PLACES=161, PETRI_TRANSITIONS=368} [2021-10-15 19:23:42,051 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -34 predicate places. [2021-10-15 19:23:42,051 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 368 transitions, 4244 flow [2021-10-15 19:23:42,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:42,052 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:42,052 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:42,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-15 19:23:42,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 19:23:42,280 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:42,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1110308090, now seen corresponding path program 1 times [2021-10-15 19:23:42,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:42,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172421758] [2021-10-15 19:23:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:42,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 131 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-10-15 19:23:42,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:42,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172421758] [2021-10-15 19:23:42,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172421758] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 19:23:42,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437115715] [2021-10-15 19:23:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:42,418 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 19:23:42,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:23:42,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 19:23:42,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-15 19:23:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:42,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-15 19:23:42,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 19:23:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-15 19:23:43,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437115715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:43,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 19:23:43,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-10-15 19:23:43,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714813531] [2021-10-15 19:23:43,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:43,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:43,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:43,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-15 19:23:43,713 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:43,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 368 transitions, 4244 flow. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:43,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:43,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:43,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:45,388 INFO L129 PetriNetUnfolder]: 214/3361 cut-off events. [2021-10-15 19:23:45,388 INFO L130 PetriNetUnfolder]: For 5730/5730 co-relation queries the response was YES. [2021-10-15 19:23:45,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8259 conditions, 3361 events. 214/3361 cut-off events. For 5730/5730 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 19806 event pairs, 0 based on Foata normal form. 20/3381 useless extension candidates. Maximal degree in co-relation 5096. Up to 1892 conditions per place. [2021-10-15 19:23:45,403 INFO L132 encePairwiseOnDemand]: 309/327 looper letters, 404 selfloop transitions, 65 changer transitions 0/475 dead transitions. [2021-10-15 19:23:45,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 475 transitions, 5070 flow [2021-10-15 19:23:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2021-10-15 19:23:45,405 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.345565749235474 [2021-10-15 19:23:45,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2021-10-15 19:23:45,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2021-10-15 19:23:45,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:45,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2021-10-15 19:23:45,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:45,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:45,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:45,411 INFO L186 Difference]: Start difference. First operand has 161 places, 368 transitions, 4244 flow. Second operand 3 states and 339 transitions. [2021-10-15 19:23:45,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 475 transitions, 5070 flow [2021-10-15 19:23:45,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 475 transitions, 5068 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-10-15 19:23:45,446 INFO L242 Difference]: Finished difference. Result has 163 places, 348 transitions, 4006 flow [2021-10-15 19:23:45,447 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=3876, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4006, PETRI_PLACES=163, PETRI_TRANSITIONS=348} [2021-10-15 19:23:45,447 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -32 predicate places. [2021-10-15 19:23:45,447 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 348 transitions, 4006 flow [2021-10-15 19:23:45,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:45,447 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:45,448 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:45,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-10-15 19:23:45,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-15 19:23:45,651 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:45,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1745901479, now seen corresponding path program 1 times [2021-10-15 19:23:45,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:45,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96506209] [2021-10-15 19:23:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:45,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 252 proven. 38 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-10-15 19:23:45,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:23:45,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96506209] [2021-10-15 19:23:45,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96506209] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 19:23:45,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861480957] [2021-10-15 19:23:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:45,927 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 19:23:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:23:45,932 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 19:23:45,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-15 19:23:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:23:46,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-15 19:23:46,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 19:23:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-10-15 19:23:47,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861480957] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:23:47,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 19:23:47,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-10-15 19:23:47,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993843072] [2021-10-15 19:23:47,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:23:47,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:23:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:23:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-15 19:23:47,135 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 327 [2021-10-15 19:23:47,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 348 transitions, 4006 flow. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:47,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:23:47,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 327 [2021-10-15 19:23:47,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:23:48,595 INFO L129 PetriNetUnfolder]: 203/3350 cut-off events. [2021-10-15 19:23:48,596 INFO L130 PetriNetUnfolder]: For 5618/5618 co-relation queries the response was YES. [2021-10-15 19:23:48,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8195 conditions, 3350 events. 203/3350 cut-off events. For 5618/5618 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 19406 event pairs, 0 based on Foata normal form. 11/3361 useless extension candidates. Maximal degree in co-relation 6591. Up to 1909 conditions per place. [2021-10-15 19:23:48,612 INFO L132 encePairwiseOnDemand]: 295/327 looper letters, 362 selfloop transitions, 96 changer transitions 0/464 dead transitions. [2021-10-15 19:23:48,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 464 transitions, 4954 flow [2021-10-15 19:23:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:23:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:23:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2021-10-15 19:23:48,636 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.35881753312945974 [2021-10-15 19:23:48,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2021-10-15 19:23:48,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2021-10-15 19:23:48,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:23:48,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2021-10-15 19:23:48,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:48,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:48,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:48,643 INFO L186 Difference]: Start difference. First operand has 163 places, 348 transitions, 4006 flow. Second operand 3 states and 352 transitions. [2021-10-15 19:23:48,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 464 transitions, 4954 flow [2021-10-15 19:23:48,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 464 transitions, 4896 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:23:48,734 INFO L242 Difference]: Finished difference. Result has 164 places, 337 transitions, 3918 flow [2021-10-15 19:23:48,734 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=3726, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3918, PETRI_PLACES=164, PETRI_TRANSITIONS=337} [2021-10-15 19:23:48,735 INFO L334 CegarLoopForPetriNet]: 195 programPoint places, -31 predicate places. [2021-10-15 19:23:48,735 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 337 transitions, 3918 flow [2021-10-15 19:23:48,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:23:48,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:23:48,738 INFO L254 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:23:48,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-15 19:23:48,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-15 19:23:48,947 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:23:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:23:48,948 INFO L82 PathProgramCache]: Analyzing trace with hash -866356035, now seen corresponding path program 1 times [2021-10-15 19:23:48,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:23:48,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291149151] [2021-10-15 19:23:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:23:48,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:23:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 19:23:49,080 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-15 19:23:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 19:23:49,295 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-15 19:23:49,295 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-15 19:23:49,296 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-15 19:23:49,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-15 19:23:49,310 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-15 19:23:49,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 07:23:49 BoogieIcfgContainer [2021-10-15 19:23:49,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-15 19:23:49,569 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-15 19:23:49,569 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-15 19:23:49,569 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-15 19:23:49,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:23:21" (3/4) ... [2021-10-15 19:23:49,572 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-15 19:23:49,889 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/witness.graphml [2021-10-15 19:23:49,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-15 19:23:49,892 INFO L168 Benchmark]: Toolchain (without parser) took 30464.61 ms. Allocated memory was 121.6 MB in the beginning and 299.9 MB in the end (delta: 178.3 MB). Free memory was 83.6 MB in the beginning and 130.8 MB in the end (delta: -47.1 MB). Peak memory consumption was 131.5 MB. Max. memory is 16.1 GB. [2021-10-15 19:23:49,894 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 121.6 MB. Free memory is still 101.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-15 19:23:49,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.71 ms. Allocated memory is still 121.6 MB. Free memory was 83.4 MB in the beginning and 80.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-15 19:23:49,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.26 ms. Allocated memory is still 121.6 MB. Free memory was 80.6 MB in the beginning and 74.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-15 19:23:49,897 INFO L168 Benchmark]: Boogie Preprocessor took 96.16 ms. Allocated memory is still 121.6 MB. Free memory was 74.9 MB in the beginning and 70.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-15 19:23:49,898 INFO L168 Benchmark]: RCFGBuilder took 1523.07 ms. Allocated memory is still 121.6 MB. Free memory was 70.6 MB in the beginning and 62.9 MB in the end (delta: 7.7 MB). Peak memory consumption was 31.6 MB. Max. memory is 16.1 GB. [2021-10-15 19:23:49,899 INFO L168 Benchmark]: TraceAbstraction took 27570.65 ms. Allocated memory was 121.6 MB in the beginning and 299.9 MB in the end (delta: 178.3 MB). Free memory was 62.9 MB in the beginning and 173.8 MB in the end (delta: -110.9 MB). Peak memory consumption was 66.5 MB. Max. memory is 16.1 GB. [2021-10-15 19:23:49,899 INFO L168 Benchmark]: Witness Printer took 320.73 ms. Allocated memory is still 299.9 MB. Free memory was 173.8 MB in the beginning and 130.8 MB in the end (delta: 43.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. [2021-10-15 19:23:49,902 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.39 ms. Allocated memory is still 121.6 MB. Free memory is still 101.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 838.71 ms. Allocated memory is still 121.6 MB. Free memory was 83.4 MB in the beginning and 80.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 107.26 ms. Allocated memory is still 121.6 MB. Free memory was 80.6 MB in the beginning and 74.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 96.16 ms. Allocated memory is still 121.6 MB. Free memory was 74.9 MB in the beginning and 70.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1523.07 ms. Allocated memory is still 121.6 MB. Free memory was 70.6 MB in the beginning and 62.9 MB in the end (delta: 7.7 MB). Peak memory consumption was 31.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 27570.65 ms. Allocated memory was 121.6 MB in the beginning and 299.9 MB in the end (delta: 178.3 MB). Free memory was 62.9 MB in the beginning and 173.8 MB in the end (delta: -110.9 MB). Peak memory consumption was 66.5 MB. Max. memory is 16.1 GB. * Witness Printer took 320.73 ms. Allocated memory is still 299.9 MB. Free memory was 173.8 MB in the beginning and 130.8 MB in the end (delta: 43.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 420]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L376] a21 = 1 [L377] a7 = 0 [L378] a17 = 0 [L379] a8 = 14 [L380] a20 = 0 [L381] return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L420] reach_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 35.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27217.1ms, OverallIterations: 14, TraceHistogramMax: 7, EmptinessCheckTime: 0.0ms, AutomataDifference: 18257.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 213.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 823 SDtfs, 1689 SDslu, 0 SDs, 0 SdLazy, 4735 SolverSat, 720 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5929.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 962 GetRequests, 934 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 156.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4952occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 289.3ms SsaConstructionTime, 988.2ms SatisfiabilityAnalysisTime, 4852.0ms InterpolantComputationTime, 2904 NumberOfCodeBlocks, 2904 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2616 ConstructedInterpolants, 0 QuantifiedInterpolants, 6648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1866 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 1920/2015 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-15 19:23:49,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85a5e989-abee-42fe-b9e3-300670dc1189/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...