./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.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_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/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_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/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_538ec62f-01f3-4204-abcb-11448a8c1b0a/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 7c295c4b11525bc49b762e22748ce84e03f9bb69 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:20:14,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-15 20:20:14,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-15 20:20:14,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-15 20:20:14,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-15 20:20:14,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-15 20:20:14,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-15 20:20:14,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-15 20:20:14,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-15 20:20:14,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-15 20:20:14,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-15 20:20:14,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-15 20:20:14,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-15 20:20:14,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-15 20:20:14,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-15 20:20:14,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-15 20:20:14,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-15 20:20:14,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-15 20:20:14,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-15 20:20:14,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-15 20:20:14,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-15 20:20:14,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-15 20:20:14,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-15 20:20:14,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-15 20:20:14,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-15 20:20:14,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-15 20:20:14,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-15 20:20:14,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-15 20:20:14,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-15 20:20:14,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-15 20:20:14,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-15 20:20:14,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-15 20:20:14,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-15 20:20:14,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-15 20:20:14,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-15 20:20:14,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-15 20:20:14,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-15 20:20:14,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-15 20:20:14,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-15 20:20:14,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-15 20:20:14,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-15 20:20:14,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-15 20:20:14,660 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-15 20:20:14,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-15 20:20:14,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-15 20:20:14,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-15 20:20:14,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-15 20:20:14,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-15 20:20:14,662 INFO L138 SettingsManager]: * Use SBE=true [2021-10-15 20:20:14,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-15 20:20:14,663 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-15 20:20:14,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-15 20:20:14,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-15 20:20:14,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-15 20:20:14,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-15 20:20:14,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-15 20:20:14,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-15 20:20:14,664 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-15 20:20:14,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-15 20:20:14,664 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-15 20:20:14,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-15 20:20:14,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-15 20:20:14,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-15 20:20:14,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-15 20:20:14,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 20:20:14,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-15 20:20:14,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-15 20:20:14,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-15 20:20:14,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-15 20:20:14,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-15 20:20:14,669 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-15 20:20:14,671 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-15 20:20:14,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-15 20:20:14,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-15 20:20:14,671 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_538ec62f-01f3-4204-abcb-11448a8c1b0a/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_538ec62f-01f3-4204-abcb-11448a8c1b0a/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 -> 7c295c4b11525bc49b762e22748ce84e03f9bb69 [2021-10-15 20:20:14,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-15 20:20:14,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-15 20:20:14,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-15 20:20:14,953 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-15 20:20:14,954 INFO L275 PluginConnector]: CDTParser initialized [2021-10-15 20:20:14,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2021-10-15 20:20:15,020 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/data/bee314ae9/9ac0b0cd91fe46d5a7a5d00ed87b2456/FLAGeaf05fbda [2021-10-15 20:20:15,589 INFO L306 CDTParser]: Found 1 translation units. [2021-10-15 20:20:15,589 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2021-10-15 20:20:15,603 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/data/bee314ae9/9ac0b0cd91fe46d5a7a5d00ed87b2456/FLAGeaf05fbda [2021-10-15 20:20:15,873 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/data/bee314ae9/9ac0b0cd91fe46d5a7a5d00ed87b2456 [2021-10-15 20:20:15,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-15 20:20:15,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-15 20:20:15,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-15 20:20:15,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-15 20:20:15,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-15 20:20:15,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:20:15" (1/1) ... [2021-10-15 20:20:15,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa13ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:15, skipping insertion in model container [2021-10-15 20:20:15,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:20:15" (1/1) ... [2021-10-15 20:20:15,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-15 20:20:15,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-15 20:20:16,280 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_538ec62f-01f3-4204-abcb-11448a8c1b0a/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2021-10-15 20:20:16,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 20:20:16,365 INFO L203 MainTranslator]: Completed pre-run [2021-10-15 20:20:16,428 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_538ec62f-01f3-4204-abcb-11448a8c1b0a/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2021-10-15 20:20:16,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 20:20:16,458 INFO L208 MainTranslator]: Completed translation [2021-10-15 20:20:16,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16 WrapperNode [2021-10-15 20:20:16,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-15 20:20:16,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-15 20:20:16,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-15 20:20:16,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-15 20:20:16,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-15 20:20:16,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-15 20:20:16,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-15 20:20:16,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-15 20:20:16,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-15 20:20:16,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-15 20:20:16,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-15 20:20:16,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-15 20:20:16,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (1/1) ... [2021-10-15 20:20:16,639 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 20:20:16,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 20:20:16,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-15 20:20:16,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-15 20:20:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-15 20:20:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-15 20:20:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-15 20:20:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-15 20:20:17,830 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-15 20:20:17,831 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-15 20:20:17,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:20:17 BoogieIcfgContainer [2021-10-15 20:20:17,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-15 20:20:17,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-15 20:20:17,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-15 20:20:17,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-15 20:20:17,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 08:20:15" (1/3) ... [2021-10-15 20:20:17,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22702e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:20:17, skipping insertion in model container [2021-10-15 20:20:17,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:20:16" (2/3) ... [2021-10-15 20:20:17,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22702e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:20:17, skipping insertion in model container [2021-10-15 20:20:17,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:20:17" (3/3) ... [2021-10-15 20:20:17,848 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label16.c [2021-10-15 20:20:17,858 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-15 20:20:17,858 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-15 20:20:17,923 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-15 20:20:17,931 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 20:20:17,932 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-15 20:20:17,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 375 transitions, 750 flow [2021-10-15 20:20:18,047 INFO L129 PetriNetUnfolder]: 149/375 cut-off events. [2021-10-15 20:20:18,048 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 20:20:18,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 375 events. 149/375 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 260 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 0. Up to 76 conditions per place. [2021-10-15 20:20:18,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 375 transitions, 750 flow [2021-10-15 20:20:18,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 370 transitions, 740 flow [2021-10-15 20:20:18,110 INFO L129 PetriNetUnfolder]: 92/206 cut-off events. [2021-10-15 20:20:18,111 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 20:20:18,111 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:20:18,111 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:20:18,112 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:20:18,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:20:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash -866593277, now seen corresponding path program 1 times [2021-10-15 20:20:18,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:20:18,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184411879] [2021-10-15 20:20:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:20:18,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:20:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:20:18,575 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 20:20:18,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:20:18,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184411879] [2021-10-15 20:20:18,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184411879] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:20:18,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:20:18,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 20:20:18,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723277682] [2021-10-15 20:20:18,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:20:18,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:20:18,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:20:18,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:20:18,612 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 375 [2021-10-15 20:20:18,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 370 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 20:20:18,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:20:18,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 375 [2021-10-15 20:20:18,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:20:19,539 INFO L129 PetriNetUnfolder]: 181/545 cut-off events. [2021-10-15 20:20:19,540 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 20:20:19,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 545 events. 181/545 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 762 event pairs, 0 based on Foata normal form. 61/365 useless extension candidates. Maximal degree in co-relation 3. Up to 314 conditions per place. [2021-10-15 20:20:19,552 INFO L132 encePairwiseOnDemand]: 172/375 looper letters, 353 selfloop transitions, 80 changer transitions 81/540 dead transitions. [2021-10-15 20:20:19,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 540 transitions, 2108 flow [2021-10-15 20:20:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:20:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:20:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2021-10-15 20:20:19,582 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6248888888888889 [2021-10-15 20:20:19,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 703 transitions. [2021-10-15 20:20:19,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 703 transitions. [2021-10-15 20:20:19,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:20:19,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 703 transitions. [2021-10-15 20:20:19,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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 20:20:19,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:19,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:19,617 INFO L186 Difference]: Start difference. First operand has 224 places, 370 transitions, 740 flow. Second operand 3 states and 703 transitions. [2021-10-15 20:20:19,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 540 transitions, 2108 flow [2021-10-15 20:20:19,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 540 transitions, 2108 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-15 20:20:19,647 INFO L242 Difference]: Finished difference. Result has 228 places, 323 transitions, 1118 flow [2021-10-15 20:20:19,649 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=228, PETRI_TRANSITIONS=323} [2021-10-15 20:20:19,650 INFO L334 CegarLoopForPetriNet]: 224 programPoint places, 4 predicate places. [2021-10-15 20:20:19,651 INFO L470 AbstractCegarLoop]: Abstraction has has 228 places, 323 transitions, 1118 flow [2021-10-15 20:20:19,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 20:20:19,652 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:20:19,652 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:20:19,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-15 20:20:19,653 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:20:19,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:20:19,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1684381881, now seen corresponding path program 1 times [2021-10-15 20:20:19,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:20:19,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631463674] [2021-10-15 20:20:19,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:20:19,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:20:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:20:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:20:19,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:20:19,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631463674] [2021-10-15 20:20:19,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631463674] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:20:19,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:20:19,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 20:20:19,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966212175] [2021-10-15 20:20:19,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:20:19,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:20:19,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:20:19,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:20:19,775 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 375 [2021-10-15 20:20:19,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 323 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 20:20:19,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:20:19,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 375 [2021-10-15 20:20:19,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:20:20,463 INFO L129 PetriNetUnfolder]: 283/879 cut-off events. [2021-10-15 20:20:20,465 INFO L130 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2021-10-15 20:20:20,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 879 events. 283/879 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2059 event pairs, 0 based on Foata normal form. 31/901 useless extension candidates. Maximal degree in co-relation 957. Up to 453 conditions per place. [2021-10-15 20:20:20,473 INFO L132 encePairwiseOnDemand]: 332/375 looper letters, 508 selfloop transitions, 53 changer transitions 0/583 dead transitions. [2021-10-15 20:20:20,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 583 transitions, 3124 flow [2021-10-15 20:20:20,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:20:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:20:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2021-10-15 20:20:20,477 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.464 [2021-10-15 20:20:20,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2021-10-15 20:20:20,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2021-10-15 20:20:20,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:20:20,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2021-10-15 20:20:20,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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 20:20:20,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:20,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:20,489 INFO L186 Difference]: Start difference. First operand has 228 places, 323 transitions, 1118 flow. Second operand 3 states and 522 transitions. [2021-10-15 20:20:20,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 583 transitions, 3124 flow [2021-10-15 20:20:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 583 transitions, 2842 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 20:20:20,528 INFO L242 Difference]: Finished difference. Result has 169 places, 357 transitions, 1361 flow [2021-10-15 20:20:20,530 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1361, PETRI_PLACES=169, PETRI_TRANSITIONS=357} [2021-10-15 20:20:20,537 INFO L334 CegarLoopForPetriNet]: 224 programPoint places, -55 predicate places. [2021-10-15 20:20:20,538 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 357 transitions, 1361 flow [2021-10-15 20:20:20,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 20:20:20,538 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:20:20,538 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1] [2021-10-15 20:20:20,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-15 20:20:20,539 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:20:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:20:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1709716194, now seen corresponding path program 1 times [2021-10-15 20:20:20,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:20:20,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747719625] [2021-10-15 20:20:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:20:20,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:20:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:20:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:20:20,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:20:20,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747719625] [2021-10-15 20:20:20,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747719625] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:20:20,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:20:20,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 20:20:20,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517569692] [2021-10-15 20:20:20,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:20:20,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:20:20,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:20:20,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:20:20,655 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 375 [2021-10-15 20:20:20,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 357 transitions, 1361 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 20:20:20,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:20:20,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 375 [2021-10-15 20:20:20,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:20:21,420 INFO L129 PetriNetUnfolder]: 499/1678 cut-off events. [2021-10-15 20:20:21,420 INFO L130 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2021-10-15 20:20:21,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 1678 events. 499/1678 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 6101 event pairs, 0 based on Foata normal form. 63/1732 useless extension candidates. Maximal degree in co-relation 989. Up to 829 conditions per place. [2021-10-15 20:20:21,432 INFO L132 encePairwiseOnDemand]: 307/375 looper letters, 484 selfloop transitions, 127 changer transitions 0/643 dead transitions. [2021-10-15 20:20:21,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 643 transitions, 3688 flow [2021-10-15 20:20:21,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:20:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:20:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-10-15 20:20:21,436 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47555555555555556 [2021-10-15 20:20:21,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-10-15 20:20:21,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-10-15 20:20:21,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:20:21,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-10-15 20:20:21,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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 20:20:21,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:21,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:21,443 INFO L186 Difference]: Start difference. First operand has 169 places, 357 transitions, 1361 flow. Second operand 3 states and 535 transitions. [2021-10-15 20:20:21,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 643 transitions, 3688 flow [2021-10-15 20:20:21,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 643 transitions, 3590 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 20:20:21,469 INFO L242 Difference]: Finished difference. Result has 172 places, 471 transitions, 2690 flow [2021-10-15 20:20:21,470 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2690, PETRI_PLACES=172, PETRI_TRANSITIONS=471} [2021-10-15 20:20:21,470 INFO L334 CegarLoopForPetriNet]: 224 programPoint places, -52 predicate places. [2021-10-15 20:20:21,470 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 471 transitions, 2690 flow [2021-10-15 20:20:21,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 20:20:21,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:20:21,471 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:20:21,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-15 20:20:21,472 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:20:21,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:20:21,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1852917719, now seen corresponding path program 1 times [2021-10-15 20:20:21,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:20:21,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333527561] [2021-10-15 20:20:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:20:21,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:20:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:20:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:20:21,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:20:21,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333527561] [2021-10-15 20:20:21,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333527561] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:20:21,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:20:21,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:20:21,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531300683] [2021-10-15 20:20:21,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:20:21,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:20:21,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:20:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:20:21,526 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 375 [2021-10-15 20:20:21,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 471 transitions, 2690 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 20:20:21,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:20:21,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 375 [2021-10-15 20:20:21,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:20:22,707 INFO L129 PetriNetUnfolder]: 770/2932 cut-off events. [2021-10-15 20:20:22,707 INFO L130 PetriNetUnfolder]: For 2044/2044 co-relation queries the response was YES. [2021-10-15 20:20:22,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7635 conditions, 2932 events. 770/2932 cut-off events. For 2044/2044 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 14024 event pairs, 0 based on Foata normal form. 166/3097 useless extension candidates. Maximal degree in co-relation 2378. Up to 1604 conditions per place. [2021-10-15 20:20:22,727 INFO L132 encePairwiseOnDemand]: 290/375 looper letters, 538 selfloop transitions, 227 changer transitions 0/786 dead transitions. [2021-10-15 20:20:22,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 786 transitions, 5852 flow [2021-10-15 20:20:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:20:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:20:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2021-10-15 20:20:22,734 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4524444444444444 [2021-10-15 20:20:22,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2021-10-15 20:20:22,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2021-10-15 20:20:22,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:20:22,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2021-10-15 20:20:22,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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 20:20:22,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:22,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:22,742 INFO L186 Difference]: Start difference. First operand has 172 places, 471 transitions, 2690 flow. Second operand 3 states and 509 transitions. [2021-10-15 20:20:22,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 786 transitions, 5852 flow [2021-10-15 20:20:22,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 786 transitions, 5474 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 20:20:22,780 INFO L242 Difference]: Finished difference. Result has 174 places, 650 transitions, 5064 flow [2021-10-15 20:20:22,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=2404, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5064, PETRI_PLACES=174, PETRI_TRANSITIONS=650} [2021-10-15 20:20:22,781 INFO L334 CegarLoopForPetriNet]: 224 programPoint places, -50 predicate places. [2021-10-15 20:20:22,781 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 650 transitions, 5064 flow [2021-10-15 20:20:22,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 20:20:22,782 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:20:22,782 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:20:22,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-15 20:20:22,783 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:20:22,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:20:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash -882188190, now seen corresponding path program 1 times [2021-10-15 20:20:22,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:20:22,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391750292] [2021-10-15 20:20:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:20:22,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:20:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:20:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-15 20:20:22,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:20:22,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391750292] [2021-10-15 20:20:22,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391750292] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:20:22,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:20:22,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:20:22,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827059461] [2021-10-15 20:20:22,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:20:22,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:20:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:20:22,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:20:22,829 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 375 [2021-10-15 20:20:22,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 650 transitions, 5064 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 20:20:22,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:20:22,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 375 [2021-10-15 20:20:22,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:20:23,957 INFO L129 PetriNetUnfolder]: 535/2407 cut-off events. [2021-10-15 20:20:23,958 INFO L130 PetriNetUnfolder]: For 3494/3494 co-relation queries the response was YES. [2021-10-15 20:20:23,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6558 conditions, 2407 events. 535/2407 cut-off events. For 3494/3494 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 11630 event pairs, 0 based on Foata normal form. 123/2530 useless extension candidates. Maximal degree in co-relation 2456. Up to 1140 conditions per place. [2021-10-15 20:20:23,974 INFO L132 encePairwiseOnDemand]: 308/375 looper letters, 505 selfloop transitions, 179 changer transitions 0/718 dead transitions. [2021-10-15 20:20:23,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 718 transitions, 6016 flow [2021-10-15 20:20:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:20:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:20:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2021-10-15 20:20:23,978 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.45511111111111113 [2021-10-15 20:20:23,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2021-10-15 20:20:23,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2021-10-15 20:20:23,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:20:23,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2021-10-15 20:20:23,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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 20:20:23,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:23,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 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 20:20:23,986 INFO L186 Difference]: Start difference. First operand has 174 places, 650 transitions, 5064 flow. Second operand 3 states and 512 transitions. [2021-10-15 20:20:23,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 718 transitions, 6016 flow [2021-10-15 20:20:24,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 718 transitions, 5632 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 20:20:24,021 INFO L242 Difference]: Finished difference. Result has 175 places, 574 transitions, 4535 flow [2021-10-15 20:20:24,022 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=3892, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4535, PETRI_PLACES=175, PETRI_TRANSITIONS=574} [2021-10-15 20:20:24,022 INFO L334 CegarLoopForPetriNet]: 224 programPoint places, -49 predicate places. [2021-10-15 20:20:24,022 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 574 transitions, 4535 flow [2021-10-15 20:20:24,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 20:20:24,023 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:20:24,023 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:20:24,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-15 20:20:24,024 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:20:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:20:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1619945599, now seen corresponding path program 1 times [2021-10-15 20:20:24,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:20:24,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697691250] [2021-10-15 20:20:24,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:20:24,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:20:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 20:20:24,058 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-15 20:20:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 20:20:24,131 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-15 20:20:24,131 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-15 20:20:24,132 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-15 20:20:24,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-15 20:20:24,140 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-15 20:20:24,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 08:20:24 BoogieIcfgContainer [2021-10-15 20:20:24,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-15 20:20:24,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-15 20:20:24,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-15 20:20:24,246 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-15 20:20:24,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:20:17" (3/4) ... [2021-10-15 20:20:24,249 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-15 20:20:24,371 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/witness.graphml [2021-10-15 20:20:24,371 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-15 20:20:24,373 INFO L168 Benchmark]: Toolchain (without parser) took 8495.96 ms. Allocated memory was 96.5 MB in the beginning and 205.5 MB in the end (delta: 109.1 MB). Free memory was 58.1 MB in the beginning and 167.0 MB in the end (delta: -108.9 MB). Peak memory consumption was 106.7 MB. Max. memory is 16.1 GB. [2021-10-15 20:20:24,373 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 96.5 MB. Free memory is still 76.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-15 20:20:24,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.54 ms. Allocated memory is still 96.5 MB. Free memory was 57.9 MB in the beginning and 56.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-15 20:20:24,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.02 ms. Allocated memory is still 96.5 MB. Free memory was 56.0 MB in the beginning and 50.7 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-15 20:20:24,375 INFO L168 Benchmark]: Boogie Preprocessor took 56.69 ms. Allocated memory is still 96.5 MB. Free memory was 50.7 MB in the beginning and 46.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-15 20:20:24,375 INFO L168 Benchmark]: RCFGBuilder took 1222.36 ms. Allocated memory was 96.5 MB in the beginning and 134.2 MB in the end (delta: 37.7 MB). Free memory was 46.1 MB in the beginning and 68.2 MB in the end (delta: -22.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. [2021-10-15 20:20:24,376 INFO L168 Benchmark]: TraceAbstraction took 6408.87 ms. Allocated memory was 134.2 MB in the beginning and 205.5 MB in the end (delta: 71.3 MB). Free memory was 67.5 MB in the beginning and 72.0 MB in the end (delta: -4.5 MB). Peak memory consumption was 66.8 MB. Max. memory is 16.1 GB. [2021-10-15 20:20:24,376 INFO L168 Benchmark]: Witness Printer took 125.47 ms. Allocated memory is still 205.5 MB. Free memory was 72.0 MB in the beginning and 167.0 MB in the end (delta: -95.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 16.1 GB. [2021-10-15 20:20:24,379 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 96.5 MB. Free memory is still 76.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 581.54 ms. Allocated memory is still 96.5 MB. Free memory was 57.9 MB in the beginning and 56.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.02 ms. Allocated memory is still 96.5 MB. Free memory was 56.0 MB in the beginning and 50.7 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.69 ms. Allocated memory is still 96.5 MB. Free memory was 50.7 MB in the beginning and 46.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1222.36 ms. Allocated memory was 96.5 MB in the beginning and 134.2 MB in the end (delta: 37.7 MB). Free memory was 46.1 MB in the beginning and 68.2 MB in the end (delta: -22.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6408.87 ms. Allocated memory was 134.2 MB in the beginning and 205.5 MB in the end (delta: 71.3 MB). Free memory was 67.5 MB in the beginning and 72.0 MB in the end (delta: -4.5 MB). Peak memory consumption was 66.8 MB. Max. memory is 16.1 GB. * Witness Printer took 125.47 ms. Allocated memory is still 205.5 MB. Free memory was 72.0 MB in the beginning and 167.0 MB in the end (delta: -95.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 443]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L110] a17 = 7 [L111] a25 = 0 [L112] a11 = 1 [L113] a28 = 10 [L114] a19 = 0 [L115] return -1; VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L442] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L443] reach_error() VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 47.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6220.9ms, OverallIterations: 6, TraceHistogramMax: 4, EmptinessCheckTime: 0.0ms, AutomataDifference: 5085.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 130.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 376 SDtfs, 728 SDslu, 0 SDs, 0 SdLazy, 1927 SolverSat, 376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1945.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5064occurred in iteration=4, InterpolantAutomatonStates: 15, 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: 58.5ms SsaConstructionTime, 185.5ms SatisfiabilityAnalysisTime, 448.1ms InterpolantComputationTime, 627 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 88/88 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 20:20:24,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538ec62f-01f3-4204-abcb-11448a8c1b0a/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...