./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_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_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/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_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/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_97dda799-d04b-4945-aae4-3f040409845d/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 803b078d721fbe530c43e00f4b58400db06099e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25:44,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-15 19:25:44,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-15 19:25:44,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-15 19:25:44,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-15 19:25:44,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-15 19:25:44,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-15 19:25:44,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-15 19:25:44,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-15 19:25:44,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-15 19:25:44,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-15 19:25:44,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-15 19:25:44,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-15 19:25:44,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-15 19:25:44,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-15 19:25:44,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-15 19:25:44,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-15 19:25:44,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-15 19:25:44,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-15 19:25:44,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-15 19:25:44,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-15 19:25:44,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-15 19:25:44,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-15 19:25:44,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-15 19:25:44,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-15 19:25:44,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-15 19:25:44,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-15 19:25:44,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-15 19:25:44,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-15 19:25:44,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-15 19:25:44,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-15 19:25:44,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-15 19:25:44,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-15 19:25:44,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-15 19:25:44,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-15 19:25:44,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-15 19:25:44,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-15 19:25:44,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-15 19:25:44,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-15 19:25:44,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-15 19:25:44,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-15 19:25:44,528 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-15 19:25:44,577 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-15 19:25:44,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-15 19:25:44,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-15 19:25:44,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-15 19:25:44,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-15 19:25:44,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-15 19:25:44,580 INFO L138 SettingsManager]: * Use SBE=true [2021-10-15 19:25:44,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-15 19:25:44,581 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-15 19:25:44,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-15 19:25:44,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-15 19:25:44,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-15 19:25:44,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-15 19:25:44,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-15 19:25:44,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-15 19:25:44,583 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-15 19:25:44,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-15 19:25:44,584 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-15 19:25:44,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-15 19:25:44,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-15 19:25:44,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-15 19:25:44,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-15 19:25:44,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 19:25:44,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-15 19:25:44,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-15 19:25:44,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-15 19:25:44,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-15 19:25:44,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-15 19:25:44,586 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-15 19:25:44,588 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-15 19:25:44,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-15 19:25:44,589 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-15 19:25:44,589 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_97dda799-d04b-4945-aae4-3f040409845d/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_97dda799-d04b-4945-aae4-3f040409845d/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 -> 803b078d721fbe530c43e00f4b58400db06099e1 [2021-10-15 19:25:44,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-15 19:25:44,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-15 19:25:44,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-15 19:25:44,928 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-15 19:25:44,929 INFO L275 PluginConnector]: CDTParser initialized [2021-10-15 19:25:44,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/../../sv-benchmarks/c/eca-rers2012/Problem10_label57.c [2021-10-15 19:25:45,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/data/e1b721289/d772223733204e509b989492d8f9e623/FLAGfab6f54b8 [2021-10-15 19:25:45,604 INFO L306 CDTParser]: Found 1 translation units. [2021-10-15 19:25:45,616 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/sv-benchmarks/c/eca-rers2012/Problem10_label57.c [2021-10-15 19:25:45,628 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/data/e1b721289/d772223733204e509b989492d8f9e623/FLAGfab6f54b8 [2021-10-15 19:25:45,853 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/data/e1b721289/d772223733204e509b989492d8f9e623 [2021-10-15 19:25:45,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-15 19:25:45,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-15 19:25:45,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-15 19:25:45,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-15 19:25:45,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-15 19:25:45,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 07:25:45" (1/1) ... [2021-10-15 19:25:45,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208c2279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:45, skipping insertion in model container [2021-10-15 19:25:45,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 07:25:45" (1/1) ... [2021-10-15 19:25:45,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-15 19:25:45,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-15 19:25:46,121 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_97dda799-d04b-4945-aae4-3f040409845d/sv-benchmarks/c/eca-rers2012/Problem10_label57.c[986,999] [2021-10-15 19:25:46,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 19:25:46,367 INFO L203 MainTranslator]: Completed pre-run [2021-10-15 19:25:46,386 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_97dda799-d04b-4945-aae4-3f040409845d/sv-benchmarks/c/eca-rers2012/Problem10_label57.c[986,999] [2021-10-15 19:25:46,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 19:25:46,496 INFO L208 MainTranslator]: Completed translation [2021-10-15 19:25:46,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46 WrapperNode [2021-10-15 19:25:46,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-15 19:25:46,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-15 19:25:46,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-15 19:25:46,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-15 19:25:46,508 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:25:46" (1/1) ... [2021-10-15 19:25:46,535 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:25:46" (1/1) ... [2021-10-15 19:25:46,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-15 19:25:46,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-15 19:25:46,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-15 19:25:46,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-15 19:25:46,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46" (1/1) ... [2021-10-15 19:25:46,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46" (1/1) ... [2021-10-15 19:25:46,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46" (1/1) ... [2021-10-15 19:25:46,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46" (1/1) ... [2021-10-15 19:25:46,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46" (1/1) ... [2021-10-15 19:25:46,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46" (1/1) ... [2021-10-15 19:25:46,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46" (1/1) ... [2021-10-15 19:25:46,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-15 19:25:46,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-15 19:25:46,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-15 19:25:46,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-15 19:25:46,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46" (1/1) ... [2021-10-15 19:25:46,751 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 19:25:46,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:25:46,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-15 19:25:46,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-15 19:25:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-15 19:25:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-15 19:25:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-15 19:25:46,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-15 19:25:48,215 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-15 19:25:48,216 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-15 19:25:48,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:25:48 BoogieIcfgContainer [2021-10-15 19:25:48,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-15 19:25:48,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-15 19:25:48,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-15 19:25:48,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-15 19:25:48,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 07:25:45" (1/3) ... [2021-10-15 19:25:48,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22de845a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 07:25:48, skipping insertion in model container [2021-10-15 19:25:48,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:25:46" (2/3) ... [2021-10-15 19:25:48,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22de845a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 07:25:48, skipping insertion in model container [2021-10-15 19:25:48,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:25:48" (3/3) ... [2021-10-15 19:25:48,231 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label57.c [2021-10-15 19:25:48,241 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-15 19:25:48,242 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-15 19:25:48,312 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-15 19:25:48,325 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:25:48,325 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-15 19:25:48,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 206 places, 344 transitions, 688 flow [2021-10-15 19:25:48,450 INFO L129 PetriNetUnfolder]: 139/344 cut-off events. [2021-10-15 19:25:48,450 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 19:25:48,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 344 events. 139/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 212 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 0. Up to 76 conditions per place. [2021-10-15 19:25:48,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 344 transitions, 688 flow [2021-10-15 19:25:48,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 339 transitions, 678 flow [2021-10-15 19:25:48,465 INFO L129 PetriNetUnfolder]: 1/8 cut-off events. [2021-10-15 19:25:48,465 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 19:25:48,466 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:25:48,466 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-15 19:25:48,467 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:25:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:25:48,476 INFO L82 PathProgramCache]: Analyzing trace with hash 889694410, now seen corresponding path program 1 times [2021-10-15 19:25:48,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:25:48,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268310444] [2021-10-15 19:25:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:48,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:25:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:48,647 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:25:48,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:25:48,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268310444] [2021-10-15 19:25:48,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268310444] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:25:48,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:25:48,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 19:25:48,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650760013] [2021-10-15 19:25:48,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:25:48,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:25:48,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:25:48,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:25:48,680 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:25:48,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 339 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:25:48,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:25:48,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:25:48,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:25:49,870 INFO L129 PetriNetUnfolder]: 152/493 cut-off events. [2021-10-15 19:25:49,871 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 19:25:49,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 493 events. 152/493 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 548 event pairs, 0 based on Foata normal form. 61/342 useless extension candidates. Maximal degree in co-relation 1. Up to 257 conditions per place. [2021-10-15 19:25:49,881 INFO L132 encePairwiseOnDemand]: 146/344 looper letters, 348 selfloop transitions, 76 changer transitions 61/490 dead transitions. [2021-10-15 19:25:49,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 490 transitions, 1950 flow [2021-10-15 19:25:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:25:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:25:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2021-10-15 19:25:49,907 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2021-10-15 19:25:49,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2021-10-15 19:25:49,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2021-10-15 19:25:49,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:25:49,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2021-10-15 19:25:49,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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:25:49,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:49,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:49,936 INFO L186 Difference]: Start difference. First operand has 203 places, 339 transitions, 678 flow. Second operand 3 states and 630 transitions. [2021-10-15 19:25:49,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 490 transitions, 1950 flow [2021-10-15 19:25:49,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 490 transitions, 1950 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-15 19:25:49,962 INFO L242 Difference]: Finished difference. Result has 207 places, 293 transitions, 1042 flow [2021-10-15 19:25:49,964 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=207, PETRI_TRANSITIONS=293} [2021-10-15 19:25:49,965 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, 4 predicate places. [2021-10-15 19:25:49,966 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 293 transitions, 1042 flow [2021-10-15 19:25:49,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:25:49,966 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:25:49,967 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:25:49,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-15 19:25:49,967 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:25:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:25:49,968 INFO L82 PathProgramCache]: Analyzing trace with hash -475796845, now seen corresponding path program 1 times [2021-10-15 19:25:49,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:25:49,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132918622] [2021-10-15 19:25:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:49,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:25:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:25:50,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:25:50,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132918622] [2021-10-15 19:25:50,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132918622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:25:50,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:25:50,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 19:25:50,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636359849] [2021-10-15 19:25:50,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:25:50,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:25:50,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:25:50,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:25:50,254 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:25:50,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 293 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:25:50,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:25:50,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:25:50,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:25:51,064 INFO L129 PetriNetUnfolder]: 186/606 cut-off events. [2021-10-15 19:25:51,065 INFO L130 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2021-10-15 19:25:51,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 606 events. 186/606 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 736 event pairs, 0 based on Foata normal form. 40/646 useless extension candidates. Maximal degree in co-relation 812. Up to 458 conditions per place. [2021-10-15 19:25:51,073 INFO L132 encePairwiseOnDemand]: 269/344 looper letters, 424 selfloop transitions, 35 changer transitions 0/464 dead transitions. [2021-10-15 19:25:51,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 464 transitions, 2386 flow [2021-10-15 19:25:51,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:25:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:25:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2021-10-15 19:25:51,077 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43410852713178294 [2021-10-15 19:25:51,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2021-10-15 19:25:51,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2021-10-15 19:25:51,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:25:51,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2021-10-15 19:25:51,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:25:51,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:51,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:51,092 INFO L186 Difference]: Start difference. First operand has 207 places, 293 transitions, 1042 flow. Second operand 3 states and 448 transitions. [2021-10-15 19:25:51,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 464 transitions, 2386 flow [2021-10-15 19:25:51,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 464 transitions, 2220 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:25:51,133 INFO L242 Difference]: Finished difference. Result has 148 places, 327 transitions, 1279 flow [2021-10-15 19:25:51,135 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1279, PETRI_PLACES=148, PETRI_TRANSITIONS=327} [2021-10-15 19:25:51,142 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -55 predicate places. [2021-10-15 19:25:51,142 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 327 transitions, 1279 flow [2021-10-15 19:25:51,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:25:51,143 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:25:51,143 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:25:51,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-15 19:25:51,144 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:25:51,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:25:51,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1399038276, now seen corresponding path program 1 times [2021-10-15 19:25:51,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:25:51,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137581831] [2021-10-15 19:25:51,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:51,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:25:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:25:51,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:25:51,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137581831] [2021-10-15 19:25:51,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137581831] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:25:51,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:25:51,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:25:51,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236266502] [2021-10-15 19:25:51,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:25:51,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:25:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:25:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:25:51,333 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:25:51,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 327 transitions, 1279 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:25:51,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:25:51,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:25:51,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:25:52,265 INFO L129 PetriNetUnfolder]: 266/1103 cut-off events. [2021-10-15 19:25:52,265 INFO L130 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2021-10-15 19:25:52,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 1103 events. 266/1103 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2712 event pairs, 0 based on Foata normal form. 106/1209 useless extension candidates. Maximal degree in co-relation 574. Up to 591 conditions per place. [2021-10-15 19:25:52,273 INFO L132 encePairwiseOnDemand]: 268/344 looper letters, 435 selfloop transitions, 102 changer transitions 0/542 dead transitions. [2021-10-15 19:25:52,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 542 transitions, 3036 flow [2021-10-15 19:25:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:25:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:25:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2021-10-15 19:25:52,277 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43507751937984496 [2021-10-15 19:25:52,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2021-10-15 19:25:52,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2021-10-15 19:25:52,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:25:52,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2021-10-15 19:25:52,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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:25:52,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:52,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:52,285 INFO L186 Difference]: Start difference. First operand has 148 places, 327 transitions, 1279 flow. Second operand 3 states and 449 transitions. [2021-10-15 19:25:52,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 542 transitions, 3036 flow [2021-10-15 19:25:52,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 542 transitions, 2992 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:25:52,311 INFO L242 Difference]: Finished difference. Result has 151 places, 406 transitions, 2378 flow [2021-10-15 19:25:52,311 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2378, PETRI_PLACES=151, PETRI_TRANSITIONS=406} [2021-10-15 19:25:52,312 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -52 predicate places. [2021-10-15 19:25:52,312 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 406 transitions, 2378 flow [2021-10-15 19:25:52,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:25:52,312 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:25:52,313 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:25:52,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-15 19:25:52,313 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:25:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:25:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1864868976, now seen corresponding path program 1 times [2021-10-15 19:25:52,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:25:52,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168211498] [2021-10-15 19:25:52,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:52,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:25:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:25:52,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:25:52,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168211498] [2021-10-15 19:25:52,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168211498] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:25:52,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:25:52,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:25:52,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628277912] [2021-10-15 19:25:52,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:25:52,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:25:52,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:25:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:25:52,454 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 344 [2021-10-15 19:25:52,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 406 transitions, 2378 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:25:52,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:25:52,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 344 [2021-10-15 19:25:52,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:25:53,482 INFO L129 PetriNetUnfolder]: 226/935 cut-off events. [2021-10-15 19:25:53,482 INFO L130 PetriNetUnfolder]: For 788/788 co-relation queries the response was YES. [2021-10-15 19:25:53,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 935 events. 226/935 cut-off events. For 788/788 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1817 event pairs, 0 based on Foata normal form. 30/965 useless extension candidates. Maximal degree in co-relation 1336. Up to 598 conditions per place. [2021-10-15 19:25:53,491 INFO L132 encePairwiseOnDemand]: 274/344 looper letters, 318 selfloop transitions, 185 changer transitions 0/507 dead transitions. [2021-10-15 19:25:53,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 507 transitions, 3336 flow [2021-10-15 19:25:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:25:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:25:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2021-10-15 19:25:53,495 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.24593023255813953 [2021-10-15 19:25:53,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 423 transitions. [2021-10-15 19:25:53,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 423 transitions. [2021-10-15 19:25:53,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:25:53,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 423 transitions. [2021-10-15 19:25:53,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 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:25:53,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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:25:53,504 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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:25:53,505 INFO L186 Difference]: Start difference. First operand has 151 places, 406 transitions, 2378 flow. Second operand 5 states and 423 transitions. [2021-10-15 19:25:53,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 507 transitions, 3336 flow [2021-10-15 19:25:53,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 507 transitions, 3074 flow, removed 40 selfloop flow, removed 2 redundant places. [2021-10-15 19:25:53,539 INFO L242 Difference]: Finished difference. Result has 156 places, 371 transitions, 2363 flow [2021-10-15 19:25:53,540 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2363, PETRI_PLACES=156, PETRI_TRANSITIONS=371} [2021-10-15 19:25:53,540 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -47 predicate places. [2021-10-15 19:25:53,540 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 371 transitions, 2363 flow [2021-10-15 19:25:53,540 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:25:53,541 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:25:53,541 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, 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] [2021-10-15 19:25:53,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-15 19:25:53,542 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:25:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:25:53,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1621699225, now seen corresponding path program 1 times [2021-10-15 19:25:53,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:25:53,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975202953] [2021-10-15 19:25:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:53,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:25:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-10-15 19:25:53,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:25:53,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975202953] [2021-10-15 19:25:53,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975202953] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:25:53,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:25:53,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 19:25:53,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867944596] [2021-10-15 19:25:53,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:25:53,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:25:53,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:25:53,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:25:53,737 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:25:53,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 371 transitions, 2363 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:25:53,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:25:53,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:25:53,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:25:54,736 INFO L129 PetriNetUnfolder]: 246/1239 cut-off events. [2021-10-15 19:25:54,736 INFO L130 PetriNetUnfolder]: For 2218/2218 co-relation queries the response was YES. [2021-10-15 19:25:54,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 1239 events. 246/1239 cut-off events. For 2218/2218 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 3338 event pairs, 0 based on Foata normal form. 90/1329 useless extension candidates. Maximal degree in co-relation 2413. Up to 888 conditions per place. [2021-10-15 19:25:54,746 INFO L132 encePairwiseOnDemand]: 268/344 looper letters, 408 selfloop transitions, 112 changer transitions 0/527 dead transitions. [2021-10-15 19:25:54,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 527 transitions, 3945 flow [2021-10-15 19:25:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:25:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:25:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2021-10-15 19:25:54,750 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43410852713178294 [2021-10-15 19:25:54,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2021-10-15 19:25:54,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2021-10-15 19:25:54,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:25:54,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2021-10-15 19:25:54,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:25:54,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:54,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:54,759 INFO L186 Difference]: Start difference. First operand has 156 places, 371 transitions, 2363 flow. Second operand 3 states and 448 transitions. [2021-10-15 19:25:54,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 527 transitions, 3945 flow [2021-10-15 19:25:54,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 527 transitions, 3939 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:25:54,809 INFO L242 Difference]: Finished difference. Result has 159 places, 391 transitions, 3221 flow [2021-10-15 19:25:54,810 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3221, PETRI_PLACES=159, PETRI_TRANSITIONS=391} [2021-10-15 19:25:54,811 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -44 predicate places. [2021-10-15 19:25:54,811 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 391 transitions, 3221 flow [2021-10-15 19:25:54,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:25:54,811 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:25:54,812 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, 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] [2021-10-15 19:25:54,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-15 19:25:54,813 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:25:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:25:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash 522213040, now seen corresponding path program 1 times [2021-10-15 19:25:54,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:25:54,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835205664] [2021-10-15 19:25:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:54,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:25:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:25:54,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:25:54,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835205664] [2021-10-15 19:25:54,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835205664] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:25:54,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:25:54,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:25:54,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545388145] [2021-10-15 19:25:54,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:25:54,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:25:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:25:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:25:54,965 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:25:54,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 391 transitions, 3221 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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:25:54,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:25:54,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:25:54,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:25:56,105 INFO L129 PetriNetUnfolder]: 266/1540 cut-off events. [2021-10-15 19:25:56,105 INFO L130 PetriNetUnfolder]: For 4033/4033 co-relation queries the response was YES. [2021-10-15 19:25:56,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4277 conditions, 1540 events. 266/1540 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4702 event pairs, 0 based on Foata normal form. 81/1621 useless extension candidates. Maximal degree in co-relation 2746. Up to 1155 conditions per place. [2021-10-15 19:25:56,119 INFO L132 encePairwiseOnDemand]: 285/344 looper letters, 479 selfloop transitions, 61 changer transitions 0/547 dead transitions. [2021-10-15 19:25:56,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 547 transitions, 4783 flow [2021-10-15 19:25:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:25:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:25:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2021-10-15 19:25:56,123 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4108527131782946 [2021-10-15 19:25:56,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2021-10-15 19:25:56,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2021-10-15 19:25:56,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:25:56,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2021-10-15 19:25:56,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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:25:56,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:56,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:56,131 INFO L186 Difference]: Start difference. First operand has 159 places, 391 transitions, 3221 flow. Second operand 3 states and 424 transitions. [2021-10-15 19:25:56,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 547 transitions, 4783 flow [2021-10-15 19:25:56,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 547 transitions, 4411 flow, removed 74 selfloop flow, removed 2 redundant places. [2021-10-15 19:25:56,192 INFO L242 Difference]: Finished difference. Result has 161 places, 411 transitions, 3483 flow [2021-10-15 19:25:56,193 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2849, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3483, PETRI_PLACES=161, PETRI_TRANSITIONS=411} [2021-10-15 19:25:56,194 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -42 predicate places. [2021-10-15 19:25:56,194 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 411 transitions, 3483 flow [2021-10-15 19:25:56,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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:25:56,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:25:56,195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:25:56,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-15 19:25:56,196 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:25:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:25:56,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1271487129, now seen corresponding path program 1 times [2021-10-15 19:25:56,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:25:56,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074800609] [2021-10-15 19:25:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:56,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:25:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-10-15 19:25:56,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:25:56,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074800609] [2021-10-15 19:25:56,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074800609] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:25:56,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:25:56,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:25:56,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035050877] [2021-10-15 19:25:56,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:25:56,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:25:56,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:25:56,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:25:56,331 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:25:56,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 411 transitions, 3483 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:25:56,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:25:56,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:25:56,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:25:57,598 INFO L129 PetriNetUnfolder]: 231/1789 cut-off events. [2021-10-15 19:25:57,599 INFO L130 PetriNetUnfolder]: For 4835/4835 co-relation queries the response was YES. [2021-10-15 19:25:57,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4664 conditions, 1789 events. 231/1789 cut-off events. For 4835/4835 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 6376 event pairs, 0 based on Foata normal form. 136/1925 useless extension candidates. Maximal degree in co-relation 3297. Up to 1140 conditions per place. [2021-10-15 19:25:57,614 INFO L132 encePairwiseOnDemand]: 270/344 looper letters, 435 selfloop transitions, 70 changer transitions 0/512 dead transitions. [2021-10-15 19:25:57,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 512 transitions, 4395 flow [2021-10-15 19:25:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:25:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:25:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2021-10-15 19:25:57,618 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43023255813953487 [2021-10-15 19:25:57,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2021-10-15 19:25:57,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2021-10-15 19:25:57,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:25:57,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2021-10-15 19:25:57,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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:25:57,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:57,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:25:57,626 INFO L186 Difference]: Start difference. First operand has 161 places, 411 transitions, 3483 flow. Second operand 3 states and 444 transitions. [2021-10-15 19:25:57,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 512 transitions, 4395 flow [2021-10-15 19:25:57,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 512 transitions, 4215 flow, removed 40 selfloop flow, removed 2 redundant places. [2021-10-15 19:25:57,683 INFO L242 Difference]: Finished difference. Result has 163 places, 376 transitions, 3385 flow [2021-10-15 19:25:57,684 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2683, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3385, PETRI_PLACES=163, PETRI_TRANSITIONS=376} [2021-10-15 19:25:57,684 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -40 predicate places. [2021-10-15 19:25:57,684 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 376 transitions, 3385 flow [2021-10-15 19:25:57,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:25:57,685 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:25:57,686 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:25:57,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-15 19:25:57,686 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:25:57,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:25:57,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2057829585, now seen corresponding path program 1 times [2021-10-15 19:25:57,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:25:57,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310760243] [2021-10-15 19:25:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:57,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:25:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:25:57,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:25:57,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310760243] [2021-10-15 19:25:57,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310760243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:25:57,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:25:57,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-15 19:25:57,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599413435] [2021-10-15 19:25:57,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-15 19:25:57,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:25:57,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-15 19:25:57,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-15 19:25:58,000 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:25:58,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 376 transitions, 3385 flow. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:25:58,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:25:58,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:25:58,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:25:59,382 INFO L129 PetriNetUnfolder]: 230/1843 cut-off events. [2021-10-15 19:25:59,382 INFO L130 PetriNetUnfolder]: For 3814/3814 co-relation queries the response was YES. [2021-10-15 19:25:59,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4909 conditions, 1843 events. 230/1843 cut-off events. For 3814/3814 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5985 event pairs, 0 based on Foata normal form. 1/1844 useless extension candidates. Maximal degree in co-relation 2698. Up to 1722 conditions per place. [2021-10-15 19:25:59,398 INFO L132 encePairwiseOnDemand]: 338/344 looper letters, 362 selfloop transitions, 1 changer transitions 57/427 dead transitions. [2021-10-15 19:25:59,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 427 transitions, 4327 flow [2021-10-15 19:25:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-15 19:25:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-15 19:25:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2021-10-15 19:25:59,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.13330564784053156 [2021-10-15 19:25:59,403 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 321 transitions. [2021-10-15 19:25:59,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 321 transitions. [2021-10-15 19:25:59,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:25:59,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 321 transitions. [2021-10-15 19:25:59,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 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:25:59,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 344.0) internal successors, (2752), 8 states have internal predecessors, (2752), 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:25:59,412 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 344.0) internal successors, (2752), 8 states have internal predecessors, (2752), 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:25:59,413 INFO L186 Difference]: Start difference. First operand has 163 places, 376 transitions, 3385 flow. Second operand 7 states and 321 transitions. [2021-10-15 19:25:59,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 427 transitions, 4327 flow [2021-10-15 19:25:59,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 427 transitions, 4051 flow, removed 68 selfloop flow, removed 2 redundant places. [2021-10-15 19:25:59,470 INFO L242 Difference]: Finished difference. Result has 171 places, 370 transitions, 3055 flow [2021-10-15 19:25:59,470 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=3109, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3055, PETRI_PLACES=171, PETRI_TRANSITIONS=370} [2021-10-15 19:25:59,471 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -32 predicate places. [2021-10-15 19:25:59,471 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 370 transitions, 3055 flow [2021-10-15 19:25:59,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:25:59,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:25:59,472 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-15 19:25:59,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-15 19:25:59,472 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:25:59,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:25:59,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1917899209, now seen corresponding path program 1 times [2021-10-15 19:25:59,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:25:59,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604390802] [2021-10-15 19:25:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:59,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:25:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:25:59,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:25:59,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604390802] [2021-10-15 19:25:59,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604390802] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 19:25:59,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259632407] [2021-10-15 19:25:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:25:59,681 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 19:25:59,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:25:59,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 19:25:59,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-15 19:25:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:25:59,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-15 19:25:59,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 19:26:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:26:01,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259632407] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 19:26:01,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-15 19:26:01,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-15 19:26:01,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795013092] [2021-10-15 19:26:01,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-15 19:26:01,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:26:01,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-15 19:26:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-15 19:26:01,500 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:26:01,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 370 transitions, 3055 flow. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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:26:01,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:26:01,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:26:01,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:26:04,984 INFO L129 PetriNetUnfolder]: 498/4177 cut-off events. [2021-10-15 19:26:04,984 INFO L130 PetriNetUnfolder]: For 7989/7989 co-relation queries the response was YES. [2021-10-15 19:26:04,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10796 conditions, 4177 events. 498/4177 cut-off events. For 7989/7989 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 21636 event pairs, 0 based on Foata normal form. 102/4279 useless extension candidates. Maximal degree in co-relation 10772. Up to 1650 conditions per place. [2021-10-15 19:26:05,014 INFO L132 encePairwiseOnDemand]: 268/344 looper letters, 781 selfloop transitions, 262 changer transitions 0/1050 dead transitions. [2021-10-15 19:26:05,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1050 transitions, 9321 flow [2021-10-15 19:26:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:26:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:26:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 809 transitions. [2021-10-15 19:26:05,021 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4703488372093023 [2021-10-15 19:26:05,021 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 809 transitions. [2021-10-15 19:26:05,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 809 transitions. [2021-10-15 19:26:05,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:26:05,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 809 transitions. [2021-10-15 19:26:05,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 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:26:05,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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:26:05,030 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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:26:05,031 INFO L186 Difference]: Start difference. First operand has 171 places, 370 transitions, 3055 flow. Second operand 5 states and 809 transitions. [2021-10-15 19:26:05,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1050 transitions, 9321 flow [2021-10-15 19:26:05,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 1050 transitions, 9288 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-10-15 19:26:05,105 INFO L242 Difference]: Finished difference. Result has 169 places, 600 transitions, 7342 flow [2021-10-15 19:26:05,106 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7342, PETRI_PLACES=169, PETRI_TRANSITIONS=600} [2021-10-15 19:26:05,106 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -34 predicate places. [2021-10-15 19:26:05,106 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 600 transitions, 7342 flow [2021-10-15 19:26:05,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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:26:05,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:26:05,107 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-10-15 19:26:05,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-15 19:26:05,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-15 19:26:05,334 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:26:05,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:26:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1462196067, now seen corresponding path program 1 times [2021-10-15 19:26:05,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:26:05,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382707911] [2021-10-15 19:26:05,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:26:05,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:26:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:26:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-10-15 19:26:05,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:26:05,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382707911] [2021-10-15 19:26:05,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382707911] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:26:05,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:26:05,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:26:05,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950664751] [2021-10-15 19:26:05,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:26:05,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:26:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:26:05,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:26:05,541 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:26:05,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 600 transitions, 7342 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:26:05,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:26:05,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:26:05,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:26:08,301 INFO L129 PetriNetUnfolder]: 553/4797 cut-off events. [2021-10-15 19:26:08,301 INFO L130 PetriNetUnfolder]: For 16037/16037 co-relation queries the response was YES. [2021-10-15 19:26:08,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13112 conditions, 4797 events. 553/4797 cut-off events. For 16037/16037 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 26324 event pairs, 0 based on Foata normal form. 113/4910 useless extension candidates. Maximal degree in co-relation 13088. Up to 4018 conditions per place. [2021-10-15 19:26:08,330 INFO L132 encePairwiseOnDemand]: 294/344 looper letters, 684 selfloop transitions, 98 changer transitions 0/789 dead transitions. [2021-10-15 19:26:08,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 789 transitions, 10098 flow [2021-10-15 19:26:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:26:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:26:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2021-10-15 19:26:08,334 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.40891472868217055 [2021-10-15 19:26:08,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2021-10-15 19:26:08,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2021-10-15 19:26:08,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:26:08,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2021-10-15 19:26:08,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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:26:08,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:26:08,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:26:08,340 INFO L186 Difference]: Start difference. First operand has 169 places, 600 transitions, 7342 flow. Second operand 3 states and 422 transitions. [2021-10-15 19:26:08,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 789 transitions, 10098 flow [2021-10-15 19:26:08,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 789 transitions, 10093 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:26:08,434 INFO L242 Difference]: Finished difference. Result has 172 places, 653 transitions, 8935 flow [2021-10-15 19:26:08,435 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=7337, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8935, PETRI_PLACES=172, PETRI_TRANSITIONS=653} [2021-10-15 19:26:08,436 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -31 predicate places. [2021-10-15 19:26:08,436 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 653 transitions, 8935 flow [2021-10-15 19:26:08,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:26:08,436 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:26:08,437 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:26:08,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-15 19:26:08,437 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:26:08,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:26:08,438 INFO L82 PathProgramCache]: Analyzing trace with hash -334432438, now seen corresponding path program 1 times [2021-10-15 19:26:08,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:26:08,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544539830] [2021-10-15 19:26:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:26:08,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:26:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:26:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2021-10-15 19:26:08,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:26:08,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544539830] [2021-10-15 19:26:08,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544539830] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:26:08,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:26:08,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:26:08,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919460532] [2021-10-15 19:26:08,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:26:08,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:26:08,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:26:08,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:26:08,568 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 344 [2021-10-15 19:26:08,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 653 transitions, 8935 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:26:08,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:26:08,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 344 [2021-10-15 19:26:08,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:26:12,477 INFO L129 PetriNetUnfolder]: 713/6649 cut-off events. [2021-10-15 19:26:12,478 INFO L130 PetriNetUnfolder]: For 25504/25504 co-relation queries the response was YES. [2021-10-15 19:26:12,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18297 conditions, 6649 events. 713/6649 cut-off events. For 25504/25504 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 40612 event pairs, 0 based on Foata normal form. 175/6824 useless extension candidates. Maximal degree in co-relation 18272. Up to 3988 conditions per place. [2021-10-15 19:26:12,503 INFO L132 encePairwiseOnDemand]: 273/344 looper letters, 650 selfloop transitions, 275 changer transitions 0/932 dead transitions. [2021-10-15 19:26:12,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 932 transitions, 13448 flow [2021-10-15 19:26:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:26:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:26:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2021-10-15 19:26:12,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.42829457364341084 [2021-10-15 19:26:12,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2021-10-15 19:26:12,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2021-10-15 19:26:12,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:26:12,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2021-10-15 19:26:12,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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:26:12,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:26:12,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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:26:12,512 INFO L186 Difference]: Start difference. First operand has 172 places, 653 transitions, 8935 flow. Second operand 3 states and 442 transitions. [2021-10-15 19:26:12,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 932 transitions, 13448 flow [2021-10-15 19:26:12,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 932 transitions, 12906 flow, removed 146 selfloop flow, removed 2 redundant places. [2021-10-15 19:26:12,644 INFO L242 Difference]: Finished difference. Result has 174 places, 791 transitions, 12313 flow [2021-10-15 19:26:12,645 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=8149, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=12313, PETRI_PLACES=174, PETRI_TRANSITIONS=791} [2021-10-15 19:26:12,646 INFO L334 CegarLoopForPetriNet]: 203 programPoint places, -29 predicate places. [2021-10-15 19:26:12,646 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 791 transitions, 12313 flow [2021-10-15 19:26:12,646 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:26:12,646 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:26:12,647 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:26:12,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-15 19:26:12,647 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:26:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:26:12,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1810640325, now seen corresponding path program 1 times [2021-10-15 19:26:12,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:26:12,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101977580] [2021-10-15 19:26:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:26:12,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:26:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 19:26:12,742 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-15 19:26:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 19:26:12,928 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-15 19:26:12,929 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-15 19:26:12,929 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-15 19:26:12,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-15 19:26:12,938 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-15 19:26:13,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 07:26:13 BoogieIcfgContainer [2021-10-15 19:26:13,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-15 19:26:13,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-15 19:26:13,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-15 19:26:13,153 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-15 19:26:13,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:25:48" (3/4) ... [2021-10-15 19:26:13,162 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-15 19:26:13,408 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/witness.graphml [2021-10-15 19:26:13,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-15 19:26:13,410 INFO L168 Benchmark]: Toolchain (without parser) took 27553.00 ms. Allocated memory was 107.0 MB in the beginning and 465.6 MB in the end (delta: 358.6 MB). Free memory was 67.6 MB in the beginning and 139.3 MB in the end (delta: -71.7 MB). Peak memory consumption was 286.6 MB. Max. memory is 16.1 GB. [2021-10-15 19:26:13,411 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 107.0 MB. Free memory is still 85.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-15 19:26:13,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.52 ms. Allocated memory is still 107.0 MB. Free memory was 67.4 MB in the beginning and 64.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-15 19:26:13,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.59 ms. Allocated memory is still 107.0 MB. Free memory was 64.3 MB in the beginning and 56.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-15 19:26:13,412 INFO L168 Benchmark]: Boogie Preprocessor took 121.11 ms. Allocated memory is still 107.0 MB. Free memory was 56.3 MB in the beginning and 51.7 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-15 19:26:13,413 INFO L168 Benchmark]: RCFGBuilder took 1478.10 ms. Allocated memory was 107.0 MB in the beginning and 134.2 MB in the end (delta: 27.3 MB). Free memory was 51.3 MB in the beginning and 59.4 MB in the end (delta: -8.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. [2021-10-15 19:26:13,413 INFO L168 Benchmark]: TraceAbstraction took 24928.95 ms. Allocated memory was 134.2 MB in the beginning and 465.6 MB in the end (delta: 331.4 MB). Free memory was 59.4 MB in the beginning and 177.0 MB in the end (delta: -117.6 MB). Peak memory consumption was 214.3 MB. Max. memory is 16.1 GB. [2021-10-15 19:26:13,414 INFO L168 Benchmark]: Witness Printer took 256.12 ms. Allocated memory is still 465.6 MB. Free memory was 177.0 MB in the beginning and 139.3 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2021-10-15 19:26:13,416 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.23 ms. Allocated memory is still 107.0 MB. Free memory is still 85.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 639.52 ms. Allocated memory is still 107.0 MB. Free memory was 67.4 MB in the beginning and 64.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 120.59 ms. Allocated memory is still 107.0 MB. Free memory was 64.3 MB in the beginning and 56.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 121.11 ms. Allocated memory is still 107.0 MB. Free memory was 56.3 MB in the beginning and 51.7 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1478.10 ms. Allocated memory was 107.0 MB in the beginning and 134.2 MB in the end (delta: 27.3 MB). Free memory was 51.3 MB in the beginning and 59.4 MB in the end (delta: -8.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24928.95 ms. Allocated memory was 134.2 MB in the beginning and 465.6 MB in the end (delta: 331.4 MB). Free memory was 59.4 MB in the beginning and 177.0 MB in the end (delta: -117.6 MB). Peak memory consumption was 214.3 MB. Max. memory is 16.1 GB. * Witness Printer took 256.12 ms. Allocated memory is still 465.6 MB. Free memory was 177.0 MB in the beginning and 139.3 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 32]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L436] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L437] a10 = 1 [L439] return 25; VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND TRUE ((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))) [L232] a19 = 10 [L234] return 25; VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L503] COND TRUE ((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0)) [L504] a1 = (((((a1 % 89)- -93) * 5) % 89)- -56) [L505] a10 = 4 [L506] a19 = 8 [L508] return -1; VAL [a1=60, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND TRUE (((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) VAL [a1=60, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] reach_error() VAL [a1=60, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24627.5ms, OverallIterations: 12, TraceHistogramMax: 4, EmptinessCheckTime: 0.0ms, AutomataDifference: 19978.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 138.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1083 SDtfs, 1373 SDslu, 3 SDs, 0 SdLazy, 5542 SolverSat, 822 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6352.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 126.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=12313occurred in iteration=11, 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: 160.9ms SsaConstructionTime, 603.2ms SatisfiabilityAnalysisTime, 3009.6ms InterpolantComputationTime, 2337 NumberOfCodeBlocks, 2337 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2017 ConstructedInterpolants, 4 QuantifiedInterpolants, 7772 SizeOfPredicates, 1 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 816/1042 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:26:13,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97dda799-d04b-4945-aae4-3f040409845d/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...